Skip to main content

Stability of Adversarial Routing with Feedback

  • Conference paper
Networked Systems (NETYS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 7853))

Included in the following conference series:

Abstract

We consider the impact of scheduling disciplines on the performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packets due to transient failures and explicitly incorporates the feedback produced by the network when packets are stalled. This adversarial model provides a methodology to study stability of routing protocols when flow-control and congestion-control mechanisms affect the volume of traffic. We show that any scheduling policy that is universally stable, in the regular model of routing that additionally allows packets to have two priorities, remains stable in the proposed adversarial model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Àlvarez, C., Blesa, M., Serna, M.: The robustness of stability under link and node failures. Theoretical Computer Science 412(50), 6855–6878 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Àlvarez, C., Blesa, M.J., Díaz, J., Serna, M.J., Fernández, A.: Adversarial models for priority-based networks. Networks 45(1), 23–35 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Deterministic broadcast on multiple access channels. In: Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM), pp. 1–5 (2010)

    Google Scholar 

  4. Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Medium access control for adversarial channels with jamming. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 89–100. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM 48(1), 39–69 (2001)

    Article  MathSciNet  Google Scholar 

  6. Andrews, M., Zhang, L.: Routing and scheduling in multihop wireless networks with time-varying channels. ACM Transactions on Algorithms 3(3), 33 (2007)

    Article  MathSciNet  Google Scholar 

  7. Awerbuch, B., Richa, A.W., Scheideler, C.: A jamming-resistant MAC protocol for single-hop wireless networks. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pp. 45–54 (2008)

    Google Scholar 

  8. Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms (SPAA), pp. 325–332 (2005)

    Google Scholar 

  9. Bhandari, V., Vaidya, N.H.: Reliable broadcast in wireless networks with probabilistic failures. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 715–723 (2007)

    Google Scholar 

  10. Bhandari, V., Vaidya, N.H.: Reliable broadcast in radio networks with locally bounded failures. IEEE Transactions on Parallel and Distributed Systems 21(6), 801–811 (2010)

    Article  Google Scholar 

  11. Blesa, M.J., Calzada, D., Fernández, A., López, L., Martínez, A.L., Santos, A., Serna, M.J., Thraves, C.: Adversarial queueing model for continuous network dynamics. Theory of Computing Systems 44(3), 304–331 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queueing theory. Journal of the ACM 48(1), 13–38 (2001)

    Article  MathSciNet  Google Scholar 

  13. Borodin, A., Ostrovsky, R., Rabani, Y.: Stability preserving transformations: Packet routing networks with edge capacities and speeds. Journal of Interconnection Networks 5(1), 1–12 (2004)

    Article  Google Scholar 

  14. Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Maximum throughput of multiple access channels in adversarial environments. Distributed Computing 22(2), 93–116 (2009)

    Article  MATH  Google Scholar 

  15. Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple access channel. ACM Transactions on Algorithms 5, 5:1–5:31 (2012)

    Article  MathSciNet  Google Scholar 

  16. Cholvi, V.: Stability bounds in networks with dynamic link capacities. Information Processing Letters 109(2), 151–154 (2008)

    Article  MathSciNet  Google Scholar 

  17. Christensen, K., Reviriego, P., Nordman, B., Bennett, M., Mostowfi, M., Maestro, J.A.: IEEE 802.3az: The road to energy efficient Ethernet. IEEE Communications Magazine 48(11), 50–56 (2010)

    Article  Google Scholar 

  18. Gilbert, S., Guerraoui, R., Kowalski, D.R., Newport, C.: Interference-resilient information exchange. In: Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 2249–2257 (2009)

    Google Scholar 

  19. Gilbert, S., Guerraoui, R., Newport, C.C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. Theoretical Computer Science 410(6-7), 546–569 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. IEEE P802.3az Energy Efficient Ethernet. Task force public area (2008), http://grouper.ieee.org/groups/802/3/az/public/index.html

  21. Koukopoulos, D., Mavronicolas, M., Spirakis, P.G.: The increase of the instability of networks due to quasi-static link capacities. Theoretical Computer Sciience 381(1-3), 44–56 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Koukopoulos, D., Mavronicolas, M., Spirakis, P.G.: Performance and stability bounds for dynamic networks. Journal of Parallel and Distributed Computing 67(4), 386–399 (2007)

    Article  MATH  Google Scholar 

  23. Lim, S., Jung, K., Andrews, M.: Stability of the max-weight protocol in adversarial wireless networks. In: Proceedings of the 31st IEEE International Conference on Computer Communications (INFOCOM), pp. 1251–1259 (2012)

    Google Scholar 

  24. Mamatas, L., Harks, T., Tsaoussidis, V.: Approaches to congestion control in packet networks. Journal of Internet Engineering 1(1), 22–33 (2007)

    Google Scholar 

  25. Meier, D., Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Speed dating despite jammers. In: Krishnamachari, B., Suri, S., Heinzelman, W., Mitra, U. (eds.) DCOSS 2009. LNCS, vol. 5516, pp. 1–14. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  26. Srikant, R.: The Mathematics of Internet Congestion Control. Birkhäuser (2004)

    Google Scholar 

  27. Turner, J.S.: New directions in communications (or which way to the information age?). IEEE Communications Magazine 40(5), 50–57 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S., Cholvi, V., Kowalski, D.R. (2013). Stability of Adversarial Routing with Feedback. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40148-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40147-3

  • Online ISBN: 978-3-642-40148-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics