OVERLAY MULTICAST TREE MINIMIZING AVERAGE TIME DELAY
SCIE
SCOPUS
- Title
- OVERLAY MULTICAST TREE MINIMIZING AVERAGE TIME DELAY
- Authors
- Song, H; Lee, DS
- Date Issued
- 2004-04
- Publisher
- SPRINGER-VERLAG BERLIN
- Abstract
- In this work, we present an overlay multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems. At the same time, the proposed algorithm considers the computing power and the network condition of each end-system as a control variable and thus we can avoid the disastrous case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.
- Keywords
- NETWORKS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/28671
- ISSN
- 0302-9743
- Article Type
- Article
- Citation
- NETWORKING 2004 - NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS, vol. 3042, page. 211 - 222, 2004-04
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.