VTDM - A dynamic multicast routing algorithm

被引：0
|
作者：
Lin, HC [1 ]
Lai, SC [1 ]
机构：
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 30043, Taiwan
来源：
IEEE INFOCOM '98 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS. 1-3: GATEWAY TO THE 21ST CENTURY | 1998年
关键词：
ATM networks; dynamic multicast routing algorithm;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, the dynamic multicast routing problem is studied. The multicast routing problem has been shown to be NP-complete. Many heuristics have been proposed to find the multicast trees for multicast connection. In computer networks, application services may allow nodes to join or leave the multicast connection dynamically. The multicast routing problem in which nodes are allowed to join or leave the multicast connection is called the dynamic multicast routing problem. A nw dynamic multicast routing algorithm called Virtual Trunk Dynamic Multicast (VTDM) routing algorithm is proposed for this problem. A Virtual Trunk (VT) is a tree of the underlying graphs. It is used as template for constructing multicast trees. The VTDM routing algorithm constructs multicast trees based on the virtual trunk. Simulations are performed to study the performance of the VTDM routing algorithm. Simulation results show that the performance of the VTDM algorithm is close to that of the KMB algorithm [14] (a near optimal heuristic for the static multicast routing problem).
引用
收藏
页码：1426 / 1432
页数：7
相关论文
共 50 条
  • [31] Multicast Routing Algorithm Based On Genetic Algorithm
    Chen, Yanhua
    INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2015, 8 (06): : 83 - 92
  • [32] Two-stage evolutionary algorithm for dynamic multicast routing in mesh network
    Zhu, Li
    Li, Zhi-shu
    Chen, Liang-yin
    Cheng, Yan-hong
    JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2008, 9 (06): : 791 - 798
  • [33] Two-stage evolutionary algorithm for dynamic multicast routing in mesh network
    Li ZHU1
    Journal of Zhejiang University(Science A:An International Applied Physics & Engineering Journal), 2008, (06) : 791 - 798
  • [34] Dynamic algorithm for delay-constrained low-cost multicast routing
    College of Electronic and Information Engineering, Tongji University, Shanghai 200092, China
    Tongxin Xuebao, 2006, 5 (41-46):
  • [35] Multi-objective optimization model and heuristic algorithm for dynamic multicast routing
    Donoso, Y
    Fabregat, R
    Marzo, JL
    NETWORKS 2004 11TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM, PROCEEDINGS, 2004, : 423 - 428
  • [36] Two-stage evolutionary algorithm for dynamic multicast routing in mesh network
    Li Zhu
    Zhi-shu Li
    Liang-yin Chen
    Yan-hong Cheng
    Journal of Zhejiang University-SCIENCE A, 2008, 9 : 791 - 798
  • [37] A distributed low-cost dynamic multicast routing algorithm with delay constraints
    Shin, MW
    Joo, NK
    Lim, HS
    EURASIA-ICT 2002: INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS, 2002, 2510 : 377 - 386
  • [38] Dynamic delay-bounded constraint multicast routing algorithm based on GA
    Pan, Jinsong
    Li, Layuan
    Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering), 2004, 28 (01):
  • [39] A multicast routing algorithm with multiple trees
    Cui Xunxue 1
    2. Jiangsu Key Laboratory of Computer Information Processing Technology
    3. Department of Electronic Engineering and Information Science
    4. School of Electronic Science and Technology
    JournalofSystemsEngineeringandElectronics, 2005, (02) : 426 - 432
  • [40] Algorithm for an oriented multicast routing protocol
    Magoni, D
    Pansiot, JJ
    2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, 2001, : 2593 - 2597
12345