Scientists develop intelligent segment routing systems for network management

Tsinghua University Press

Traffic engineering has attracted much research attention, especially in recent years as networks grow in size and complexity. Network operators increasingly need better ways to manage the massive amounts of data flowing through their networks. A team of researchers has proposed an intelligent routing scheme for traffic engineering that achieves load balancing with limited control overheads.

Their research is published in the journal Big Data Mining and Analytics on Nov. 24, 2022.

Traditionally, researchers have studied traffic engineering related to traditional internet protocol (IP) networks with a focus on IP routing protocols, routing optimization problems, and overlaying in an IP network. With the arrival of the software-defined network, researchers began to focus more on traffic engineering issues, including traffic splitting and protocol design.

In software-defined networks, the network can be centrally controlled using software applications. Software-defined networks allowed researchers to achieve more efficient network management, solving some of the massive traffic engineering issues that are difficult to manage in traditional networks.

Yet even with software-defined networks, researchers struggled with scalability issues. So researchers turned their attention to segment routing. Segment routing is a technique that allows researchers to simplify traffic engineering across network domains by organizing collections of information called packets. Researchers realized that by combining segment routing with software-defined networks, they could be capable of solving some of the challenges in the software-defined network. However, there were still some unresolved issues because segment routing brings with it control overheads, meaning additional packet headers have to be inserted. The overheads greatly reduce a large network’s efficiency when the segment headers become too long.

“Segment routing has been a novel architecture for traffic engineering, but it also brings control overheads and reduces forwarding efficiency. So we focused on how to optimize the link load balancing performance with limited control overhead based on segment routing,” said Laizhong Cui, a professor with the College of Computer Science and Software Engineering at Shenzhen University.

To overcome these challenges, the research team proposed an intelligent routing scheme for traffic engineering. This allows for load balancing with limited control overheads. The team started by formulating the problem as a mapping problem that maps different flows to key diversion points. Next they proved the problem is nondeterministic polynomial hard, a way of defining the problem in computational complexity theory.

Then to solve the problem, they developed an improved ant colony optimization algorithm. Ant colony optimization is a technique that uses probability in solving network optimization problems. They also designed a second algorithm, a load balancing algorithm, and they analyzed its theoretical performance.

“We proposed two algorithms to realize our load balancing target and avoid forwarding overload. The theory of ant colony optimization and linear programming provided ideas and directions for the algorithms,” said Laizhong Cui.

The team evaluated their intelligent routing scheme for traffic engineering in different real-world topologies. Topology describes how the elements of networks are arranged and connected. The team’s results show that their algorithms outperform traditional algorithms. With their intelligent routing scheme for traffic engineering, the maximum bandwidth is 24.6 percent lower than that of traditional algorithms, when evaluated on the Bell Canada network topology.

Looking ahead to future research, the team is preparing to test and optimize their algorithms in a real network environment. They also plan to further develop their scheme by adding the method of artificial intelligence in software-defined wide area networks. “Our ultimate goal is to develop and apply our solutions to most network architectures to improve network transmission performance,” said Cui.

The research team includes Shu Yang, Ruiyu Chen, Laizhong Cui, from Shenzhen University and Xiaolei Chang from Tsinghua University.

The research is funded by the National Natural Science Foundation of China, the Major Fundamental Research Project in the Science and Technology Plan of Shenzhen, the Natural Science Foundation of Guangdong Basic and Applied Basic Research, and the Pearl River Young Scholars Funding of Shenzhen University.

##

About Big Data Mining and Analytics

Big Data Mining and Analytics (Published by Tsinghua University Press) discovers hidden patterns, correlations, insights and knowledge through mining and analyzing large amounts of data obtained from various applications. It addresses the most innovative developments, research issues and solutions in big data research and their applications. Big Data Mining and Analytics is indexed and abstracted in ESCI, EI, Scopus, DBLP Computer Science, Google Scholar, INSPEC, CSCD, DOAJ, CNKI, etc.

About Tsinghua University Press

Established in 1980, belonging to Tsinghua University, Tsinghua University Press (TUP) is a leading comprehensive higher education and professional publisher in China. Committed to building a top-level global cultural brand, after 41 years of development, TUP has established an outstanding managerial system and enterprise structure, and delivered multimedia and multi-dimensional publications covering books, audio, video, electronic products, journals and digital publications. In addition, TUP actively carries out its strategic transformation from educational publishing to content development and service for teaching & learning and was named First-class National Publisher for achieving remarkable results.

/Public Release. This material from the originating organization/author(s) may be of a point-in-time nature, edited for clarity, style and length. The views and opinions expressed are those of the author(s).View in full here.