Skip to main content
SpringerLink
Log in

Single tag scheme for segment routing in software-defined network

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper proposes a scheme to reduce a size of a packet header for a segment routing (SR) scheme in a software-defined network (SDN). The SR scheme inserts a segment identification (SID) list into the packet header to indicate a path for the source–destination pair of the packet. The path can be split into different segments to suit the service requirement and the segments are carried by the SID-list whose length increases with the number of segments. This also increases the packet overhead, and an additional packet is needed if the packet length exceeds the maximum transmission unit (MTU). Moreover, it may not be possible to implement SR in SDN due to the limited number of stacked labels provided by the switch vendor. In the proposed scheme, the SID-list is replaced by a single tag to indicate a node edge, called a swapping node. The tag is replaced by a new tag at the swapping node. With this scheme, the size of SID-list is fixed and does not vary with the number of segments, and no additional packets are required. A mathematic model to balance the number of flow entries in each swapping node is introduced by minimizing the maximum number of flow entries in each swapping node over the network. We implement the proposed scheme on the transmission-Japan science information network (SINET5) and demonstrate confirms its functionality.

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

Access this article

Log in via an institution

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
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Notes

  1. In the second term of left hand side of Eq. (1b), \(h = h^{\prime }+1\) is not included in the summation, This is because the first and third terms consider the case of \(h = h^{\prime }+1\).

References

  1. Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol Label Switching Architecture. RFC 3031.

  2. Giorgetti, A., Sgambelluri, A., Paolucci, F., Cugini, F., & Castoldi, P. (2017). Segment routing for effective recovery and multi-domain traffic engineering. IEEE/OSA Journal of Optical Communications and Networking, 9(2), A223–A232. https://doi.org/10.1364/JOCN.9.00A223.

    Article  Google Scholar 

  3. Cianfrani, A., Listanti, M., & Polverini, M. (2017). Incremental deployment of segment routing into an ISP network: A traffic engineering perspective. IEEE/ACM Transactions on Networking, 25(5), 3146–3160. https://doi.org/10.1109/TNET.2017.2731419.

    Article  Google Scholar 

  4. Schüller, T., Aschenbruck, N., Chimani, M., Horneffer, M., & Schnitter, S. (2017). Traffic engineering using segment routing and considering requirements of a carrier IP network. In IFIP Networking Conference (IFIP Networking) and Workshops.

  5. Cianfrani, A., Listanti, M., & Polverini, M. (2016). Translating traffic engineering outcome into segment routing paths: The encoding problem. In IEEE conference on computer communications workshops (INFOCOM WKSHPS) (pp. 245–250).

  6. Filsfils, C., Previdi, S., Bashandy, A., Decraene, B., Litkowski, S., & Shakir, R. (2017). Segment routing with MPLS data plane. IETF draft-ietf-spring-segment-routing-mpls-10.

  7. Kitsuwan, N., McGettrick, S., Slyne, F., Payne, D. B., & Ruffini, M. (2015). Independent transient plane design for protection in OpenFlow-based networks. IEEE/OSA Journal of Optical Communications and Networking, 7(4), 264–275. https://doi.org/10.1364/JOCN.7.000264.

    Article  Google Scholar 

  8. Configuring the Maximum Number of MPLS Labels. Retrieved February 28, 2018, from https://www.juniper.net/documentation/en_US/junos/topics/task/configuration/interfaces-mpls-maximum-labels.html.

  9. Maximum-labels. Retrieved February 28, 2018, from https://www.juniper.net/documentation/en_US/junos/topics/reference/configuration-statement/maximum-labels-edit-interfaces-unit-family-mpls.html.

  10. Configuring MPLS. Retrieved February 28, 2018, from http://www.pica8.com/wp-content/uploads/2015/09/v2.9/html/ovs-configuration-guide/#8195477.

  11. Chunduri, U., Clemm, A., & Li, R. (2018). Preferred path routing—A next-generation routing framework beyond segment routing. In IEEE global communications conference (GLOBECOM).

  12. Farrel, A., Vasseur, J.P., & Ash, J. (2006). A path computation element (PCE)-based architecture. RFC 4655.

  13. Lee, Y., Le Roux J. L., King, D., & Oki, E. (2009). Path computation element communication protocol (PCECP) requirements and protocol extensions in support of global concurrent optimization. RFC 5557.

  14. Oki, E., Takeda, T., Farrel, A., & Zhang, F. (2017). Extensions to the path computation element communication protocol (PCEP) for inter-layer MPLS and GMPLS traffic engineering. RFC 8282.

  15. Oki, E., Le Roux, J. L., & Farrel, A. (2009). Framework for PCE-based inter-layer MPLS and GMPLS traffic engineering. RFC 5623.

  16. Filsfils, C., Nainar, N. K., Pignataro, C., Cardona, J. C., & Francois, P. (2015). the segment routing architecture. In IEEE global communications conference (GLOBECOM).

  17. (2014). IEEE Standard for Local and metropolitan area networks - Media Access Control (MAC) Bridges and Virtual Bridged Local Area Networks - Amendment 22: Equal Cost Multiple Path (ECMP). IEEE Std 802.1Qbp-2014 (Amendment to IEEE Std 802.1Q-2011). https://doi.org/10.1109/IEEESTD.2014.6783684

  18. Japan Photonic Network Model. Retrieved September 04, 2019, from http://www.ieice.org/cs/pn/jpn/jpnm.html.

  19. Arakawa, S., Sakano, T., Tsukishima, Y., Hasegawa, H., Tsuritani, T., Hirota, Y., et al. (2013). Topological characteristic of Japan photonic network model. IEICE Technical Report, 113(91), 7–12.

    Google Scholar 

  20. Science Information NETwork 5. Retrieved February 28, 2018, from https://www.sinet.ad.jp/en/top-en.

  21. National Institute of Informatics. Retrieved February 28, 2018, from http://www.nii.ac.jp/en/.

  22. Open vSwitch. Retrieved February 28, 2018, from http://openvswitch.org/.

Download references

Author information

Authors and Affiliations

  1. The Department of Computer and Network Engineering, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, Tokyo, 182-8585, Japan

    Nattapong Kitsuwan

  2. Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto, 606-8501, Japan

    Eiji Oki

  3. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan

    Takashi Kurimoto & Shigeo Urushidani

Authors
  1. Nattapong Kitsuwan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eiji Oki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takashi Kurimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shigeo Urushidani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nattapong Kitsuwan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kitsuwan, N., Oki, E., Kurimoto, T. et al. Single tag scheme for segment routing in software-defined network. Telecommun Syst 74, 173–184 (2020). https://doi.org/10.1007/s11235-019-00645-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-019-00645-w

Keywords

Search

Navigation