File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TNSM.2020.3001615
- Scopus: eid_2-s2.0-85086746227
- WOS: WOS:000568662800046
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Traffic Engineering in Segment Routing Networks Using MILP
| Title | Traffic Engineering in Segment Routing Networks Using MILP |
|---|---|
| Authors | |
| Keywords | load balancing mixed integer linear programming segment routing Traffic engineering |
| Issue Date | 1-Sep-2020 |
| Publisher | Institute of Electrical and Electronics Engineers |
| Citation | IEEE Transactions on Network and Service Management, 2020, v. 17, n. 3, p. 1941-1953 How to Cite? |
| Abstract | In segment routing, a packet is forwarded along a path identified by a segment list. A segment list consists of segment identifiers (SIDs). A node-SID identifies a shortest-path segment, and an adjacency-SID identifies a link segment. A K -segment path is a path with no more than K segments. In this paper, we study the problem of finding a set of K- segment paths to carry all the flows in a given traffic matrix such that the maximum link utilization in the network is minimized. We first show that the solutions found by K -LP, an existing linear programming (LP) approach, are not optimal because K -LP does not support adjacency-SIDs. Focusing on 2-segment paths, a new LP formulation, denoted by e2-LP, is designed to support adjacency-SIDs in part. To fully support adjacency-SIDs, a mixed integer linear programming (MILP), denoted by K -MILP, is designed. Since solving K -MILP is time-consuming, a simplified version ( K -sMILP) is also proposed. Finally, K -sMILP is extended to prevent excessive flow splitting or using paths that are too long. |
| Persistent Identifier | http://hdl.handle.net/10722/339800 |
| ISSN | 2023 Impact Factor: 4.7 2023 SCImago Journal Rankings: 1.762 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Li, Xiaoqian | - |
| dc.contributor.author | Yeung, Kwan L | - |
| dc.date.accessioned | 2024-03-11T10:39:24Z | - |
| dc.date.available | 2024-03-11T10:39:24Z | - |
| dc.date.issued | 2020-09-01 | - |
| dc.identifier.citation | IEEE Transactions on Network and Service Management, 2020, v. 17, n. 3, p. 1941-1953 | - |
| dc.identifier.issn | 1932-4537 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/339800 | - |
| dc.description.abstract | <p>In segment routing, a packet is forwarded along a path identified by a segment list. A segment list consists of segment identifiers (SIDs). A node-SID identifies a shortest-path segment, and an adjacency-SID identifies a link segment. A K -segment path is a path with no more than K segments. In this paper, we study the problem of finding a set of K- segment paths to carry all the flows in a given traffic matrix such that the maximum link utilization in the network is minimized. We first show that the solutions found by K -LP, an existing linear programming (LP) approach, are not optimal because K -LP does not support adjacency-SIDs. Focusing on 2-segment paths, a new LP formulation, denoted by e2-LP, is designed to support adjacency-SIDs in part. To fully support adjacency-SIDs, a mixed integer linear programming (MILP), denoted by K -MILP, is designed. Since solving K -MILP is time-consuming, a simplified version ( K -sMILP) is also proposed. Finally, K -sMILP is extended to prevent excessive flow splitting or using paths that are too long.<br></p> | - |
| dc.language | eng | - |
| dc.publisher | Institute of Electrical and Electronics Engineers | - |
| dc.relation.ispartof | IEEE Transactions on Network and Service Management | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.subject | load balancing | - |
| dc.subject | mixed integer linear programming | - |
| dc.subject | segment routing | - |
| dc.subject | Traffic engineering | - |
| dc.title | Traffic Engineering in Segment Routing Networks Using MILP | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1109/TNSM.2020.3001615 | - |
| dc.identifier.scopus | eid_2-s2.0-85086746227 | - |
| dc.identifier.volume | 17 | - |
| dc.identifier.issue | 3 | - |
| dc.identifier.spage | 1941 | - |
| dc.identifier.epage | 1953 | - |
| dc.identifier.eissn | 1932-4537 | - |
| dc.identifier.isi | WOS:000568662800046 | - |
| dc.identifier.issnl | 1932-4537 | - |