Traffic assignment in communication satellites

Authors:
Egon Balas;Philip R. Landweer
Affiliations:
Carnegie-Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA;Carnegie-Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
1983

Citing 1
Cited 2

Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

On the complexity of decomposing matrices arising in satellite communication

Operations Research Letters
A branch and price algorithm for the SS/TDMA problem with cardinality constraint

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A high capacity communication satellite interconnects scores of ground stations simultaneously. Under the Satellite-Switched/Time Division Multiple Access (SS/TDMA) system, each channel of the satellite is allocated to a pair of ground stations for a certain time period, after which the whole set of allocations (called a switch) is changed simultaneously. The problem we address is to minimize the time length of the entire sequence of switches, subject to a limit on the number of switches. We formulate this as a 3-index bottleneck-sum assignment problem, and solve it by a heuristic that obtains consistently better results than earlier methods based on different formulations.