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)3 n) arithmetic operations, where m is the number of satellite queues and n is the number of ground stations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bambos, N., Michailidis, G.: On the stationary dynamics of parallel queues with random serverconnectivities. In: Proceedings of the 34th IEEE Conference on Decision and Control 1995, vol. 4 (1995)
Bambos, N., Michailidis, G.: On parallel queuing with random server connectivity and routing constraints. Probability in the Engineering and Informational Sciences 16(02), 185–203 (2002)
Bambos, N., Michailidis, G.: Queueing and scheduling in random environments. Advances in Applied Probability 36(1), 293–317 (2004)
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Macmillan, London (1976)
Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the ACM (JACM) 19(2), 248–264 (1972)
Eryilmaz, A., Srikant, R.: Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. In: Proceedings IEEE INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3 (2005)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8(3), 399–404 (1956)
Ganti, A., Modiano, E., Tsitsiklis, J.N.: Transmission Scheduling for Multi-Channel Satellite and Wireless Networks. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 40, pp. 1319–1328 (2002)
Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE/ACM Transactions on Networking (TON) 7(4), 473–489 (1999)
Modiano, E.: Satellite data networks. AIAA Journal on Aerospace Computing, Information and Communication 1, 395–398 (2004)
Neely, M.J.: Dynamic Power Allocation and Routing for Satellite and Wireless Networks with Time Varying Channels. PhD thesis, Massachusetts Institute of Technology (2003)
Neely, M.J., Modiano, E., Rohrs, C.E.: Power allocation and routing in multibeam satellites with time-varying channels. IEEE/ACM Transactions on Networking (TON) 11(1), 152 (2003)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Dover Publications, New York (1998)
Tassiulas, L., Ephremides, A.: Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory 39(2), 466–478 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J. (2010). Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)