DocumentCode :
2257770
Title :
A distributed multicast routing protocol with QoS constraints
Author :
Layuan, Li ; Chunlin, Li
Author_Institution :
Dept. of Comput. Sci., Wuhan Univ. of Technol., China
fYear :
2002
fDate :
2002
Firstpage :
37
Lastpage :
42
Abstract :
This paper discusses the multicast routing problem with multiple QoS constraints, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. It presents a distributed multicast routing protocol (DMRP). The DMRP attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. In DMRP, a multicast group member can join or leave a multicast session dynamically, which should not disrupt the multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost´s (or lower cost) requirements. The proof of correctness and complexity analysis of the DMRP are also given. Simulation results show that DMRP is an available approach to multicast routing decision for dynamic network with multiple QoS constraints.
Keywords :
computational complexity; delays; distributed processing; graph theory; jitter; multicast protocols; quality of service; routing protocols; DMRP; NP-complete problem; QoS constraints; bandwidth; complexity analysis; correctness proof; cost minimization; delay; delay jitter; distributed multicast routing protocol; dynamic network; multicast group; multicast tree; network model; overhead reduction; packet loss metrics; simulation results; weighted digraph; Bandwidth; Computer science; Cost function; Delay effects; Heuristic algorithms; IP networks; Jitter; Multicast algorithms; Multicast protocols; Routing protocols;
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.1033286
Filename :
1033286
Link To Document :
بازگشت