Presentation 1999/1/21
A synthesis of an optimal file transfer on networks where each vertex has at most one demand
Yoshihiro KANEKO, Shoji SHINODA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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 certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This report deals with the case that arbitrary number of files are given from the outside of N, though each vertex has at most one demand. In such a situation, this paper shows an algorithm to solve a problem of obtaining an optimal file transfer.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) optimal file transfer / arbitrary number of files / vertex demand
Paper # CAS98-69
Date of Issue

Conference Information
Committee CAS
Conference Date 1999/1/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A synthesis of an optimal file transfer on networks where each vertex has at most one demand
Sub Title (in English)
Keyword(1) optimal file transfer
Keyword(2) arbitrary number of files
Keyword(3) vertex demand
1st Author's Name Yoshihiro KANEKO
1st Author's Affiliation Faculty of Engineering GIFU University()
2nd Author's Name Shoji SHINODA
2nd Author's Affiliation Faculty of Science and Engineering, Chuo Uiversity
Date 1999/1/21
Paper # CAS98-69
Volume (vol) vol.98
Number (no) 515
Page pp.pp.-
#Pages 8
Date of Issue