このエントリーをはてなブックマークに追加
ID 34092
フルテキストURL
fulltext.pdf 1.72 MB
著者
Funabiki, Nobuo Okayama University Kaken ID publons researchmap
Isogai, Megumi Okayama University
Higashino, Teruo Osaka University, Osaka
抄録

Application-level multicast (ALM) communications replicate packets on host level to deliver them from a single source to multiple clients, so that it can efficiently realize a variety of network applications using moving pictures such as video conferences, distance learning, and video-on-demands. In this paper, we propose the CT+ (compact tree plus) algorithm for finding a better ALM routing tree in terms of delay minimization between hosts. CT+ consists of a tree construction stage from the existing CT algorithm, and a newly added iterative tree improvement stage. Then, we define the extended ALM routing problem and its heuristic algorithm ExCT+, to optimize the effectiveness of the multihome network in ALM communications by selecting multihomed hosts and connections in the ALM routing tree simultaneously. For their evaluations, we construct a network simulation model named MINET (multiple-ISP network simulator), where the topology is composed of multiple ISP backbone networks with IX connections, and the network traffic is generated by following the M/M/1 queuing process. The simulation results using MINET verify the effectiveness of our algorithms.

キーワード
multicast communication
queueing theory
telecommunication network routing
備考
Digital Object Identifier: 10.1109/ICON.2005.1635456
Published with permission from the copyright holder. This is the institute's copy, as published in Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on, 16-18 Nov. 2005, Volume 1, Pages 6.
Publisher URL:http://dx.doi.org/10.1109/ICON.2005.1635456
Copyright © 2005 IEEE. All rights reserved.
発行日
2005-11
出版物タイトル
Networks
1巻
資料タイプ
学術雑誌論文
言語
English
査読
有り
DOI
Submission Path
electrical_engineering/79