Optimizing Segment Routing With the Maximum SLD Constraint Using Openflow

Abstract

Segment routing is an emerging routing technology that was initially driven by commercial vendors to achieve scalable, flexible, and controllable routing. In segment routing, multiple multi-protocol label switch labels are stacked in the packet header to complete end-to-end transmission, which may lead to a large label stack and a long packet header. Thus, scalability issues may occur when segment routing is applied to large-scale networks. To address this issue, multiple mechanisms and algorithms have been proposed for minimizing the label stack size. However, we argue that these methods ignore the constraint on the maximum segment list depth (SLD), since the typical network equipment can currently only support three to five layers of labels. In this paper, we study segment routing with the maximum SLD constraint and demonstrate that issues, such as explosive increases in the size of the label space and the management overheads will arise when the maximum SLD constraint is imposed. To address these issues, we make contributions from two main aspects. First, based on the network programmability that is provided by openflow, a novel segment routing architecture with improved data plane is proposed that reduces the overhead of additional flow entries and label space. Second, a new path encoding scheme is designed to minimize the SLD under the given maximum constraint, while taking multiple types of overhead into consideration. Moreover, we also perform simulations under different scenarios to evaluate the performances of the proposed algorithms. The simulation results demonstrate that the proposed mechanisms and algorithms can address the issues of segment routing when there is a constraint on the maximum SLD.