TY - JOUR
T1 - Scalable explicit path control in software-defined networks
AU - Luo, Long
AU - Yu, Hongfang
AU - Luo, Shouxi
AU - Ye, Zilong
AU - Du, Xiaojiang
AU - Guizani, Mohsen
N1 - Publisher Copyright:
© 2019 Elsevier Ltd
PY - 2019/9/1
Y1 - 2019/9/1
N2 - In this paper, we present a scalable PAth COntrol (PACO) approach to meet the increasing demands of fine-grained and explicit paths in Software-Defined Networks. PACO builds upon Segment Routing and adopts the pathlet segment as the building blocks for constructing network paths. By proactively generating and pre-installing a small collection of segments in networks, PACO can explicitly and quickly set up a massive number of reactive paths by simply concatenating these segments. We theoretically investigate the proactive segment generation as well as the optimal concatenation for reactive paths and propose efficient algorithms based on the optimal solutions for each of them. Extensive simulations show that PACO outperforms the state-of-the-art SR-based approach by supporting more than 40% explicit paths and achieves a substantial reduction in switch memory (up to 94%) compared with the OpenFlow-based approach.
AB - In this paper, we present a scalable PAth COntrol (PACO) approach to meet the increasing demands of fine-grained and explicit paths in Software-Defined Networks. PACO builds upon Segment Routing and adopts the pathlet segment as the building blocks for constructing network paths. By proactively generating and pre-installing a small collection of segments in networks, PACO can explicitly and quickly set up a massive number of reactive paths by simply concatenating these segments. We theoretically investigate the proactive segment generation as well as the optimal concatenation for reactive paths and propose efficient algorithms based on the optimal solutions for each of them. Extensive simulations show that PACO outperforms the state-of-the-art SR-based approach by supporting more than 40% explicit paths and achieves a substantial reduction in switch memory (up to 94%) compared with the OpenFlow-based approach.
KW - Explicit path control
KW - Scalability
KW - Segment routing
KW - Software-defined networks
UR - http://www.scopus.com/inward/record.url?scp=85066946342&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066946342&partnerID=8YFLogxK
U2 - 10.1016/j.jnca.2019.05.014
DO - 10.1016/j.jnca.2019.05.014
M3 - Article
AN - SCOPUS:85066946342
SN - 1084-8045
VL - 141
SP - 86
EP - 103
JO - Journal of Network and Computer Applications
JF - Journal of Network and Computer Applications
ER -