Keywords
multicast, routing, path searching
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.
Original Publication Citation
Daniel Zappala and Dayi Zhou, "Performance Evaluation of Path Searching Heuristics for Multicast QoS Routing", IEEE 11th International Conference on Computer Communications and Networks (ICCCN), October 22.
BYU ScholarsArchive Citation
Zappala, Daniel and Zhou, Dayi, "Performance Evaluation of Path Searching Heuristics for Multicast QoS Routing" (2002). Faculty Publications. 532.
https://scholarsarchive.byu.edu/facpub/532
Document Type
Peer-Reviewed Article
Publication Date
2002-10-01
Permanent URL
http://hdl.lib.byu.edu/1877/2562
Publisher
IEEE
Language
English
College
Physical and Mathematical Sciences
Department
Computer Science
Copyright Status
© 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information
http://lib.byu.edu/about/copyright/