Optimizing Segment Routing With the Maximum SLD Constraint Using Openflow

Huang, Liaoruo; Shen, Qing; Shao, Wenjuan; Cui, Xiaoyu

doi:10.1109/access.2018.2826925

Cited by 10 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each paper, the table identifies the following characteristics: (i) consideration of SDN architecture, (ii) consideration of SLD as a constraint or a minimization objective, (iii) proposal of one or more heuristics, (iv) consideration of network traffic matrix, (v) consideration of traffic engineering (TE), (vi) consideration of ECMP‐based routing, (vii) use of ILP formulation, and (viii) minimization of FTS is discussed. As seen, none of the prior work considers FTS minimization, except that of Huang et al 16 and our earlier work 10 . In the case of the former, the objective is not the minimization of FTS max but optimization of SR paths within a given SLD max .…”

Section: Background and Related Workmentioning

confidence: 99%

“…In general, the smaller the SLD limitation, the larger the label space required for forwarding. This is explained in the work by Huang et al 16 A path encoding algorithm may take the traffic matrix (i.e., all flows through the network) into account or compute the segment list for each flow in isolation. The former technique is considered to be traffic matrix aware and, the latter, traffic matrix oblivious.…”

Section: Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Optimal segments for forwarding table size minimization in segment‐routed SDNs

Anbiah

Sivalingam

2020

Int J Network Mgmt

View full text Add to dashboard Cite

Summary Segment routing (SR) is a source routing paradigm where packet forwarding is based on a sequence of instructions known as segments identified using segment IDs (SIDs). An ordered list of SIDs identifies the source route and is carried in the packet headers. Switches in such networks use the SIDs to look up their forwarding tables and forward packets along the segments. Since various flows can share the segments, SR is a mechanism to avoid per‐flow state thereby minimizing the forwarding table size (FTS) of the switches. Software‐defined networks (SDNs) are suitable for SR since the source routing can be accomplished by a centralized controller. Typically, the segment list is limited to a maximum segment list depth (SLD). It can be shown that FTS varies inversely as the SLD. This paper studies the problem of minimizing the FTS given the set of flows and the SLD limitation, which is shown to be NP‐complete. An ILP formulation of the problem is used to solve the problem in relatively small networks. Two different heuristic solutions, BFH and CCH, are presented to solve this problem in large‐scale networks with up to 30,000 nodes and 250,000 flows and for three different network topologies (ring‐of‐rings, fat‐tree, and mesh). The heuristics are shown to perform up to 50% better than an existing FTS minimization technique. Further, CCH is shown to perform better in networks with a high prevalence of equal cost multipaths (ECMPs), while BFH performs better when ECMPs are few in number.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Section: Background and Related Workmentioning

confidence: 99%

Optimal segments for forwarding table size minimization in segment‐routed SDNs

Anbiah

Sivalingam

2020

Int J Network Mgmt

View full text Add to dashboard Cite

show abstract

“…SDN can obtain a global network view to provide global optimal routing decisions for SR. So far, some studies [15], [16] focus on deploying SR on large-scale SDN networks for achieving efficient flow forwarding schemes. Guedrez et al [15] present and analyze SR-LEA, an efficient path label encoding algorithm to use the least label stack to express the complete routing path.…”

Section: Related Workmentioning

confidence: 99%

“…Guedrez et al [15] present and analyze SR-LEA, an efficient path label encoding algorithm to use the least label stack to express the complete routing path. Huang et al [16] design an architecture of OpenFlow-based Segment Routing and propose a new path encoding scheme to reduce the overhead of additional flow entries and label space. Dugeon et al [17] design a Segment Routing architecture for SDN networks, which couple the capabilities of an SDN controller and a path encoding engine to reduce the label stack depth and the number of the flow entries.…”

Section: Related Workmentioning

confidence: 99%

PASR: An Efficient Flow Forwarding Scheme Based on Segment Routing in Software-Defined Networking

2020

IEEE Access

View full text Add to dashboard Cite

Software-Defined Networking provides flexible and efficient network management. However, the limited flow table space lead to many challenges for SDN networks on flexibility and scalability. In order to achieve efficient routing scheme, we propose an efficient flow forwarding scheme based on Segment Routing named PASR to solve SDN switch flow table resource shortage problem. Traditional OpenFlow-based or MPLS-based flow forwarding scheme may lead to performance degradation due to flow-table overflowed or heavy MPLS label load incurred. PASR exploits SDN, Segment Routing and intelligent path encoding algorithm to achieve a trade-off between flow table resource and MPLS label load. The proposed PASR can learn the flow path information online to implement path aggregation by aggregating a large number of flows into a small number of flow entries based on the coincidence degree of the flow path. To find the optimal flow path aggregation scheme, we present an intelligent encoding algorithm to maximize the overall cost saving. The simulation results show that PASR can effectively reduce both the number of flow entries and the MPLS label load of the packet. INDEX TERMS Software-defined networking (SDN), segment routing (SR), path encoding, flow table.

show abstract

“…In [18], Gang et al formulated a mixed-integer linear program to maximize throughput in hybrid segment routing networks. In [19], Huang et al proposed an integer linear program that considers the maximum segment label depth and flow entry overhead. In [20], Zhang et al proposed a bandwidth allocation algorithm to maximize user satisfaction as a function of resource allocation in hybrid segment routing networks.…”

Section: Introductionmentioning

confidence: 99%

A Computation-Efficient Approach for Segment Routing Traffic Engineering

et al. 2019

View full text Add to dashboard Cite

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. INDEX TERMS Segment routing, traffic engineering, bi-objective mixed-integer nonlinear program.

show abstract

Optimizing Segment Routing With the Maximum SLD Constraint Using Openflow

Cited by 10 publications

References 19 publications

Optimal segments for forwarding table size minimization in segment‐routed SDNs

Optimal segments for forwarding table size minimization in segment‐routed SDNs

PASR: An Efficient Flow Forwarding Scheme Based on Segment Routing in Software-Defined Networking

A Computation-Efficient Approach for Segment Routing Traffic Engineering

Contact Info

Product

Resources

About