On the Optimality of Forest-Type File Transfers on a File Transmission Net

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-07-25

著者

• Shinoda Shoji

  The Faculty Of Science And Engineering Chuo University

• Kaneko Yoshihiro

  The Faculty Of Engineering Gifu University

関連論文

• A Synthesis of an Optimal File Transfer on a File Transmission Net (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
• Transient Characteristics of Mobile Communication Traffic in a Band-Shaped Service Area (Special Section on JTC-CSCC '92)
• On the Optimality of Forest-Type File Transfers on a File Transmission Net
• Research Topics and Results on Analysis and Diagnosis of Linear Circuits by Japanese Researchers in These Twenty Years (Special Section on Surveys of Researches in CAS Fields in the Last Two Decades, I)

スポンサーリンク