| [1] Cain B, Ballardie A, Zhang Z. Core based trees (CBTversion 3) multicast routing, protocol specification. Inter-Domain Multicast Routing, 2003, Internet Draft, http://tools.ietf.org/id/draft-ietf-idmr-cbt-spec-v3-01.txt.[2] Fenner B. Protocol independent multicast-sparse mode (PIM-SM): Protocol specification (revised). Internet RFC 4601, Au-gust 2008.[3] Wall D W. Mechanisms for broadcast and selective broadcast [Ph.D. Dissertation], Stanford University, 1980.[4] Oliveira C A S, Pardalos P M. A survey of combinatorialoptimization problems in multicast routing. Computers andOperations Research, 2005, 32(8): 1953-1981.[5] Chung S M, Youn C H. Core selection algorithm for multicastrouting under multiple QoS constraints. Electronics Letters,2000, 36(4): 378-379.[6] Kim M, Bang Y C et al. On efficient core selection for reduc-ing multicast delay variation under delay constraints. IEICETrans. Communications, 2006, E89-B(9): 2385-2393.[7] Harutyunyan H A, Dong X. A new algorithm for RP selectionin PIM-SM multicast routing. In Proc. Int. Conf. Wire-less and Optical Communications, Banff, Canada, Jul. 14-16,2003, pp.208-216.[8] Lee D L, Youn C H, Jeong S J. RP reselection scheme for real-time applications in delay-constrained multicast networks. InProc. IEEE International Conference on Communications,New York, USA, Apr. 28-May 2, 2002, pp.1290-1294.[9] Mukherjee R, Atwood J W. Rendezvous point relocation inprotocol independent multicast-sparse mode. Telecommuni-cation Systems, 2003, 24(2-4): 207-220.[10] Putthividhya W, Tavanapong Wet al. selection with QoSsupport. In Proc. IEEE Int. Conf. Communications, Paris,France, Jun. 20-24, 2004, pp.2132-2137.[11] Font F, Mlynek D. Applying clustering algorithms as coreselection methods for multiple core trees. In Proc. IEEEInt. Conf. Communications, Paris, France, Jun. 20-24, 2004,pp.2030-2035.[12] Rouskas G N, Baldine I. Multicast routing with end-to-enddelay and delay variation constraints. IEEE Journal on Se-lected Area in Communications, 1997, 15(3): 346-356.[13] Sheu P R, Chen S T. A fast and efficient heuristic algori-thm for the delay-and delay variation-bounded multicast treeproblem. Computer Communications, 2002, 25(8): 825-833.[14] Ahn Y, Kim M, Bang Y C, Choo H. On algorithm for thedelay-and delay variation-bounded multicast trees based onestimation. In Proc. HPCC2005, Sorrento, Italy, Sept. 21-23, 2005, pp.277-282.[15] Ahn S, Kim M, Choo H. Efficient algorithm for reducing delayvariation on delay-bounded multicast trees in heterogeneousnetworks. In Proc. WCNC, Las Vegas, USA, Mar. 31-Apr. 3,2008, pp.2741-2746.[16] Zhao J, Hassanein H, Wu J, Gu G. End-to-end QoS rout-ing framework for differentiated services networks. ComputerCommunications, 2003, 26(6): 566-578. |