Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Loop-Free Alternates with Loop Detection for Fast Reroute in Software-Defined Carrier and Data Center Networks

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Loop-Free Alternates (LFAs) are a local fast-reroute mechanism defined for IP networks. They are simple but suffer from two drawbacks. Firstly, some flows cannot be protected due to missing LFAs, i.e., this concept does not provide full protection coverage, which depends on network topology. Secondly, some LFAs cause loops in case of node or multiple failures. Avoiding those LFAs decreases the protection coverage even further. In this work, we propose to apply LFAs to OpenFlow-based networks. We suggest a method for loop detection so that loops can be avoided without decreasing protection coverage. We propose an implementation with OpenFlow that requires only a single additional flow rule per switch. We further investigate the percentage of flows that can be protected, not protected, or even create loops in different types of failure scenarios. We consider realistic ring and mesh networks as well as typical topologies for data center networks. None of them can be fully protected with LFAs. Therefore, we suggest an augmented fat-tree topology which allows LFAs to protect against all single link and node failures and against most double failures.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008)

    Article  Google Scholar 

  2. Braun, W., Menth, M.: Wildcard compression of inter-domain routing tables for OpenFlow-based software-defined networking. In: European Workshop on Software Defined Networks (EWSDN), pp. 25–30 (2014)

  3. Sharma, S., Staessens, D., Colle, D., Pickavet, M., Demeester, P.: OpenFlow: meeting carrier-grade recovery requirements. Comput. Commun. 36(6), 656–665 (2013)

    Article  Google Scholar 

  4. Kempf, J., Bellagamba, E., Kern, A., Jocha, D., Takàcs, A., Sköldström, P.: Scalable fault management for OpenFlow. In: IEEE International Conference on Communications (ICC), pp. 6606–6610 (2012)

  5. van Adrichem, N.L., van Asten, B.J., Kuipers, F.A.: Fast recovery in software-defined networks. In: European Workshop on Software Defined Networks (EWSDN), pp. 61–66 (2014)

  6. Ramos, R.M., Martinello, M., Rothenberg, C.E.: SlickFlow: resilient source routing in data center networks unlocked by OpenFlow. In: IEEE Conference on Local Computer Networks (LCN) (2013)

  7. Atlas, A., Zinin, A.: RFC5286: Basic Specification for IP Fast Reroute: Loop-Free Alternates. https://tools.ietf.org/html/rfc5286 (2008)

  8. Bryant, S., Filsfils, C., Previdi, S., Shand, M., So, N.: Remote LFA FRR. http://tools.ietf.org/html/draft-rtgwg-remote-lfa (2013)

  9. Csikor, L., Retvari, G.: IP Fast Reroute with remote loop-free alternates: the unit link cost case. In: IEEE International Workshop on Reliable Networks Design and Modeling (RNDM) (2012)

  10. Menth, M., Braun, W.: Performance comparison of not-via addresses and maximally redundant trees (MRTs). In: IFIP/IEEE International Symposium on Integrated Network Management (IM), Ghent, Belgium (2013)

  11. Martin, R., Menth, M., Hartmann, M., Cicic, T., Kvalbein, A.: Loop-free alternates and not-via addresses: a proper combination for IP fast reroute? Comput. Netw. 54(8), 1300–1315 (2010)

    Article  MATH  Google Scholar 

  12. Hartmann, M., Hock, D., Menth, M.: Routing optimization for IP networks with loop-free alternates. Comput. Netw. 95, 35–50 (2016)

    Article  Google Scholar 

  13. Pan, P., Swallow, G., Atlas, A.: RFC4090: Fast Reroute Extensions to RSVP-TE for LSP Tunnels. https://tools.ietf.org/html/rfc4090 (2005)

  14. Pioro, M., Tomaszewski, A., Zukowski, C., Hock, D., Hartmann, M., Menth, M. Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute. In: International Telecommunication Network Strategy and Planning Symposium (Networks), Warsaw, Poland (2010)

  15. Meiners, C.R., Liu, A.X., Torng, E.: Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs. IEEE/ACM Trans. Netw. 20(2), 488–500 (2012)

    Article  Google Scholar 

  16. Couto, R., Campista, M., Costa, L. A reliability analysis of datacenter topologies. In: IEEE Globecom, pp. 1890–1895 (2012)

  17. OpenFlow Switch Consortium and others. OpenFlow Switch Specification Version 1.1.0. (2011). [Online]. Available: http://archive.openflow.org/documents/openflow-spec-v1.1.0.pdf

  18. Menth, M., Duelli, M., Martin, R., Milbrandt, J.: Resilience analysis of packet-switched communication networks. IEEE/ACM Trans. Netw. 17(6), 1950–1963 (2009)

    Article  Google Scholar 

  19. Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765–1775 (2011)

    Article  Google Scholar 

  20. Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)

    Article  Google Scholar 

  21. Banikazemi, M., Olshefski, D., Shaikh, A., Tracey, J., Wang, G.: Meridian: an SDN platform for cloud network services. IEEE Commun. Mag. 51(2), 120–127 (2013)

    Article  Google Scholar 

  22. Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S. BCube: a high performance, server-centric network architecture for modular data centers. In: ACM SIGCOMM, Barcelona, Spain (2009)

  23. Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: Dcell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM Comput. Commun. Rev. 38(4), 75–86 (2008)

    Article  Google Scholar 

Download references

Acknowledgments

This work has been supported by the German Federal Ministry of Education and Research (BMBF) under support code 16BP12307 (EUREKA-Project SASER). The authors alone are responsible for the content of the paper.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Tübingen, Sand 13, 72076, Tübingen, Germany

    Wolfgang Braun & Michael Menth

Authors
  1. Wolfgang Braun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Menth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wolfgang Braun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Braun, W., Menth, M. Loop-Free Alternates with Loop Detection for Fast Reroute in Software-Defined Carrier and Data Center Networks. J Netw Syst Manage 24, 470–490 (2016). https://doi.org/10.1007/s10922-016-9369-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-016-9369-9

Keywords

Search

Navigation