Abstract
In this paper we explore the problem of achieving efficient packet transmission over unreliable links with worst case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve stability of the packet queue, nor is it able to use up all the available bandwidth. Hence, an important first step is to identify an appropriate metric for measuring the efficiency of scheduling strategies in such a setting. To this end, we propose a relative throughput metric which corresponds to the long term competitive ratio of the algorithm with respect to the optimal. We then explore the impact of the error detection mechanism and feedback delay on our measure. We compare instantaneous error feedback with deferred error feedback, that requires a faulty packet to be fully received in order to detect the error. We propose algorithms for worst-case adversarial and stochastic packet arrival models, and formally analyze their performance. The relative throughput achieved by these algorithms is shown to be close to optimal by deriving lower bounds on the relative throughput of the algorithms and almost matching upper bounds for any algorithm in the considered settings. Our collection of results demonstrate the potential of using instantaneous feedback to improve the performance of communication systems in adverse environments.
This research was supported in part by the Comunidad de Madrid grant S2009TIC-1692, Spanish MICINN/MINECO grant TEC2011-29688-C02-01, and NSF of China grant 61020106002.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
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
Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A theory of competitive analysis for distributed algorithms. In: 1994 Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 401–411. IEEE (1994)
Andrews, M., Zhang, L.: Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. J. ACM 52(5), 809–834 (2005)
Anta, A.F., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E.: Measuring the impact of adversarial errors on packet scheduling strategies. ArXiv (2013)
Awerbuch, B., Kutten, S., Peleg, D.: Competitive distributed job scheduling. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, pp. 571–580. ACM (1992)
Jamieson, K., Balakrishnan, H.: Ppr: partial packet recovery for wireless networks. In: Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2007, pp. 409–420. ACM, New York (2007)
Kesselheim, T.: Dynamic packet scheduling in wireless networks. In: PODC, pp. 281–290 (2012)
Lin, S., Costello, D.J.: Error control coding, vol. 123. Prentice-Hall, Englewood Cliffs (2004)
Meiners, C., Torng, E.: Mixed criteria packet scheduling. In: Algorithmic Aspects in Information and Management, pp. 120–133 (2007)
Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer (2012)
Pruhs, K., Torng, E., et al.: Online scheduling (2007)
Raghavan, A., Ramchandran, K., Kozintsev, I.: Continuous error detection (ced) for reliable communication. IEEE Transactions on Communications 49(9), 1540–1549 (2001)
Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive throughput in multi-hop wireless networks despite adaptive jamming. In: Distributed Computing, pp. 1–13 (2012)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández Anta, A., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E. (2013). Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)