A heuristic for decomposing traffic matrices in TDMA satellite communication

A heuristic for decomposing traffic matrices in TDMA satellite communication. With the time-division multiple access (TDMA) technique in satellite communication the problem arises to decompose a givenn×n traffic matrix into a weighted sum of a small number of permutation matrices such that the sum of the weights becomes minimal. There are polynomial algorithms when the number of permutation matrices in a decomposition is allowed to be as large asn2. When the number of matrices is restricted ton, the problem is NP-hard. In this paper we propose a heuristic based on a scaling technique which for each number of allowed matrices in the range fromn ton2 allows to give a performance guarantee with respect to the total weight of the solution. As a subroutine we use new heuristic methods for decomposing a matrix of small integers into as few matrices as possible without exceeding the lower bound on the total weight. Computational results indicate that the method might also be practical.

[1]  M. Minoux.  Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation , 1986 .

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  D. R. Woodall.  How proportional is proportional representation? , 1986 .

[4]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[5]  Chak-Kuen Wong,et al.  Minimizing the Number of Switchings in an SS/TDMA System , 1985, IEEE Trans. Commun..

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

[7]  T. Inukai,et al.  Comments on "Analysis of a switch matrix for an SS/TDMA system" , 1978 .

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[9]  F. Rendl.  On the complexity of decomposing matrices arising in satellite communication , 1985 .

[10]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[11]  Egon Balas,et al.  Traffic assignment in communication satellites , 1983 .

[12]  Richard Cole,et al.  On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..

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

[14]  B. Heimann,et al.  Computer‐Oriented Method for Multirigid Body Systems Based on the Recursive Newton‐Euler‐Lagrange Formalism , 1989 .

[15]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[16]  Jean-Luc Petit,et al.  A Theory of Proportional Representation , 1990, SIAM J. Discret. Math..

[17]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[18]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[19]  Rainer E. Burkard,et al.  Time Division Multiple Access Systems and Matrix Decomposition , 1991 .

[20]  H. Peyton Young,et al.  Fair Representation: Meeting the Ideal of One Man, One Vote , 1982 .

[21]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

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