{"id":"https://openalex.org/W2205234571","doi":"https://doi.org/10.1109/noms.2016.7502864","title":"PMSR \u2014 Poor Man's Segment Routing, a minimalistic approach to Segment Routing and a Traffic Engineering use case","display_name":"PMSR \u2014 Poor Man's Segment Routing, a minimalistic approach to Segment Routing and a Traffic Engineering use case","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2205234571","doi":"https://doi.org/10.1109/noms.2016.7502864","mag":"2205234571"},"language":"en","primary_location":{"id":"doi:10.1109/noms.2016.7502864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms.2016.7502864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079293206","display_name":"Stefano Salsano","orcid":"https://orcid.org/0000-0003-3040-3559"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Stefano Salsano","raw_affiliation_strings":["Univ. of Rome Tor Vergata"],"affiliations":[{"raw_affiliation_string":"Univ. of Rome Tor Vergata","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055742211","display_name":"Luca Veltri","orcid":"https://orcid.org/0000-0003-2245-4823"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Veltri","raw_affiliation_strings":["Univ. of Parma"],"affiliations":[{"raw_affiliation_string":"Univ. of Parma","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042850397","display_name":"Luca Davoli","orcid":"https://orcid.org/0000-0002-4396-8885"},"institutions":[{"id":"https://openalex.org/I4210131708","display_name":"Consortium GARR","ror":"https://ror.org/03x9xd924","country_code":"IT","type":"nonprofit","lineage":["https://openalex.org/I4210131708"]},{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Davoli","raw_affiliation_strings":["Univ. of Parma / Consortium GARR"],"affiliations":[{"raw_affiliation_string":"Univ. of Parma / Consortium GARR","institution_ids":["https://openalex.org/I4210131708","https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084496684","display_name":"Pier Luigi Ventre","orcid":"https://orcid.org/0000-0001-6610-0547"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pier Luigi Ventre","raw_affiliation_strings":["Univ. of Rome Tor Vergata"],"affiliations":[{"raw_affiliation_string":"Univ. of Rome Tor Vergata","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022168600","display_name":"Giuseppe Siracusano","orcid":"https://orcid.org/0000-0002-8960-4622"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Siracusano","raw_affiliation_strings":["Univ. of Rome Tor Vergata"],"affiliations":[{"raw_affiliation_string":"Univ. of Rome Tor Vergata","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5079293206"],"corresponding_institution_ids":["https://openalex.org/I116067653"],"apc_list":null,"apc_paid":null,"fwci":3.764,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93493266,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"598","last_page":"604"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7378934621810913},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6201142072677612},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.5787806510925293},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5564016699790955},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5520831942558289},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5185392498970032},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5106895565986633},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5060786604881287},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.49864935874938965},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4718106985092163},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4637404680252075},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.45783165097236633},{"id":"https://openalex.org/keywords/hybrid-routing","display_name":"Hybrid routing","score":0.4499911367893219},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.446407288312912},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4181879758834839}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7378934621810913},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6201142072677612},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.5787806510925293},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5564016699790955},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5520831942558289},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5185392498970032},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5106895565986633},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5060786604881287},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.49864935874938965},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4718106985092163},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4637404680252075},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.45783165097236633},{"id":"https://openalex.org/C2776955676","wikidata":"https://www.wikidata.org/wiki/Q7371623","display_name":"Hybrid routing","level":5,"score":0.4499911367893219},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.446407288312912},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4181879758834839}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/noms.2016.7502864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms.2016.7502864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","score":0.5,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W803818738","https://openalex.org/W1505653851","https://openalex.org/W1545430305","https://openalex.org/W1595457770","https://openalex.org/W1728954886","https://openalex.org/W2021136283","https://openalex.org/W2118404561","https://openalex.org/W2144014315","https://openalex.org/W2154416792","https://openalex.org/W2205234571","https://openalex.org/W2274217508","https://openalex.org/W2292669715","https://openalex.org/W2314709727","https://openalex.org/W2406677393","https://openalex.org/W2493944851","https://openalex.org/W2497982034","https://openalex.org/W2507195146","https://openalex.org/W2514718641","https://openalex.org/W6623142157","https://openalex.org/W6629983835","https://openalex.org/W6713747500"],"related_works":["https://openalex.org/W2361544815","https://openalex.org/W2349459796","https://openalex.org/W2259760652","https://openalex.org/W2996024532","https://openalex.org/W4312035994","https://openalex.org/W2035841327","https://openalex.org/W2024287692","https://openalex.org/W2188727730","https://openalex.org/W2161463048","https://openalex.org/W2587141779"],"abstract_inverted_index":{"The":[0],"current":[1,78],"specification":[2],"of":[3,54,73,91,98,112,118,160],"the":[4,12,22,26,52,64,71,77,88,95,99,115,119,158],"Segment":[5,27,39],"Routing":[6],"(SR)":[7],"architecture":[8],"requires":[9],"enhancements":[10],"to":[11,47,94,106,140,157,163],"intradomain":[13],"routing":[14,48],"protocols":[15],"(e.g.":[16],"OSPF":[17],"and":[18,66,81,149],"IS-IS)":[19],"so":[20],"that":[21,41,60,84,151],"nodes":[23],"can":[24,62,86],"advertise":[25],"Identifiers":[28],"(SIDs).":[29],"We":[30,50,69,142],"propose":[31,143],"a":[32,123,130,144,164],"simpler":[33],"solution":[34],"called":[35],"PMSR":[36,55,61,85],"(Poor":[37],"Man's":[38],"Routing),":[40],"does":[42],"not":[43],"require":[44],"any":[45],"enhancement":[46],"protocol.":[49],"compare":[51],"procedures":[53],"with":[56,155],"traditional":[57,131],"SR,":[58],"showing":[59],"reduce":[63],"operation":[65],"management":[67],"complexity.":[68],"analyze":[70],"set":[72],"use":[74,126],"cases":[75],"in":[76],"SR":[79,145],"drafts":[80],"we":[82,102,121],"claim":[83],"support":[87],"large":[89],"majority":[90],"them.":[92],"Thanks":[93],"drastic":[96],"simplification":[97],"control":[100],"plane,":[101],"have":[103],"been":[104],"able":[105],"develop":[107],"an":[108],"open":[109],"source":[110],"prototype":[111],"PMSR.":[113],"In":[114],"second":[116],"part":[117],"paper,":[120],"consider":[122],"Traffic":[124],"Engineering":[125],"case,":[127],"starting":[128],"from":[129],"flow":[132],"assignment":[133,147],"optimization":[134],"problem,":[135],"which":[136],"allocates":[137],"hop-by-hop":[138],"paths":[139],"flows.":[141],"path":[146],"algorithm":[148],"prove":[150],"it":[152],"is":[153],"optimal":[154],"respect":[156],"number":[159],"segments":[161],"allocated":[162],"flow.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}