A General Multibeam Satellite Switching Algorithm

Author

Bongiovanni, G. ; Tang, D.T. ; Wong, C.K.

Author_Institution

Istituto di Scienze dell´´Informazione Universita di Piza

Volume

29

Issue

7

fYear

1981

fDate

7/1/1981 12:00:00 AM

Firstpage

1025

Lastpage

1036

Abstract

In this paper we consider an SS/TDMA system with $M$ uplink beams, $N$ downlink beams, and $K$ connection points. We first assume that the downlink is α times faster than the uplink, and a simple time multiplexing scheme is employed. An optimal time slot assignment algorithm for any $M, N,\\alpha$ , and $K$ , $1 \\leq K \\leq \\min (M, \\alpha N)$ , and for any traffic matrix is presented, where optimality means achieving the minimal possible total transmission time for the given traffic matrix. The number of switching matrices generated by the algorithm never exceeds $MN + K\\alpha + 1$ . Extensive simulation results on randomly generated matrices are carried out, showing that the average number of switching matrices generated is substantially lower than the upper bound. The case when the uplink is faster than the downlink is also considered.

Keywords

Satellite communication, multiaccess; Channel capacity; Communication switching; Downlink; Matrix decomposition; Random number generation; Satellites; Switches; Time division multiple access; Traffic control; Transponders;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOM.1981.1095097

Filename

1095097