Document Open Access Logo

On the Resiliency of Randomized Routing Against Multiple Edge Failures

Authors Marco Chiesa, Andrei Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Shapira, Scott Shenker

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2016.134.pdf
  • Filesize: 0.52 MB
  • 15 pages

Document Identifiers

Author Details

Marco Chiesa
Andrei Gurtov
Aleksander Madry
Slobodan Mitrovic
Ilya Nikolaevskiy
Michael Shapira
Scott Shenker

Cite AsGet BibTex

Marco Chiesa, Andrei Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Shapira, and Scott Shenker. On the Resiliency of Randomized Routing Against Multiple Edge Failures. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 134:1-134:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.ICALP.2016.134

Abstract

We study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph G = (V,E), a unique destination vertex d, and an integer constant c > 0, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source s to the destination d is guaranteed so long as (1) no more than c edges fail and (2) there exists a physical path from s to d? We embark upon a study of this problem by relating the edge-connectivity of a graph, i.e., the minimum number of edges whose deletion partitions G, to its resiliency. Following the success of randomized routing algorithms in dealing with a variety of problems (e.g., Valiant load balancing in the network design problem), we embark upon a study of randomized routing algorithms for the Static-Routing-Resiliency problem. For any k-connected graph, we show a surprisingly simple randomized algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(|V|) if only a fraction t of the links fail (where t < 1 is a constant). Furthermore, our algorithm is deterministic if the routing does not encounter any failed link.
Keywords
  • Randomized
  • Routing
  • Resilience
  • Connectivity
  • Arborescenses

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. A. Atlas and A. Zinin. U-turn Alternates for IP/LDP Fast-Reroute. IETF Internet draft version 03, February 2006. Google Scholar
  2. A. Atlas and A. Zinin. Basic Specification for IP Fast Reroute: Loop-Free Alternates. IETF, RFC 5286, 2008. Google Scholar
  3. Roberto Beraldi. Biased random walks in uniform wireless networks. Mobile Computing, IEEE Transactions on, 8(4):500-513, 2009. Google Scholar
  4. Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, and Debmalya Panigrahi. Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs. In Proc. SODA, pages 455-464, 2008. URL: http://dl.acm.org/citation.cfm?id=1347082.1347132.
  5. Michael Borokhovich and Stefan Schmid. How (Not) to Shoot in Your Foot with SDN Local Fast Failover - A Load-Connectivity Tradeoff. In OPODIS, pages 68-82, 2013. Google Scholar
  6. Graham Brightwell and Peter Winkler. Maximum hitting time for random walks on graphs. Random Struct. Algorithms, 1(3):263-276, October 1990. URL: http://dx.doi.org/10.1002/rsa.3240010303.
  7. Costas Busch, Maurice Herlihy, and Roger Wattenhofer. Randomized greedy hot-potato routing. In SODA, pages 458-466, 2000. Google Scholar
  8. Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrović, Aurojit Panda, Andrei Gurtov, Aleksander Ma̧dry, Michael Schapira, and Scott Shenker. The quest for resilient (static) forwarding tables. In International Conference on Computer Communications (INFOCOM), 2016 IEEE. IEEE, 2016. Google Scholar
  9. Marco Chiesa, Ilya Nikolaevskiy, Aurojit Panda, Andrei Gurtov, Michael Schapira, and Scott Shenker. Exploring the limits of static failover routing. CoRR, abs/1409.0034, 2014. URL: http://arxiv.org/abs/1409.0034.
  10. Jack Edmonds. Edge-disjoint branchings. Combinatorial Algorithms, pages 91-96, 1972. Google Scholar
  11. Theodore Elhourani, Abishek Gopalan, and Srinivasan Ramasubramanian. IP Fast Rerouting for Multi-Link Failures. In Proc. IEEE INFOCOM, pages 2148-2156, 2014. Google Scholar
  12. Gábor Enyedi, Gábor Rétvári, and Tibor Cinkler. A Novel Loop-free IP Fast Reroute Algorithm. In Proc. EUNICE, pages 111-119. Springer-Verlag, 2007. Google Scholar
  13. Joan Feigenbaum, P. Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, and Ankit Singla. On the resilience of routing tables. In Brief announcement PODC, July 2012. Google Scholar
  14. Eli M. Gafni and Dimitri P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 1981. Google Scholar
  15. Phillipa Gill, Navendu Jain, and Nachiappan Nagappan. Understanding network failures in data centers: Measurement, analysis, and implications. SIGCOMM Comput. Commun. Rev., 41(4):350-361, August 2011. Google Scholar
  16. Albert Greenberg, James R Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A Maltz, Parveen Patel, and Sudipta Sengupta. Vl2: a scalable and flexible data center network. In ACM SIGCOMM computer communication review, pages 51-62. ACM, 2009. Google Scholar
  17. Mesut Günes, Martin Kähmer, and Imed Bouazizi. Ant-routing-algorithm (ara) for mobile multi-hop ad-hoc networks-new features and results. In The second mediterranean workshop on ad-hoc networks, 2003. Google Scholar
  18. Kin-Wah Kwong, Lixin Gao, Roch Guérin, and Zhi-Li Zhang. On the Feasibility and Efficacy of Protection Routing in IP Networks. IEEE/ACM Trans. Networking, 19(5):1543-1556, October 2011. Google Scholar
  19. K. Lakshminarayanan, M. Caesar, M. Rangan, T. Anderson, S. Shenker, and I. Stoica. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM, 2007. Google Scholar
  20. Junda Liu, Aurojit Panda, Ankit Singla, Brighten Godfrey, Michael Schapira, and Scott Shenker. Ensuring Connectivity via Data Plane Mechanisms. In Proc. of NSDI, pages 113-126, 2013. Google Scholar
  21. Junda Liu, Baohua Yan, Scott Shenker, and Michael Schapira. Data-driven Network Connectivity. In Proc. of HotNets, pages 8:1-8:6, New York, NY, USA, 2011. ACM. URL: http://dx.doi.org/10.1145/2070562.2070570.
  22. Srihari Nelakuditi, Sanghwan Lee, Yinzhe Yu, Zhi-Li Zhang, and Chen-Nee Chuah. Fast Local Rerouting for Handling Transient Link Failures. IEEE/ACM Trans. Networking, 15(2):359-372, April 2007. Google Scholar
  23. Ping Pan, George Swallow, and Alia Atlas. Rfc 4090 fast reroute extensions to rsvp-te for lsp tunnels. Internet Request for Comments, page 42, 2005. Google Scholar
  24. Gero Schollmeier, Joachim Charzinski, Andreas Kirstadter, Christoph Reichert, Karl J. Schrodi, Yuri Glickman, and Chris Winkler. Improving the Resilience in IP Networks. In Proc. HPSR, 2003. Google Scholar
  25. FB Shepherd and PJ Winzer. Selective randomized load balancing and mesh networks with changing demands. Journal of Optical Networking, 5(5):320-339, 2006. Google Scholar
  26. Brent Stephens, Alan L. Cox, and Scott Rixner. Plinko: Building Provably Resilient Forwarding Tables. In Proc. of HotNets, pages 26:1-26:7. ACM, 2013. URL: http://dx.doi.org/10.1145/2535771.2535774.
  27. Leslie G. Valiant. A scheme for fast parallel communication. SIAM journal on computing, 11(2):350-361, 1982. Google Scholar
  28. Junling Wang and Srihari Nelakuditi. IP Fast Reroute with Failure Inferencing. In Proc. of SIGCOMM Workshop on Internet Network Management, INM, pages 268-273, New York, NY, USA, 2007. ACM. URL: http://dx.doi.org/10.1145/1321753.1321764.
  29. Baohua Yang, Junda Liu, Scott Shenker, Jun Li, and Kai Zheng. Keep Forwarding: Towards K-link Failure Resilient Routing. In Proc. IEEE INFOCOM, pages 1617-1625, 2014. Google Scholar
  30. Baobao Zhang, Jianping Wu, and Jun Bi. RPFP: IP fast reroute with providing complete protection and without using tunnels. In IWQoS, pages 137-146, 2013. Google Scholar
  31. Rui Zhang-Shen and Nick McKeown. Designing a fault-tolerant network using valiant load-balancing. In INFOCOM 2008. The 27th Conference on Computer Communications. IEEE. IEEE, 2008. Google Scholar
  32. Zifei Zhong, Srihari Nelakuditi, Yinzhe Yu, Sanghwan Lee, Junling Wang, and Chen nee Chuah. Failure Inferencing based Fast Rerouting for Handling Transient Link and Node Failures. In Proc. IEEE INFOCOM, 2005. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact