For Full-Text 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.
On an Optimal File Transfer on an Arborescence-Net with Constraints on Copying Numbers
Yoshihiro KANEKO Shoji SHINODA Kazuo HORIUCHI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1995/04/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs and Networks
copying cost, transmission cost, copy demand number, copying number, arborescence-net, file trasfer,
Full Text: PDF>>
A problem of obtaining 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 with some information from a vertex of N to all vertices of N by the respective vertices' copy demand numbers (i.i., needed numbers of copies). The maximum number of copies of file which can be made at a vertex is called the copying number of the vertex. In this paper, we consider as N an arborescence-net with constraints on copying numbers, and give a necessary and sufficient condition for a file transfer to be optimal on N, and furthermore propose an O(n2) algorithm for obtaining an optimal file transfer on N, where n is the number of vertices of N.