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)3 n) arithmetic operations, where m is the number of satellite queues and n is the number of ground stations. © 2010 Springer-Verlag.
CITATION STYLE
Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., & Opatrny, J. (2010). Optimal balancing of satellite queues in packet transmission to ground stations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 303–316). https://doi.org/10.1007/978-3-642-17461-2_25
Mendeley helps you to discover research relevant for your work.