The Core-Cluster Combination-Based Shared Tree Algorithm for LEO Satellite IP Networks

Cheng Lian-zhen; Liu Kai; Zhang Jun; Song Xue-gui

doi:10.3724/SP.J.1146.2006.00373

Volume 29 Issue 11

Jan. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2007 > 29(11): 2632-2636

Cheng Lian-zhen, Liu Kai, Zhang Jun, Song Xue-gui. The Core-Cluster Combination-Based Shared Tree Algorithm for LEO Satellite IP Networks[J]. Journal of Electronics & Information Technology, 2007, 29(11): 2632-2636. doi: 10.3724/SP.J.1146.2006.00373

Citation:

Cheng Lian-zhen, Liu Kai, Zhang Jun, Song Xue-gui. The Core-Cluster Combination-Based Shared Tree Algorithm for LEO Satellite IP Networks[J]. Journal of Electronics & Information Technology, 2007, 29(11): 2632-2636. doi: 10.3724/SP.J.1146.2006.00373

Citation:

PDF( 309 KB)

The Core-Cluster Combination-Based Shared Tree Algorithm for LEO Satellite IP Networks

doi: 10.3724/SP.J.1146.2006.00373

Received Date: 2006-03-27
Rev Recd Date: 2006-09-13
Publish Date: 2007-11-19

Abstract

Abstract

To resolve the channel resources waste problem of the typical source-specific multicast routing algorithm in Low Earth Orbit (LEO) satellite IP networks, a new core-based shared tree algorithm named Core-cluster Combination-based Shared Tree (CCST) algorithm is proposed in this paper. It includes a core selection method named Dynamic Approximate Center (DAC) and a multicast route construction scheme named core-cluster combination. The DAC method selects core node based on virtually static and regular network topology formed by logical locations. The core-cluster combination scheme takes core node as initial core-cluster, and extends it to construct entire multicast tree with the lowest tree cost step by step by a shortest path scheme between newly-generated core-cluster and surplus group members, which can greatly improve transport bandwidth utilization and multicast transport efficiency. Finally, the CCST algorithm is compared with several other typical algorithms in LEO satellite IP networks, and simulation results show that its tree cost performance is greatly better than the others at the expense of a bit higher end-to-end propagation delay.

FullText(HTML)

References(1)

References

Ekici E., Akyildiz I F, and Bender M D. A multicast routing algorithm for LEO satellite IP networks. IEEE/ACM Trans. on Networking, 2002, 10(2): 183-192.[2]Yang De Nian and Liao Wanjiun. On multicast routing using rectilinear Steiner trees for LEO satellite networks. In Proc. IEEE Globecom, Hyatt Regency Dalls, TX, 2004: 2712-2716.[3]Hu Yurong and Li Victor O K. Satellite-based internet: A tutorial. IEEE Communications Magazine, 2001, 39(3): 154-162.[4]Sahasrabuddhe L H and Mukherjee B. Multicast routing algorithms and protocols: A tutorial[J].IEEE Network.2000, 14(1):90-104[5]Ekici E, Akyildiz I F, and Bender M D. A distributed routing algorithm for datagram traffic in LEO satellite networks[J].IEEE/ACM Trans. on Networking.2001, 9(2):137-147[6]Thaler D and Ravishankar C V. Distributed center location algorithms: proposals and comparisons. In Proc. INFOCOM'96, San Francisco, CA, 1996: 75-84.[7]Calvert K L, Zegura E W, and Donahoo M J. Core selection methods for multicast routing. In International Conference on Computer Communications Networks, Las Vegas, Nevada, 1995: 638-642.[8]Raghavendra A D, Rai S, and Iyengar S S. Multicast routing in internetworks using dynamic core based trees. In Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference, 1996: 232-238.[9]Ali S and Khokhar A. Distributed center location algorithm[J].IEEE Journal on Selected Areas in Communications.1997, 15(3):291-303[10]Donahoo M J and Zegura E W. Core migration for dynamic multicast routing. In International Conference on Computer Communication Networks, Columbus, OH, 1996: 92-98.[11]Wall D W. Mechanisms for broadcast and selective broadcast[Ph.D. Thesis]. Stanford University, June 1980.

Relative Articles

Supplements(0)

Cited By

Proportional views