Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

Abstract A new core-based shared tree algorithm, viz core-cluster combination-based shared tree (CCST) algorithm and the weighted version (i.e. w -CCST algorithm) are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit (LEO) satellite IP networks. The CCST algorithm includes the dynamic approximate center (DAC) core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w -CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay of w -CCST algorithm is lower than that of the CCST algorithm.

[1]  Ellen W. Zegura,et al.  Core selection methods for multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[2]  Eylem Ekici,et al.  A multicast routing algorithm for LEO satellite IP networks , 2002, TNET.

[3]  Gun Akkor.  Multicast communication support over satellite networks , 2005 .

[4]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

[5]  Sung-Ju Lee,et al.  On-demand multicast routing protocol , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[6]  D. W. Wall.  Mechanisms for broadcast and selective broadcast , 1980 .

[7]  Eylem Ekici,et al.  A distributed routing algorithm for datagram traffic in LEO satelitte networks , 2001, TNET.

[8]  F.J.R. Pinar,et al.  IP Multicast over New Generation Satellite Networks. A Case Study: AmerHis. , 2006, 2006 International Workshop on Satellite and Space Communications.

[9]  Y. C. Tay,et al.  AMRIS: a multicast protocol for ad hoc wireless networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[10]  David Thaler,et al.  Distributed center-location algorithms: proposals and comparisons , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Wanjiun Liao,et al.  On Multicast Routing Using Rectilinear Steiner Trees for LEO Satellite Networks , 2004, IEEE Transactions on Vehicular Technology.

[12]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[13]  S. Sitharama Iyengar,et al.  Multicast routing in internetworks using dynamic core based trees , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[14]  Biswanath Mukherjee,et al.  Multicast routing algorithms and protocols: a tutorial , 2000, IEEE Netw..

[15]  J. J. Garcia-Luna-Aceves,et al.  The core-assisted mesh protocol , 1999, IEEE J. Sel. Areas Commun..

[16]  P. Febvre.  Multicast-enabling a 3GPP-based Mobile Satellite Network , 2006 .

[17]  Deborah Estrin,et al.  A comparison of multicast trees and algorithms , 1993, INFOCOM 1993.