
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Synthesis of a ForestType 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.E78A
No.6
pp.671679 Publication Date: 1995/06/25
Online ISSN:
DOI:
Print ISSN: 09168508 Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1994 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTCCSCC '94)) Category: Keyword: vertex cost, arc cost, vertex demand, optimal file transfer, source vertex set, forest,
Full Text: PDF>>
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 S1, where a foresttype file transfer is defined. This paper proposes a polynomial time algorithm to synthesize an optimal foresttype file transfer on such N satisfying SM U, where M and U are mother vertex set and positive demand vertex set of N, respectively.

