arrow
返回

Optimizing Segment Routing With the Maximum SLD Constraint Using Openflow

delete2018-01-01
delete13
delete
OA
AI
L
Liaoruo Huang
Q
Qingguo Shen *
W
Wenjuan Shao
崔笑宇 (Xiaoyu Cui)
DOI:10.1109/ACCESS.2018.2826925delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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.
Keyword:
Segment routing
label stack
openflow
path encoding
MPLS
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

A
Army Engineering University of PLA
学者数:
5.0K
论文数: 3.7K
被引数: 5
引用论文

引用论文

err分享
err收藏
An efficient palladium catalyzed synthesis of 2-arylbenzothiazoles
err2003-11-01
err0
PREAI
errVattoly J. Majo; Jaya Prabhakaran; J.John Mann; J.S. Dileep Kumar
err分享
err收藏
err分享
err收藏
err分享
err收藏
Tularemia: análisis de 27 casos
err2002-01-01
err0
PREAI
errSantiago González Quijada; Mayte Mayte Rubio Díaz; José Luis Yánez Ortega; Isabel Carramiñana Martínez; E.v.a. Ojeda Fernández; Javier Lozano García
err分享
err收藏
Chemical Analysis of Water of the Anticolana Valley: Isolation of Humic Compounds
err1998-12-24
err0
PREAI
errN. Calace; G. D’Ascenzo; S. De Angelis Curtis; M. Delfini; A. Fraioli; B.M. Petronio
err分享
err收藏
学者 查看更多内容