Optimal balancing of satellite queues in packet transmission to ground stations

Authors:
Evangelos Kranakis;Danny Krizanc;Ioannis Lambadaris;Lata Narayanan;Jaroslav Opatrny
Affiliations:
School of Computer Science, Carleton University, Ottawa, ON, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT;Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada;Department of Computer Science, Concordia University, Montréal, QC, Canada;Department of Computer Science, Concordia University, Montréal, QC, Canada
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 6
Cited 0

Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Power allocation and routing in multibeam satellites with time-varying channels

IEEE/ACM Transactions on Networking (TON)
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

Probability in the Engineering and Informational Sciences
Dynamic power allocation and routing for satellite and wireless networks with time varying channels

Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Satellites collecting data store packets in queues and transmit these packets to ground stations within their view. In a given time step, a ground station may see several satellites, but can receive a packet from only one of them. A satellite can send each packet from its queue to a ground station in its view. We consider the problem of finding an assignment of satellites to ground stations that results in all ground stations receiving a packet while optimally balancing the sizes of remaining queues at satellites. We give a polynomial time algorithm for solving this problem which requires O((m+n)3n) arithmetic operations, where m is the number of satellite queues and n is the number of ground stations.