Evolve carrier ethernet architecture with SDN and segment routing

Cai, Dennis; Wielosz, Anna; Wei, Shouyi

doi:10.1109/wowmom.2014.6918980

Cited by 25 publications

(24 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such, the SDN controller does not need to program each switch along the path, rather only the edge switches need to be programmed to maintain tunnel state information. This will provide a highly flexible and scalable solution for TE with SDN . The controller will learn network topology, run the SR algorithm and specify the best path for each request through a list of labels and then program the edge switch to push these labels onto the related flow packets' header.…”

Section: Preliminariesmentioning

confidence: 99%

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

Roomi

Khorsandi

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this paper, we have proposed a robust optimization for offline segment routing in software‐defined wide area networks combining traffic‐aware and traffic‐oblivious methods. Most prior works on segment routing assume accurate estimation of the traffic matrix, which is difficult to obtain due to the measurement costs and wide variations in traffic matrix over time. To deal with traffic uncertainties, an oblivious segment routing technique was previously developed. However, since all possible traffic fluctuations are considered, this leads to a considerable loss of routing performance in normal conditions. Since the traffic usually fluctuates around a normal pattern within a certain lower/upper bound, in this paper, we propose a semi‐oblivious segment routing method that optimizes routing for a predicted probable traffic matrix, while ensuring its robustness by guarantying the worst‐case performance under the fluctuations. Prior works also considered 2‐segment routing that is demonstrated to lead to routing deficiencies in some cases. We have extended the formulation to include 3‐Segment Routing (3‐SR) and using the strong duality theorem, the proposed semi‐oblivious 3‐SR method is formulated as a linear programming problem with an objective to maximize network throughput. We envision to apply this scheme in software‐defined networks where the controller is responsible to compute robust segment routing paths and to configure the edge routers accordingly. Simulation results show that the proposed method, while being robust to traffic fluctuations, significantly outperforms the traffic oblivious methods in normal network conditions and also achieves comparable performance to the models with known traffic matrix.

show abstract

Section: Preliminariesmentioning

confidence: 99%

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

Roomi

Khorsandi

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Segment Routing is typically associated with a centralized control plane implementation (e.g, SDN [6], [8], [9]) deploy- ing a dedicated SR controller that, upon request, performs the path computation and then encodes the computed path using a sequence of SIDs. Fig.…”

Section: Segment Routing and Reference Scenariomentioning

confidence: 99%

“…The proposed encoding enables binary-based routing without relying on the label stack. In [6], the benefits of SR in a software defined networking (SDN) architecture are discussed. In [7], SR is implemented in an OpenFlow-based SDN architecture.…”

Section: Introductionmentioning

confidence: 99%

Efficient label encoding in segment-routing enabled optical networks

Lazzeri

Bruno

Nijhof

et al. 2015

2015 International Conference on Optical Network Design and Modeling (ONDM)

View full text Add to dashboard Cite

The currently standardized GMPLS protocol suite for packet over optical networks relies on hierarchical instances of signaling sessions. Such sessions have to be established and maintained also in transit nodes, leading to complex and weighty control plane implementations. A novel technology called Segment Routing (SR) has been recently proposed to address these issues. SR relies on the source routing paradigm to provide traffic engineering solutions. In particular, the computed route for a given request is expressed as a segment list applied as an header to data packets at the ingress node. Specific algorithms are then required to perform the path computation and express the computed path through an effective segment list encoding (i.e., label stack), minimizing the segment list depth (SLD) (i.e., the number of labels included in the segment list). So far, no algorithms have been proposed to jointly provide path and segment list computation in SR-based networks. In this study, an efficient segment list encoding algorithm is proposed, guaranteeing optimal path computation and limited SLD in SR-based networks. The algorithm also accounts for equal-cost multiple paths and multiple constraints. The proposed algorithm is successfully applied to different network scenarios, demonstrating its flexibility in several use cases and showing effective performance in terms of segment list depth and introduced packet overhead

show abstract

“…SR is typically associated with a centralized control plane implementation (e.g., SDN [4], [7], [13], [14]). In this scenario, when a new traffic flow has to be established, a request is issued to the centralized controller that determines the traffic path based on its vision of the network (e.g., retrieved by listening to IGP advertisements).…”

Section: Segment Routingmentioning

confidence: 99%

“…Even though standardization is advanced and the main network equipment vendors are currently involved in the implementation phase (commercial deployment of SR products has been announced for the next few months [6]), there has been a limited research work within the academic community. The work in [7] considers the SR application in Carrier Ethernet networks. In particular, the authors propose to combine the benefits of SR with those of a software defined networking (SDN) architecture [4].…”

Section: Introductionmentioning

confidence: 99%

Path Encoding in Segment Routing

Giorgetti

Castoldi

Cugini

et al. 2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Segment Routing (SR) is emerging as an innovative traffic engineering technique compatible with traditional MPLS data plane. SR relies on label stacking, without requiring a signaling protocol. This greatly simplifies network operations in transit nodes. However, it may introduce scalability issues at the ingress node and packet overhead. Therefore, specific algorithms are required to efficiently compute the label stack for a given path.This study proposes two algorithms for SR label stack computation of strict routes that guarantee minimum label stack depth. Then, SR scalability performance is investigated. Results show that, in most of the cases, SR uses label stacks composed of few labels and introduces a limited packet overhead. However, relevant scalability issues may arise in specific cases, e.g., large planar topologies.

show abstract

Evolve carrier ethernet architecture with SDN and segment routing

Cited by 25 publications

References 0 publications

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

Efficient label encoding in segment-routing enabled optical networks

Path Encoding in Segment Routing

Contact Info

Product

Resources

About