DocumentCode
2388797
Title
Performance evaluation of path searching heuristics for multicast QoS routing
Author
Zappala, Daniel ; Zhou, Dayi
Author_Institution
Dept. of Comput. Sci., 1202 Oregon Univ., Eugene, OR, USA
fYear
2002
fDate
14-16 Oct. 2002
Firstpage
248
Lastpage
254
Abstract
Quality of service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.
Keywords
Internet; multicast protocols; quality of service; routing protocols; search problems; QoS-specific searching; generic path searching; low-overhead path searching heuristics; multicast QoS routing; multicast tree; path searching heuristics; performance evaluation; quality of service routing; receiver-oriented path searching heuristics; Bandwidth; Computer applications; Computer science; History; Multicast protocols; Quality of service; Routing protocols; Testing; Unicast; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on
ISSN
1095-2055
Print_ISBN
0-7803-7553-X
Type
conf
DOI
10.1109/ICCCN.2002.1043074
Filename
1043074
Link To Document