Flow-aware Segment Routing in SDN-enabled Data Center Networks

Full Text (PDF, 499KB), PP.50-62

Views: 0 Downloads: 0


Bommareddy Lokesh 1 Narendran Rajagopalan 1,*

1. National Institute of Technology Puducherry, Department of Computer Science and Engineering, Karaikal, 609609, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijcnis.2023.05.05

Received: 25 Feb. 2022 / Revised: 25 May 2022 / Accepted: 17 Oct. 2022 / Published: 8 Oct. 2023

Index Terms

Segment Routing, Segment Identifier, Segment List Depth, Forwarding Table


The underlying objective of segment routing is to avoid maintenance of the per-flow state at forwarding devices. Segment routing (SR) enables the network devices to minimize their forwarding table size by generalizing the forwarding rules and making them applicable to multiple flows. In existing works, optimizing the trade-off between segment length and the number of co-flows sharing the segment is considered the key to determining optimal segment endpoints. However, the flow characteristics like the lifetime of flows, and dynamically altering routing paths are critical and impact the performance of SR. Ideally, network flows considered for SR are expected to persist for a longer duration and adhere to static routing paths. But our analysis of flow characteristics at a typical data center reveals that the majority of flows are short-lived. Also, network flows are subject to alter their routing paths frequently for several reasons. Considering short-lived flows and flows that dynamically alter their routing paths may lead to choosing unstable segment endpoints. Hence, it is necessary to study the flow characteristics for determining more stable segment endpoints. In this paper, the authors implemented the SR technique considering the flow characteristics at an SDN-enabled data center and the results show a significant improvement with respect to the stability of segment endpoints.

Cite This Paper

Bommareddy Lokesh, Narendran Rajagopalan, "Flow-aware Segment Routing in SDN-enabled Data Center Networks", International Journal of Computer Network and Information Security(IJCNIS), Vol.15, No.5, pp.50-62, 2023. DOI:10.5815/ijcnis.2023.05.05


[1]Yaoqing Liu, Beichuan Zhang, and Lan Wang. Fifa:Fast incremental fib aggregation. In 2013 Proceedings IEEE INFOCOM, pages 1–9, 2013.
[2]Gagandeep Garg, Roopali Garg, "Accurate Anomaly Detection using Adaptive Monitoring and Fast Switching in SDN", International Journal of Information Technology and Computer Science, vol.7, no.11, pp.34-42, 2015.
[3]Kshira Sagar Sahoo, Sambit Kumar Mishra, Sampa Sahoo, Bibhudatta Sahoo,"Software Defined Network: The Next Generation Internet Technology", International Journal of Wireless and Microwave Technologies, Vol.7, No.2, pp.13-24, 2017.
[4]Luca Davoli, Luca Veltri, Pier Luigi Ventre, Giuseppe Siracusano, and Stefano Salsano. Traffic engineering with segment routing: Sdn-based architectural design and open source implementation. In 2015 Fourth European Workshop on Software Defined Networks, pages111–112, 2015.
[5]Liaoruo Huang, Qingguo Shen, Wenjuan Shao, and Cui Xiaoyu. Optimizing segment routing with the maximum sld constraint using openflow. IEEE Access,6:30874–30891, 2018.
[6]Francesco Lazzeri, Gianmarco Bruno, Jeroen Nijhof, Alessio Giorgetti, and Piero Castoldi. Efficient label encoding in segment-routing enabled optical networks. In 2015 International Conference on Optical Network Design and Modeling (ONDM), pages 34–38, 2015.
[7]Olivier Dugeon, Rabah Guedrez, Samer Lahoud, and Géraldine Texier. Demonstration of segment routing with sdn based label stack optimization. In 2017 20th Conference on Innovations in Clouds, Internet and Networks (ICIN), pages 143–145, 2017.
[8]Alessio Giorgetti, Piero Castoldi, Filippo Cugini, Jeroen Nijhof, Francesco Lazzeri, and Gianmarco Bruno. Path encoding in segment routing. In 2015 IEEE Global Communications Conference (GLOBECOM), pages 1–6, 2015.
[9]Rabah Guedrez, Olivier Dugeon, Samer Lahoud, and Géraldine Texier. Label encoding algorithm for mpls segment routing. In 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), pages 113–117, 2016.
[10]Antonio Cianfrani, Marco Listanti, and Marco Polverini. Translating traffic engineering outcome into segment routing paths: The encoding problem. In 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pages 245–250, 2016.
[11]Randeep Bhatia, Fang Hao, Murali Kodialam, and T.V.Lakshman. Optimized network traffic engineering using segment routing. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 657–665, 2015.
[12]Eduardo Moreno, Alejandra Beghelli, and Filippo Cugini. Traffic engineering in segment routing networks. Computer Networks, 114:23–31, 2017.
[13]Anix Anbiah and Krishna M. Sivalingam. Sr domain partitioning in segment routed sdns. In 2019 IEEE 44th Conference on Local Computer Networks (LCN), pages 153–156, 2019.
[14]Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), April 2009.
[15]Anix Anbiah and Krishna M. Sivalingam. Optimal segments for forwarding table size minimization in segment-routed sdns. International Journal of Network Management, n/a(n/a):e2142. e2142 nem.2142.
[16]Pier Luigi Ventre, Stefano Salsano, Marco Polverini, Antonio Cianfrani, Ahmed Abdelsalam, Clarence Filsfils, Pablo Camarillo, and Francois Clad. Segment routing: A comprehensive survey of research activities, standardization efforts, and implementation results. IEEE Communications Surveys Tutorials, 23(1):182–221, 2021.
[17]Zahraa N. Abdullah, Imtiaz Ahmad, and Iftekhar Hussain. Segment routing in software defined networks: A survey. IEEE Communications Surveys Tutorials, 21(1):464–486, 2019.
[18]Google. ClusterData, 2019 (accessed in February, 2020). https://github.com/google/cluster-data/blob/master/ClusterData2019.md.
[19]Arjun Singh, Joon Ong, Amit Agarwal, Glen Anderson, Ashby Armistead, Roy Bannon, Seb Boving, Gaurav Desai, Bob Felderman, Paulie Germano, Anand Kanagala, Jeff Provost, Jason Simmons, Eiichi Tanda, Jim Wanderer, Urs Hölzle, Stephen Stuart, and Amin Vahdat. Jupiter rising: A decade of clos topologies and centralized control in google’s datacenter network. In Proceedings of the 2015 ACM Conference on SpecialInterest Group on Data Communication, SIGCOMM’15, page 183–197, New York, NY, USA, 2015. Association for Computing Machinery.
[20]Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry C. Li, Ryan McElroy, Mike Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung, and Venkateshwaran Venkataramani. Scaling memcache at facebook. In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, nsdi’13, page 385–398, USA, 2013. USENIX Association.
[21]Jared Winick and Sugih Jamin. Inet-3.0: Internet topology generator, 08 2002.