{"id":"https://openalex.org/W2770845104","doi":"https://doi.org/10.1002/net.21792","title":"Open shortest path first routing under random early detection","display_name":"Open shortest path first routing under random early detection","publication_year":2017,"publication_date":"2017-11-21","ids":{"openalex":"https://openalex.org/W2770845104","doi":"https://doi.org/10.1002/net.21792","mag":"2770845104"},"language":"en","primary_location":{"id":"doi:10.1002/net.21792","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21792","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5100383759","display_name":"Jiaxin Liu","orcid":"https://orcid.org/0000-0002-1451-4737"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jiaxin Liu","raw_affiliation_strings":["Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada","Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010307197","display_name":"Stanko Dimitrov","orcid":"https://orcid.org/0000-0003-1573-1140"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Stanko Dimitrov","raw_affiliation_strings":["Department of Management Sciences University of Waterloo Waterloo Ontario Canada","Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada"],"raw_orcid":"https://orcid.org/0000-0003-1573-1140","affiliations":[{"raw_affiliation_string":"Department of Management Sciences University of Waterloo Waterloo Ontario Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010307197"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20849815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"2","first_page":"120","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9991999864578247,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9991999864578247,"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/T12127","display_name":"Software System Performance and Reliability","score":0.9905999898910522,"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.9904000163078308,"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.6953445076942444},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.6378416419029236},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.6263826489448547},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6101796627044678},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5939416885375977},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5552268028259277},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5376414656639099},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.511300802230835},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.48327451944351196},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.47557297348976135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4556877315044403},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.44554227590560913},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.42913684248924255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32931315898895264},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3258657157421112},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3245961666107178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22036519646644592},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13389423489570618},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08707678318023682}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953445076942444},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.6378416419029236},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.6263826489448547},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6101796627044678},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5939416885375977},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5552268028259277},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5376414656639099},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.511300802230835},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.48327451944351196},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.47557297348976135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4556877315044403},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.44554227590560913},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.42913684248924255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32931315898895264},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3258657157421112},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3245961666107178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22036519646644592},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13389423489570618},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08707678318023682}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.21792","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21792","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/16777","is_oa":false,"landing_page_url":"http://hdl.handle.net/10012/16777","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W22476574","https://openalex.org/W1515277195","https://openalex.org/W1579101628","https://openalex.org/W1700275549","https://openalex.org/W1966229055","https://openalex.org/W1973264045","https://openalex.org/W1987520910","https://openalex.org/W1991114512","https://openalex.org/W1993229082","https://openalex.org/W1999955156","https://openalex.org/W2006146932","https://openalex.org/W2011039300","https://openalex.org/W2081873092","https://openalex.org/W2088007832","https://openalex.org/W2096655151","https://openalex.org/W2105291450","https://openalex.org/W2106292145","https://openalex.org/W2106841911","https://openalex.org/W2158733823","https://openalex.org/W2163907500","https://openalex.org/W4239300522","https://openalex.org/W4242097656"],"related_works":["https://openalex.org/W2962525871","https://openalex.org/W1966183048","https://openalex.org/W2086868384","https://openalex.org/W102510913","https://openalex.org/W2383390803","https://openalex.org/W2027034109","https://openalex.org/W3110073604","https://openalex.org/W3163135404","https://openalex.org/W2245040950","https://openalex.org/W2184523038"],"abstract_inverted_index":{"In":[0,29],"this":[1,37],"article,":[2],"we":[3,34,39,108,157],"consider":[4,35],"a":[5,42,53,61,74,138],"variant":[6],"of":[7,32,55,140],"Open":[8],"Shortest":[9],"Path":[10],"First":[11],"(OSPF)":[12],"routing":[13,75,84,98,131,163],"that":[14,79,86,119,135,168],"accounts":[15,87],"for":[16,26,88,95,112,165,170],"Random":[17],"Early":[18],"Detection":[19],"(RED),":[20],"an":[21,81,173],"Active":[22],"Queue":[23],"Management":[24],"method":[25],"backbone":[27,155],"networks.":[28],"the":[30,56,68,96,116,121,130,188,190],"version":[31],"OSPF":[33,57,83],"in":[36,93,115,184],"article":[38],"only":[40],"require":[41],"single":[43],"network":[44,117,186],"path":[45,124],"be":[46,101],"available":[47],"between":[48],"each":[49,185],"origin":[50],"and":[51,176],"destination,":[52],"simplification":[54],"protocol.":[58],"We":[59,77,133],"formulate":[60],"mixed":[62],"integer":[63],"non\u2010linear":[64],"program":[65],"to":[66,72,100,105,160],"determine":[67,110],"data":[69,151,191],"paths,":[70],"referred":[71,104],"as":[73,106],"policy.":[76],"prove":[78],"determining":[80,136],"optimal":[82],"policy":[85],"RED":[89],"is":[90,143,145],"NP\u2010Hard.":[91,147],"Furthermore,":[92],"order":[94],"generated":[97],"policies":[99,164,177],"real\u2010world":[102,154],"implementable,":[103],"realizable,":[107],"must":[109],"weights":[111,128],"all":[113],"arcs":[114],"such":[118],"solving":[120],"all\u2010pairs":[122,141],"shortest":[123],"problem":[125],"using":[126,149,172],"these":[127,166],"reproduces":[129],"policies.":[132],"show":[134],"if":[137],"set":[139],"routes":[142],"realizable":[144,162],"also":[146],"Fortunately,":[148],"traffic":[150],"from":[152],"three":[153],"networks,":[156],"are":[158],"able":[159],"find":[161],"networks":[167],"account":[169],"RED,":[171],"off\u2010the\u2010shelf":[174],"solver,":[175],"found":[178],"perform":[179],"better":[180],"than":[181],"those":[182],"used":[183],"at":[187],"time":[189],"was":[192],"collected.":[193]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}