1. Academy of Information Technology, Luoyang Normal University, Luoyang Henan 471022, China
2. College of Information Technology, Luoyang Normal University, Luoyang Henan 471022, China
[1]AISSA M, MNAOUER A B. A new delay-constrained algorithm for multicast routing tree construction [J].International Journal of Communication Systems, 2004, 17(10):985-1000.[2]LEE H,YOUN C. Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree[C]// IEEE International Conference on Communications. Washington, DC: IEEE Computer Society,2000:1343-1347.[3]KOMPELLA V P, PASQUAL J C, POLYZOS G C. Multicast routing for multimedia communication [J].IEEE/ACM Transactions on Networking,1993,1(3):286-292.[4]WAXMAN B. Routing of multipoint connections [J].IEEE Journal on Selected Area in Communications, 1988, 6(9):1617-1622.[5]BAUER F, VARMA A. ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm [J].IEEE Journal on Selected Areas in Communications, 1997,15(3): 382-397.[6]杨春德,邓超. 一种动态的时延约束费用优化多播路由算法[J].重庆邮电大学学报:自然科学版,2011,23(1):96-100.[7]李昌兵, 杜茂康, 胡华. 结合分布式与集中式特点的动态多播路由算法[J].计算机系统应用, 2008,17(6): 62-66.[8]陈琳. 基于QoS约束的多播路由问题研究[D]. 武汉:武汉大学, 2005.[9]李元臣,刘维群. 时延受限组播路由的最短路径加速算法求解[J].计算机应用,2010,30(5):1176-1182.[10]余萍. 基于多QoS约束的多播路由问题研究[J]. 计算机科学, 2007, 34(9): 42-86.[11]ZHU Q, PARSA M C, GARCIA-LUNA-ACEVES J J. A source-based algorithm for delay-constrained minimum-cost multicasting[C]// Proceedings of IEEE INFOCOM'95. Washington, DC: IEEE Computer Society,1995: 377-385.