Latest revision as of 23:43, 1 February 2021

Abstract

The current specification of the Segment Routing (SR) architecture requires enhancements to the intra-domain routing protocols (e.g. OSPF and IS-IS) so that the nodes can advertise the Segment Identifiers (SIDs). We propose a simpler solution called PMSR (Poor Man's Segment Routing), that does not require any enhancement to routing protocol. We compare the procedures of PMSR with traditional SR, showing that PMSR can reduce the operation and management complexity. We analyze the set of use cases in the current SR drafts and we claim that PMSR can support the large majority of them. Thanks to the drastic simplification of the Control Plane, we have been able to develop an Open Source prototype of PMSR. In the second part of the paper, we consider a Traffic Engineering use case, starting from a traditional flow assignment optimization problem which allocates hop-by-hop paths to flows. We propose a SR path assignment algorithm and prove that it is optimal with respect to the number of segments allocated to a flow.

Comment: September 2015 - Paper accepted to the Mini-conference track of NOMS 2016

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/1512.05281

• http://arxiv.org/pdf/1512.05281

• http://xplorestaging.ieee.org/ielx7/7499631/7502779/07502864.pdf?arnumber=7502864,

http://dx.doi.org/10.1109/noms.2016.7502864

• https://dblp.uni-trier.de/db/journals/corr/corr1512.html#SalsanoVDVS15,

http://netgroup.uniroma2.it/Stefano_Salsano/papers/salsano-seg-routing-noms-2016.pdf,

https://ieeexplore.ieee.org/document/7502864,

https://ui.adsabs.harvard.edu/abs/2015arXiv151205281S/abstract,

http://ieeexplore.ieee.org/document/7502864,

https://dx.doi.org/10.1109/NOMS.2016.7502864,

https://doi.org/10.1109/NOMS.2016.7502864,

https://academic.microsoft.com/#/detail/2205234571