Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies

  • Antonio Fernández Anta
  • Chryssis Georgiou
  • Dariusz R. Kowalski
  • Joerg Widmer
  • Elli Zavou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8179)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Anta, A.F., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E.: Measuring the impact of adversarial errors on packet scheduling strategies. ArXiv (2013)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Kesselheim, T.: Dynamic packet scheduling in wireless networks. In: PODC, pp. 281–290 (2012)Google Scholar
  7. 7.
    Lin, S., Costello, D.J.: Error control coding, vol. 123. Prentice-Hall, Englewood Cliffs (2004)zbMATHGoogle Scholar
  8. 8.
    Meiners, C., Torng, E.: Mixed criteria packet scheduling. In: Algorithmic Aspects in Information and Management, pp. 120–133 (2007)Google Scholar
  9. 9.
    Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer (2012)Google Scholar
  10. 10.
    Pruhs, K., Torng, E., et al.: Online scheduling (2007)Google Scholar
  11. 11.
    Raghavan, A., Ramchandran, K., Kozintsev, I.: Continuous error detection (ced) for reliable communication. IEEE Transactions on Communications 49(9), 1540–1549 (2001)CrossRefzbMATHGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Antonio Fernández Anta
    • 1
  • Chryssis Georgiou
    • 2
  • Dariusz R. Kowalski
    • 3
  • Joerg Widmer
    • 1
  • Elli Zavou
    • 1
    • 4
  1. 1.Institute IMDEA NetworksSpain
  2. 2.University of CyprusCyprus
  3. 3.University of LiverpoolUK
  4. 4.Universidad Carlos III de MadridSpain

Personalised recommendations