A Computation-Efficient Approach for Segment Routing Traffic Engineering
The unprecedented growth of network traffic has brought excessive challenges to network operators. To prevent network congestion, network operators conduct traffic engineering (TE) for their routing optimization. In recent years, segment routing traffic engineering (SRTE) has emerged as one of the p...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8890665/ |
id |
doaj-7f97c7cfab304810b42dee70a589e931 |
---|---|
record_format |
Article |
spelling |
doaj-7f97c7cfab304810b42dee70a589e9312021-03-30T00:43:18ZengIEEEIEEE Access2169-35362019-01-01716040816041710.1109/ACCESS.2019.29511638890665A Computation-Efficient Approach for Segment Routing Traffic EngineeringTossaphol Settawatcharawanit0https://orcid.org/0000-0001-8488-5165Yi-Han Chiang1https://orcid.org/0000-0003-2850-3120Vorapong Suppakitpaisarn2Yusheng Ji3Department of Informatics, The Graduate University for Advanced Studies, Sokendai, Tokyo, JapanInformation Systems Architecture Science Research Division, National Institute of Informatics, Tokyo, JapanDepartment of Computer Science, The University of Tokyo, Tokyo, JapanDepartment of Informatics, The Graduate University for Advanced Studies, Sokendai, Tokyo, JapanThe unprecedented growth of network traffic has brought excessive challenges to network operators. To prevent network congestion, network operators conduct traffic engineering (TE) for their routing optimization. In recent years, segment routing traffic engineering (SRTE) has emerged as one of the promising approaches for its high scalability and low control overheads. However, conventional SRTE approaches in large-scale networks are computationally prohibitive, which may lead to delayed system operations and unsatisfactory service qualities. In this paper, we formulate a bi-objective mixed-integer nonlinear program (BOMINLP) to investigate the trade-off between link utilization and computation time in SRTE. Due to the difficulty in solving the original problem directly, we decompose it into two sequential sub-problems. The first sub-problem is to minimize computation time through node selection, and the second one is to minimize maximum link utilization via flow assignment. To this end, we first employ randomized sampling based on stretch bounding to obtain a reduced solution space and then solve a linear program (LP) using existing software tools for the sub-problems. To evaluate our proposed solution, we employ network topologies and traffic matrices from publicly available datasets. Our simulation results show that our proposed solution can effectively reduce computation time while retaining comparable maximum link utilization as compared with several comparison approaches.https://ieeexplore.ieee.org/document/8890665/Segment routingtraffic engineeringbi-objective mixed-integer nonlinear program |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Tossaphol Settawatcharawanit Yi-Han Chiang Vorapong Suppakitpaisarn Yusheng Ji |
spellingShingle |
Tossaphol Settawatcharawanit Yi-Han Chiang Vorapong Suppakitpaisarn Yusheng Ji A Computation-Efficient Approach for Segment Routing Traffic Engineering IEEE Access Segment routing traffic engineering bi-objective mixed-integer nonlinear program |
author_facet |
Tossaphol Settawatcharawanit Yi-Han Chiang Vorapong Suppakitpaisarn Yusheng Ji |
author_sort |
Tossaphol Settawatcharawanit |
title |
A Computation-Efficient Approach for Segment Routing Traffic Engineering |
title_short |
A Computation-Efficient Approach for Segment Routing Traffic Engineering |
title_full |
A Computation-Efficient Approach for Segment Routing Traffic Engineering |
title_fullStr |
A Computation-Efficient Approach for Segment Routing Traffic Engineering |
title_full_unstemmed |
A Computation-Efficient Approach for Segment Routing Traffic Engineering |
title_sort |
computation-efficient approach for segment routing traffic engineering |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
The unprecedented growth of network traffic has brought excessive challenges to network operators. To prevent network congestion, network operators conduct traffic engineering (TE) for their routing optimization. In recent years, segment routing traffic engineering (SRTE) has emerged as one of the promising approaches for its high scalability and low control overheads. However, conventional SRTE approaches in large-scale networks are computationally prohibitive, which may lead to delayed system operations and unsatisfactory service qualities. In this paper, we formulate a bi-objective mixed-integer nonlinear program (BOMINLP) to investigate the trade-off between link utilization and computation time in SRTE. Due to the difficulty in solving the original problem directly, we decompose it into two sequential sub-problems. The first sub-problem is to minimize computation time through node selection, and the second one is to minimize maximum link utilization via flow assignment. To this end, we first employ randomized sampling based on stretch bounding to obtain a reduced solution space and then solve a linear program (LP) using existing software tools for the sub-problems. To evaluate our proposed solution, we employ network topologies and traffic matrices from publicly available datasets. Our simulation results show that our proposed solution can effectively reduce computation time while retaining comparable maximum link utilization as compared with several comparison approaches. |
topic |
Segment routing traffic engineering bi-objective mixed-integer nonlinear program |
url |
https://ieeexplore.ieee.org/document/8890665/ |
work_keys_str_mv |
AT tossapholsettawatcharawanit acomputationefficientapproachforsegmentroutingtrafficengineering AT yihanchiang acomputationefficientapproachforsegmentroutingtrafficengineering AT vorapongsuppakitpaisarn acomputationefficientapproachforsegmentroutingtrafficengineering AT yushengji acomputationefficientapproachforsegmentroutingtrafficengineering AT tossapholsettawatcharawanit computationefficientapproachforsegmentroutingtrafficengineering AT yihanchiang computationefficientapproachforsegmentroutingtrafficengineering AT vorapongsuppakitpaisarn computationefficientapproachforsegmentroutingtrafficengineering AT yushengji computationefficientapproachforsegmentroutingtrafficengineering |
_version_ |
1724187926968926208 |