Skip to main content

A Fast Bit-Level MPLS-Based Source Routing Scheme in Software Defined Networks: SD-{W,L}AN

  • Conference paper
  • First Online:
Mobile, Secure, and Programmable Networking (MSPN 2017)

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

  • 788 Accesses

Abstract

Today, more concerns are raised to Software Defined Networks (SDN) paradigm since it is a promising concept that offers programmability and scalability by decoupling control and data planes. However, many problems have arisen due to the huge amount of control messages exchanged periodically between the controller and Forwarding Elements (FE) and the limited space of Ternary Content-Addressable Memory TCAM into the switches. The standard Hop-by-Hop forwarding scheme requires that the controller installs at least one flow entry for each flow on each switch. This may lead to a significant bandwidth overhead and unbalanced flow tables. Unfortunately, this scheme seems to be no longer suitable for application neither in SD-LAN nor in SD-WAN.

Many solutions were proposed to avoid network performance degradation. The MPLS-based source routing is one of the most emergent schemes that have attracted attention due to its ability to overwhelm deficiency of the standard Hop-by-hop forwarding scheme. However, the MPLS-based forwarding scheme may induce a significant bandwidth overhead due to the fact that a per-hop routing information is carried using one MPLS label which may lead to a wasteful encoding space.

This paper aims to avoid wasting available encoding space by reserving exactly the required number of bits to encode each routing information. The proposed scheme is based on affecting a wildcard bit-pattern to each switch. A wildcard bit-pattern is a set of bits that is used to decode the routing path by means of the bitwise XOR operation. The routing path is initially appended to one MPLS label after being encoded. The MPLS label is embedded as a header to each packet. Our scheme is suitable for application in multicast scenarios using the same routing path as the unicast scenarios with no additional bandwidth overhead.

Simulation results show that the proposed scheme outperforms parallel solutions in terms of bandwidth overhead, Control traffic overhead and flow tables balancing.

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 EPUB and 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

References

  1. Open Networking Foundation: The OpenFlow Switch Specification, Version 1.4.0, October 2013. https://www.opennetworking.org/images/stories/downloads/sdn-resources/onf-specifications/openflow/openflow-spec-v1.4.0.pdf

  2. Zehua, G., et al.: JumpFlow: Reducing flow table usage in software defined networks. Comput. Netw. 92, 300–315 (2015)

    Article  Google Scholar 

  3. Dong, X., Guo, Z., et al.: AJSR: an efficient multiple jumps forwarding scheme in software-defined WAN. IEEE Access 5, 3139–3148 (2017)

    Article  Google Scholar 

  4. Jain, S., et al.: B4: experience with a globally-deployed software defined WAN. ACM SIGCOMM Comput. Commun. Rev. 43(4), 3–14 (2013)

    Article  Google Scholar 

  5. Cohen, R., Lewin-Eytan, L., Naor, J.S., et al.: On the effect of forwarding table size on SDN network utilization. In: INFOCOM IEEE, pp. 1734–1742 ( 2014)

    Google Scholar 

  6. Kanizo, Y., Hay, D., Palette, K.I.: Distributing tables in software- defined networks. In: Proceedings of IEEE INFOCOM, pp. 545–549 (2013)

    Google Scholar 

  7. Kang, N., Liu, Z., Rexford, J., et al.: Optimizing the one big switch abstraction in software-defined networks. In: ACM Conference on Emerging Networking Experiments and Technologies, pp. 3–24 (2013)

    Google Scholar 

  8. Bidkar, S., Gumaste, A., Somani, A.: A scalable framework for segment routing in service provider networks: the omnipresent ethernet approach. In: High Performance Switching and Routing (HPSR), pp. 76–83 (2014)

    Google Scholar 

  9. Bidkar, S., et al.: Field trial of a software defined network (SDN) using carrier ethernet and segment routing in a tier-1 provider. In: Global Communications Conference (GLOBECOM) (2014)

    Google Scholar 

  10. Kreutz, D., Ramos, F.M.V., Esteves Verissimo, P., et al.: Software-dened networking: a comprehensive survey. Proc. IEEE 03, 10–13 (2014)

    Google Scholar 

  11. McKeown, N., et al.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM CCR 38(2), 69–74 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ali El Kamel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

El Kamel, A., Majdoub, M., Youssef, H. (2017). A Fast Bit-Level MPLS-Based Source Routing Scheme in Software Defined Networks: SD-{W,L}AN. In: Bouzefrane, S., Banerjee, S., Sailhan, F., Boumerdassi, S., Renault, E. (eds) Mobile, Secure, and Programmable Networking. MSPN 2017. Lecture Notes in Computer Science(), vol 10566. Springer, Cham. https://doi.org/10.1007/978-3-319-67807-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67807-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67806-1

  • Online ISBN: 978-3-319-67807-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics