On Multicast Routing Using Rectilinear Steiner Trees for LEO Satellite Networks

In this paper, we propose a bandwidth-efficient multicast routing mechanism using rectilinear Steiner trees for Internet Protocol (IP)-based low earth orbit (LEO) satellite networks. Different from existing work that minimizes the end-to-end delay, our mechanism minimizes the total bandwidth, i.e., the number of hops, for a multicast tree since the wireless bandwidth in satellite networks is a limited and scarce resource. We formulate the problem as an optimization problem and propose a distributed algorithm and a protocol to support the dynamic group membership for multicasting over LEO satellite networks. Our simulation results show that the trees created by our mechanism consume less bandwidth than the shortest path trees. The difference between the optimal solutions and the solutions obtained by our distributed algorithm is within 5%. Furthermore, our protocol has a limited overhead and can support a large number of group members.

[1]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[3]  N. Maculan.  The Steiner Problem in Graphs , 1987 .

[4]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[5]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

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

[7]  Catherine Rosenberg,et al.  QoS guarantees for multimedia services on a TDMA-based satellite network , 1997, IEEE Commun. Mag..

[8]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Markus Werner,et al.  ATM-Based Routing in LEO/MEO Satellite Networks with Intersatellite Links , 1997, IEEE J. Sel. Areas Commun..

[10]  Weiping Shi,et al.  Minimum moment Steiner trees , 2004, SODA '04.

[11]  Ion I. Mandoiu,et al.  Practical approximation algorithms for zero- and bounded-skew trees , 2001, SODA '01.

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

[13]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[14]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[15]  Majid Ahmadi,et al.  Probability-based approach to rectilinear Steiner tree problems , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[16]  Chak-Kuen Wong,et al.  New algorithms for the rectilinear Steiner tree problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..