A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices

Yoshihiro KANEKO  Koichi SUZUKI  Shoji SHINODA  Kazuo HORIUCHI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E78-A   No.6   pp.671-679
Publication Date: 1995/06/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1994 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '94))
Category: 
Keyword: 
vertex cost,  arc cost,  vertex demand,  optimal file transfer,  source vertex set,  forest,  

Full Text: PDF>>
Buy this Article




Summary: 
A problem of synthesizing an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a file J with some information from source vertex set S to all vertices of N by the respective vertices' copy demand numbers. The case of |S| =1 has been studied so far. This paper deals with N such that |S|1, where a forest-type file transfer is defined. This paper proposes a polynomial time algorithm to synthesize an optimal forest-type file transfer on such N satisfying SM U, where M and U are mother vertex set and positive demand vertex set of N, respectively.