Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Asynchronous Throughput-Optimal Routing in Malicious Networks

  • Conference paper
Automata, Languages and Programming (ICALP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6199))

Included in the following conference series:

Abstract

We demonstrate the feasibility of throughput-efficient routing in a highly unreliable network. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability: unpredictable edge-failures, and deliberate deviation from protocol specifications by corrupt nodes. The first form of unpredictability represents networks with dynamic topology, whose links may be constantly going up and down; while the second form represents malicious insiders attempting to disrupt communication by deliberately disobeying routing rules in an arbitrary manner, for example by introducing junk messages or deleting or altering messages. We present a robust routing protocol for end-to-end communication that is simultaneously resilient to both forms of unreliability, achieving provably optimal throughput performance.

Full version of the paper is available on-line [18].

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosen, A., Shavit, N.: Slide– The Key to Poly. End-to-End Communication. J. of Algo’s 22, 158–186 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Afek, Y., Gafni, E.: End-to-End Communication in Unreliable Networks. In: PODC (1988)

    Google Scholar 

  3. Afek, Y., Gafni, E., Rosén, A.: The Slide Mechanism with Applications in Dynamic Networks. In: Proc. 11th ACM SODA, pp. 35–46 (1992)

    Google Scholar 

  4. Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Adaptive Packet Routing For Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60(3), 482–509 (2000)

    Article  MATH  Google Scholar 

  5. Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic Routing on Networks with Fixed-Size Buffers. In: Proc. 14th ACM SODA, pp. 771–780 (2003)

    Google Scholar 

  6. Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A Theory of Competitive Analysis for Distributed Algorithms. In: Proc. 35th IEEE FOCS, pp. 32–40 (1994)

    Google Scholar 

  7. Amir, Y., Bunn, P., Ostrovsky, R.: Authenticated Adversarial Routing. In: 6th Theory of Crypt. Conf., pp. 163–182 (2009)

    Google Scholar 

  8. Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal Stability Results for Greedy Contention-Resolution Protocols. In: Proc. 37th IEEE FOCS, pp. 380–389 (1996)

    Google Scholar 

  9. Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-Competitive On-Line Routing. In: Proc. 34th IEEE FOCS, pp. 401–411 (1993)

    Google Scholar 

  10. Awerbuch, B., Holmer, D., Nina-Rotaru, C., Rubens, H.: An On-Demand Secure Routing Protocol Resilient to Byzantine Failures. In: Proc. of 2002 Workshop on Wireless Security, pp. 21–30 (2002)

    Google Scholar 

  11. Awerbuch, B., Leighton, T.: Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. In: Proc. 26th ACM STOC, pp. 487–496 (1994)

    Google Scholar 

  12. Awerbuch, B., Mansour, Y., Shavit, N.: End-to-End Communication With Polynomial Overhead. In: Proc. of the 30th IEEE FOCS, pp. 358-363 (1989)

    Google Scholar 

  13. Barak, B., Goldberg, S., Xiao, D.: Protocols and Lower Bounds for Failure Localization in the Internet. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 341–360. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Camb. Univ Press, Cambridge (1998)

    MATH  Google Scholar 

  15. Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial Queuing Theory. In: Proc. 28th ACM STOC, pp. 376–385 (1996)

    Google Scholar 

  16. Broder, A., Frieze, A., Upfal, E.: A General Approach to Dynamic Packet Routing with Bounded Buffers. In: Proc. 37th IEEE FOCS, pp. 390–399 (1996)

    Google Scholar 

  17. Bunn, P., Ostrovsky, R.: Throughput in Asynchronous Networks. arXiv Technical Report, arXiv:0910.4572 (2009)

    Google Scholar 

  18. Bunn, P., Ostrovsky, R.: Asynchronous Throughput Optimal Routing in Malicious Networks. IACR Eprint Archive, Report 2010/231. April 2010 (2010)

    Google Scholar 

  19. Goldberg, S., Xiao, D., Tromer, E., Barak, B., Rexford, J.: Path-Quality Monitoring in the Presence of Adversaries. SIGMETRICS 36, 193–204 (2008)

    Article  Google Scholar 

  20. Kushilevitz, E., Ostrovsky, R., Rosén, A.: Log-Space Polynomial End-to-End Communication. SIAM Journal of Computing 27(6), 1531–1549 (1998)

    Article  MATH  Google Scholar 

  21. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S.: Fast Approximation Algorithms for Multicommodity Flow Problem. In: Proc. 23rd ACM STOC, pp. 101–111 (1991)

    Google Scholar 

  22. Sleator, D., Tarjan, R.: Amortized Efficiency of List Update and Paging Rules. Commun. ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UCLA Department of Mathematics,  

    Paul Bunn & Rafail Ostrovsky

  2. UCLA Department of Computer Science,  

    Rafail Ostrovsky

Authors
  1. Paul Bunn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafail Ostrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Samson Abramsky

  2. Université de Bordeaux (LaBRI) & INRIA, 351, cours de la Libération, 33405, Talence Cedex, France,

    Cyril Gavoille

  3. INRIA, Centre de Recherche Bordeaux – Sud-Ouest, 351 cours de la Libération, 33405, Talence Cedex, France

    Claude Kirchner

  4. Heinz Nixdorf Institute, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Friedhelm Meyer auf der Heide

  5. University of Patras and RACTI, 26500, Patras, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bunn, P., Ostrovsky, R. (2010). Asynchronous Throughput-Optimal Routing in Malicious Networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14162-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14161-4

  • Online ISBN: 978-3-642-14162-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation