Back to Search
Start Over
A heuristic for decomposing traffic matrices in TDMA satellite communication.
- Source :
- ZOR: Mathematical Methods of Operations Research; Oct1993, Vol. 38 Issue 3, p281-307, 27p
- Publication Year :
- 1993
-
Abstract
- 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 given n×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 as n. When the number of matrices is restricted to n, 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 from n to n 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03409422
- Volume :
- 38
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- ZOR: Mathematical Methods of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 72928929
- Full Text :
- https://doi.org/10.1007/BF01416610