Citation: | Cheng Lianzhen, Zhang Jun, Liu Kaiet al. Multicast routing algorithms with low tree cost for LEO satellite networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(07): 821-825. (in Chinese) |
[1] Ekici E, Akyildiz I F, Bender M D. A multicast routing algorithm for LEO satellite IP networks [J]. IEEE/ACM Transactions on Networking, 2002, 10(2):183-192 [2] Yang D N, Liao W. On multicast routing using rectilinear Steiner trees for LEO satellite networks Proc IEEE Globecom 2004. Dallas Texas, USA:, 2004:2712-2716 [3] Sahasrabuddhe L H, Mukherjee B. Multicast routing algorithms and protocols:a tutorial [J]. IEEE Network, 2000, 14(1):90-104 [4] Ekici E, Akyildiz I F, Bender M D. A distributed routing algorithm for datagram traffic in LEO satellite networks [J]. IEEE/ACM Trans Networking, 2001, 9:137-147 [5] Calvert K L, Zegura E W, Donahoo M J. Core selection methods for multicast routing International Conference on Computer Communications Networks. Las Vegas, Nevada:, 1995:638-642 [6] Raghavendra A D, Rai S, Iyengar S S. Multicast routing in internetworks using dynamic core based trees Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference. Scottsdale, USA:, 1996:232-238 [7] Wall David W. Mechanisms for broadcast and selective broadcast . Palo Alto, California, USA:Dept Elec Eng, Computer Systems Laboratory, Stanford Univ, 1980 [8] Thaler D, Ravishankar C V. Distributed center location algorithms:proposals and comparisons Proc INFOCOM-96.San Francisco, CA:, 1996:75-84 [9] Ali S, Khokhar A. Distributed center location algorithm [J]. IEEE J Selected Areas in Communications, 1997, 15(3):291-303 [10] Wei L, Estrin D. A comparison of multicast trees and algorithms . USC-CS-93-560, 1993
|