Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Research in Networking

NETWORKING 2012: NETWORKING 2012 pp 217–231Cite as

  1. Home
  2. NETWORKING 2012
  3. Conference paper
Permutation Routing for Increased Robustness in IP Networks

Permutation Routing for Increased Robustness in IP Networks

  • Hung Quoc Vo20,
  • Olav Lysne20 &
  • Amund Kvalbein20 
  • Conference paper
  • 1618 Accesses

  • 2 Citations

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

Abstract

We present Permutation Routing as a method for increased robustness in IP networks with traditional hop-by-hop forwarding. Permutation Routing treats routers involved in traffic forwarding as a sequence of resources, and creates permutations of these resources that give several forwarding options. We introduce Permutation Routing as a concept, and use it to create routings where we seek to maximize single link fault coverage. Analogous to the IETF standardized Loop-Free Alternate (LFA), Permutation Routing can easily be implemented for OSPF or IS-IS networks to augment existing ECMP forwarding with additional loop-free forwarding entries for improved load balancing or fault tolerance. Our evaluations show that Permutation Routing can increase single link fault coverage by up to 28% compared to LFA in inferred network topologies.

Keywords

  • IP networks
  • Multipath Routing
  • Resilience
  • Fault-tolerant

Permutation Routing term is used in the literature with slightly different meanings, all related to the act of rearranging network objects (e.g. network devices or network devices and theirs associated radio channels) on which packets are routed from a source to a destination [9] [10].

Download conference paper PDF

References

  1. Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE Trans. on Networking 1(1), 130–141 (1993)

    CrossRef  Google Scholar 

  2. Vutukury, S., Garcia-Luna-Aceves, J.J.: MDVA: A Distance-Vector Multipath Routing Protocol. In: IEEE INFOCOM, pp. 557–564 (2001)

    Google Scholar 

  3. Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L., Chuah, C.-N.: Fast local rerouting for handling transient link failures. IEEE Trans. on Networking 15, 359–372 (2007)

    CrossRef  Google Scholar 

  4. Atlas, A., Zinin, A.: RFC5286: Basic Specification for IP Fast Reroute: Loop-Free Alternates (September 2008)

    Google Scholar 

  5. Shand, M., Bryant, S., Previdi, S.: IP Fast Reroute Using Not-via Addresses. Internet-Draft (work in progress, expired in June 2012)

    Google Scholar 

  6. Kvalbein, A., Hansen, A.F., Čičic, T., Gjessing, S., Lysne, O.: Multiple routing configurations for fast IP network recovery. IEEE Trans. on Networking 17(2) (2009)

    Google Scholar 

  7. Elhourani, T., Ramasubramanian, S., Kvalbein, A.: Enhancing Shortest Path Routing for Resilience and Load Balancing. In: ICC, pp. 1–6 (2011)

    Google Scholar 

  8. Francois, P., Bryant, S., Decraene, B., Horneffer, M.: LFA applicability in SP networks. Internet-Draft (work in progress, expired in July 2012)

    Google Scholar 

  9. Nakano, K., Olariu, S., Zomaya, A.Y.: Energy-efficient permutation routing in radio networks. IEEE Trans. on Parallel and Distributed Systems 12(6) (2001)

    Google Scholar 

  10. Liang, X., Shen, X.: Permutation Routing in All-Optical Product Networks. IEEE Trans. on Circuits and Systems 49(4), 533–538 (2002)

    CrossRef  MathSciNet  Google Scholar 

  11. Xu, D., Chiang, M., Rexford, J.: DEFT: Distributed Exponentially-Weighted Flow Splitting. In: IEEE INFOCOM, pp. 71–79 (2007)

    Google Scholar 

  12. Kvalbein, A., Dovrolis, C., Muthu, C.: Multipath load-adaptive routing: putting the emphasis on robustness and simplicity. In: IEEE ICNP, pp. 203–212 (2009)

    Google Scholar 

  13. Cormen, T. H., et al.: Introduction to Algorithms. MIT Press, ISBN 0-262-03293-7

    Google Scholar 

  14. Kwong, K.-W., Gao, L., Gurin, R., Zhang, Z.-L.: On the feasibility and efficacy of protection routing in IP networks. In: IEEE INFOCOM, pp. 1543–1556 (2010)

    Google Scholar 

  15. Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: IEEE INFOCOM, pp. 519–528 (2000)

    Google Scholar 

  16. Schollmeier, G., Charzinski, J., Kirstadter, A.: Improving the resilience in IP networks. In: HPSR Workshop, pp. 91–96 (2003)

    Google Scholar 

  17. Ohara, Y., Imahori, S., Meter, R.V.: MARA: Maximum Alternative Routing Algorithm. In: IEEE INFOCOM, pp. 298–306 (2009)

    Google Scholar 

  18. Nccui, A., Bhattacharyya, S., Taft, N., Diot, C.: IGP link weight assignment for operational Tier-1 backbones. IEEE Trans. on Networking 15, 789–802 (2007)

    CrossRef  Google Scholar 

  19. Rocketfuel topology mapping. WWW, http://www.cs.washington.edu

Download references

Author information

Authors and Affiliations

  1. Simula Research Laboratory, Norway

    Hung Quoc Vo, Olav Lysne & Amund Kvalbein

Authors
  1. Hung Quoc Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olav Lysne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amund Kvalbein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications Engineering, Czech Technical University in Prague, Technicka 2, 166 27, Prague 6, Czech Republic

    Robert Bestak & Lukas Kencl & 

  2. Alcatel-Lucent, Bell Labs, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ, USA

    Li Erran Li

  3. Instituto IMDEA Networks, Avenida del Mar Mediterraneo 22, Leganes, 28918, Madrid), Spain

    Joerg Widmer

  4. Tsinghua-ChinaCache Joint Laboratory, Tsinghua University, FIT 3-429, Haidian District, 100016, Beijing, China

    Hao Yin

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Vo, H.Q., Lysne, O., Kvalbein, A. (2012). Permutation Routing for Increased Robustness in IP Networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30045-5_17

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30045-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30044-8

  • Online ISBN: 978-3-642-30045-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature