Quasi-Optimal Resource Allocation in Multispot MFTDMA Satellite Networks

This chapter presents an algorithm for resource allocation in satellite networks. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a different amount of bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses linear and integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.

[1]  Yoshiyasu Takefuji,et al.  A parallel algorithm for time-slot assignment problems in TDM hierarchical switching systems , 1994, IEEE Trans. Commun..

[2]  D. C. Cox,et al.  An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders , 1981 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5]  Holger Karl,et al.  The Potential of Relaying in Cellular Networks , 2004 .

[6]  Chak-Kuen Wong,et al.  Incremental time-slot assignment in SS/TDMA satellite systems , 1991, IEEE Trans. Commun..

[7]  Suresh Chalasani,et al.  Efficient time-slot assignment algorithms for SS/TDMA systems with variable-bandwidth beams , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  Yiu Kwok Tham,et al.  Burst assignment for satellite-switched and Earth-station frequency-hopping TDMA networks , 1990 .

[9]  Inder Sarat Gopal,et al.  Scheduling in Multibeam Satellites with Interfering Zones , 1983, IEEE Trans. Commun..

[10]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[11]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[12]  Wen-Tsuen Chen,et al.  Time slot assignment in TDM multicast switching systems , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[13]  C. King,et al.  Intelsat tdma/dsi burst time plan development , 1985 .

[14]  Takeshi Mizuike,et al.  Burst scheduling algorithms for SS/TDMA systems , 1991, IEEE Trans. Commun..

[15]  B. Toft Colouring, stable sets and perfect graphs , 1996 .

[16]  I. Gopal,et al.  Minimizing Packet Waiting Time in a Multibeam Satellite System , 1982, IEEE Trans. Commun..

[17]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[18]  Eitan Altman,et al.  SLOT ALLOCATION IN A TDMA SATELLITE SYSTEM: SIMULATED ANNEALING APPROACH , 2003 .

[19]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[20]  Yiu Kwok Tham On fast algorithms for TDM switching assignments in terrestrial and satellite networks , 1995, IEEE Trans. Commun..

[21]  Alok Sinha A model for TDMA burst assignment and scheduling , 1976 .

[22]  K. Menger Zur allgemeinen Kurventheorie , 1927 .

[23]  Christian Brouder,et al.  Models and algorithms for optimal traffic assignment in SS/TDMA switching systems , 1987 .

[24]  P. Dhar,et al.  Comments on "An Efficient SS/TDMA Time Slot Assignment Algorithm" , 1984, IEEE Trans. Commun..

[25]  J. Lewandowski,et al.  SS/TDMA Time Slot Assignment with Restricted Switching Modes , 1983, IEEE Trans. Commun..

[26]  Maurizio A. Bonuccelli A fast time slot assignment algorithm for TDM hierarchical switching systems , 1989, IEEE Trans. Commun..

[27]  Kwan Lawrence Yeung Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems , 2001, IEEE Trans. Commun..

[28]  Y. Ito,et al.  Analysis of a switch matrix for an SS/TDMA system , 1977, Proceedings of the IEEE.

[29]  Jacek Jankowski,et al.  TDMA burst scheduling within the INTELSAT system , 1982 .

[30]  Takeshi Mizuike,et al.  Computer-Aided Planning of SS/TDMA Network Operation , 1991, IEEE J. Sel. Areas Commun..