A QoS multicast routing protocol for dynamic group topology

被引:22
作者
Li, LY [1 ]
Li, CL [1 ]
机构
[1] Wuhan Univ Technol, Dept Comp Sci, Wuhan 430063, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.1016/j.ins.2004.02.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay-jitter, packet-loss and bandwidth should satisfy the pre-specified bounds. 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 QoS multicast routing protocol with dynamic group topology (QMRPD). The QMRPD attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. In MPRMQ, 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. In this paper, the proof of correctness and complexity analysis of the QMRPD are also given. Simulation results show that QMRPD is an available approach to multicast routing decision with dynamic group topology. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码:113 / 130
页数:18
相关论文
共 26 条
[1]  
BALLARDIE T, 1993, ACM SIGCOMM, P85
[2]  
Busacker R., 1965, Finite Graphs and Networks: an Introduction with Applications
[3]  
CARBERG K, 1997, ACM COMPUTER COMMUNI, P5
[4]   Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks [J].
Chang, BJ ;
Hwang, RH .
INFORMATION SCIENCES, 2003, 151 :1-26
[5]  
Charikar M., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1518, DOI 10.1109/INFCOM.2000.832550
[6]  
CHEN S, 1999, IEEE JSAC AUG, P72
[7]  
Cidon I, 1997, IEEE INFOCOM SER, P92, DOI 10.1109/INFCOM.1997.635118
[8]  
FALOUTSOS M, 1998, SIGCOMM P 98 SEPT, P56
[9]   QoS routing in networks with inaccurate information:: Theory and algorithms [J].
Guérin, RA ;
Orda, A .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (03) :350-364
[10]   A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks [J].
Jia, XH .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (06) :828-837