The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
파일 전송망에서 최적의 파일 전송을 얻는 문제 N 최소한의 총 비용으로 특정 정보 파일의 복사본을 일부 정점에서 다른 정점으로 전송하는 방법을 고려하는 것입니다. N 각 정점의 복사 요구 수에 따라. 이 문제는 일반적인 파일 전송망에서는 NP-hard이다. 지금까지 일부 클래스의 N 최적의 파일 전송을 얻기 위한 다항식 시간 알고리즘이 설계된 것으로 알려져 있습니다. 또한 제한된 파일 전송, 즉 포리스트 유형 파일 전송을 처리하면 보다 일반적인 클래스에서 최적의 '포리스트 유형' 파일 전송을 얻을 수 있습니다. N. 본 논문은 이러한 일반 네트의 경우 최적의 파일 전송을 얻기 위해서는 포레스트 유형의 파일 전송을 고려하는 것으로 충분하다는 것을 증명합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Yoshihiro KANEKO, Shoji SHINODA, "On the Optimality of Forest-Type File Transfers on a File Transmission Net" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 7, pp. 1411-1419, July 2000, doi: .
Abstract: A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to transmit, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This problem is NP-hard for a general file transmission net. So far, some class of N on which polynomial time algorithms for obtaining an optimal file transfer are designed has been known. In addition, if we deal with restricted file transfers, i. e. , forest-type file transfers, we can obtain an optimal 'forest-type' file transfer on more general class of N. This paper proves that for such general nets it suffices to consider forest-type file transfers in order to obtain an optimal file transfer.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_7_1411/_p
부
@ARTICLE{e83-a_7_1411,
author={Yoshihiro KANEKO, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Optimality of Forest-Type File Transfers on a File Transmission Net},
year={2000},
volume={E83-A},
number={7},
pages={1411-1419},
abstract={A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to transmit, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This problem is NP-hard for a general file transmission net. So far, some class of N on which polynomial time algorithms for obtaining an optimal file transfer are designed has been known. In addition, if we deal with restricted file transfers, i. e. , forest-type file transfers, we can obtain an optimal 'forest-type' file transfer on more general class of N. This paper proves that for such general nets it suffices to consider forest-type file transfers in order to obtain an optimal file transfer.},
keywords={},
doi={},
ISSN={},
month={July},}
부
TY - JOUR
TI - On the Optimality of Forest-Type File Transfers on a File Transmission Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1411
EP - 1419
AU - Yoshihiro KANEKO
AU - Shoji SHINODA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2000
AB - A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to transmit, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This problem is NP-hard for a general file transmission net. So far, some class of N on which polynomial time algorithms for obtaining an optimal file transfer are designed has been known. In addition, if we deal with restricted file transfers, i. e. , forest-type file transfers, we can obtain an optimal 'forest-type' file transfer on more general class of N. This paper proves that for such general nets it suffices to consider forest-type file transfers in order to obtain an optimal file transfer.
ER -