DocumentCode
2257745
Title
A multicast routing protocol supporting multiple QoS constraints
Author
Dai, Jinquan ; Pung, Hung Keng ; Angchuan, Touchai
Author_Institution
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
fYear
2002
fDate
2002
Firstpage
31
Lastpage
36
Abstract
The main goal of QoS multicast routing is to construct a multicast connection (usually in the form of a shared tree) meeting multiple QoS constraints. Unfortunately, QoS routing is generally a NP-complete problem when there are multiple routing objectives to meet. In this paper, we propose a new QoS multicast routing protocol, in which a multicast tree meeting multiple QoS constraints can be constructed in a distributed fashion using local network states at routers. We compare the performance of our scheme with other QoS multicast routing protocols through extensive simulations, and find that our protocol always performs better than them in terms of blocking probability and set-up latency, and it generates fewer overheads at heavy network loads.
Keywords
delays; distributed algorithms; multicast protocols; probability; quality of service; routing protocols; telecommunication congestion control; telecommunication traffic; trees (mathematics); NP-complete problem; blocking probability; distributed tree; local network states; multicast routing protocol; multicast tree; multiple QoS constraints; network loads; overheads; performance; routers; set-up latency; Bandwidth; Computer networks; Computer science; Delay; Multicast algorithms; Multicast protocols; Multimedia communication; NP-complete problem; Routing protocols; Unicast;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks, 2002. ICON 2002. 10th IEEE International Conference on
Print_ISBN
0-7803-7533-5
Type
conf
DOI
10.1109/ICON.2002.1033285
Filename
1033285
Link To Document