ScholarLens Back to search
2018•Unpublished venueRequires access

ISIS Segment Routing Flexible Algorithm

Peter Pšenák, Shraddha Hegde, Arkadiy Gulko, Clarence Filsfils

Open publisher page 0 citations

Abstract

IGP protocols traditionally compute best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP based or Segment Routing based Traffic Engineering to enforce traffic over a path that is computed using different metrics or constrains then IGP path. Various mechanisms are used to steer the traffic towards such traffic engineered paths. This document proposes a solution that allows IGPs itself to compute constrained based path over the network without the usage of the traffic engineering.

About this research paper

What this paper is about

IGP protocols traditionally compute best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP based or Segment Routing based Traffic Engineering to enforce traffic over a path that is computed using different metrics or constrains then IGP path. Various mechanisms are used to steer the traffic towards such traffic engineered paths. This document proposes a solution that allows IGPs itself to compute constrained based path over the network without the usage of the traffic engineering.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

IGP protocols traditionally compute best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP based or Segment Routing based Traffic Engineering to enforce traffic over a path that is computed using different metrics or constrains then IGP path. Various mechanisms are used to steer the traffic towards such traffic engineered paths. This document proposes a solution that allows IGPs itself to compute constrained based path over the network without the usage of the traffic engineering.

Key concepts: Computer science, Routing (electronic design automation), Path (computing), Computer network, Distributed computing, Equal-cost multi-path routing, Routing protocol, Traffic engineering

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
ISIS Segment Routing Flexible Algorithm — Research Paper | ScholarLens