A multicast routing protocol supporting multiple QoS constraints
Proceedings 10th IEEE International Conference on Networks (ICON 2002). Towards Network Superiority (Cat. No.02EX588) - Trang 31-36
Tóm tắt
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.
Từ khóa
#Multicast protocols #Routing protocols #Unicast #NP-complete problem #Delay #Multicast algorithms #Computer networks #Computer science #Multimedia communication #BandwidthTài liệu tham khảo
10.1109/90.731196
10.1109/49.12889
10.17487/rfc3031
10.17487/rfc2205
10.1109/49.898738
pling, 1999, Fast and Efficient Flooding Based QoS Routing Algorithm, Proc IEEE ICC 99, 298
wang, 2000, Multicast Routing and Its QoS Extension Problems Algorithms and Protocols, 14, 22
10.1109/90.490743
ballardie, 0, Core-based trees (CBT version 2) multicast routing
faloutsos, 0, QoSMIC quality of service sensitive multicast Internet protocol, Proceedings of ACM SIGCOMM '98 October 1998, 144
10.1109/INFCOM.1995.515898
10.1109/90.234851
10.1109/INFCOM.1996.497913
garey, 1979, Computers and Intractability A Guide to the Theory of NP-Completeness
10.1145/251007.251008
tyan, 0, QoS Extension to the Core Based Tree Protocol, Proceedings of NOSSDAV '99 June 1999