{"id":"https://openalex.org/W2122302754","doi":"https://doi.org/10.1109/glocom.2010.5683269","title":"Multiperiod Planning with Controlled Shortest Path Routing","display_name":"Multiperiod Planning with Controlled Shortest Path Routing","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2122302754","doi":"https://doi.org/10.1109/glocom.2010.5683269","mag":"2122302754"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"},"type":"conference-paper","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/A5069402497","display_name":"Clara Kronberger","orcid":null},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]},{"id":"https://openalex.org/I4210159457","display_name":"Nokia (Germany)","ror":"https://ror.org/05nh5td39","country_code":"DE","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210159457"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Clara Kronberger","raw_affiliation_strings":["Lehrstuhl f\u00fcr Kommunikationsnetze, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","Nokia Siemens Networks, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Kommunikationsnetze, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Nokia Siemens Networks, Munich, Germany","institution_ids":["https://openalex.org/I1325886976","https://openalex.org/I4210159457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024984864","display_name":"Dominic Schupke","orcid":"https://orcid.org/0000-0001-6562-7363"},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]},{"id":"https://openalex.org/I4210159457","display_name":"Nokia (Germany)","ror":"https://ror.org/05nh5td39","country_code":"DE","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210159457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominic A. Schupke","raw_affiliation_strings":["Nokia Siemens Networks, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Siemens Networks, Munich, Germany","institution_ids":["https://openalex.org/I1325886976","https://openalex.org/I4210159457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002188781","display_name":"J\u00f6rg Ebersp\u00e4cher","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jorg Eberspacher","raw_affiliation_strings":["Lehrstuhl f\u00fcr Kommunikationsnetze, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Kommunikationsnetze, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.24746454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.967199981212616,"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/T11180","display_name":"Pesticide and Herbicide Environmental Studies","score":0.9467999935150146,"subfield":{"id":"https://openalex.org/subfields/2310","display_name":"Pollution"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.8040105104446411},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.7837135791778564},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6925280690193176},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6756998300552368},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6511583924293518},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6240594983100891},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6144696474075317},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5951908826828003},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.5373756885528564},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4725990891456604},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.47152742743492126},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4502515196800232},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39822453260421753},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39025843143463135},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3385666608810425},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33126699924468994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21773311495780945},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18082216382026672},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0702396035194397}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.8040105104446411},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.7837135791778564},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6925280690193176},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6756998300552368},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6511583924293518},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6240594983100891},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6144696474075317},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5951908826828003},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.5373756885528564},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4725990891456604},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.47152742743492126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4502515196800232},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39822453260421753},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39025843143463135},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3385666608810425},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33126699924468994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21773311495780945},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18082216382026672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0702396035194397},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2010.5683269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2009987517","https://openalex.org/W2011923056","https://openalex.org/W2016412715","https://openalex.org/W2030482417","https://openalex.org/W2096655151","https://openalex.org/W2100908985","https://openalex.org/W2102863882","https://openalex.org/W2114686820","https://openalex.org/W2120958615","https://openalex.org/W2122183147","https://openalex.org/W2127094430","https://openalex.org/W2142016592","https://openalex.org/W2165030634","https://openalex.org/W2533001672","https://openalex.org/W6678758128"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1515277195","https://openalex.org/W1997440971","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2064711473","https://openalex.org/W1579931977","https://openalex.org/W2237860883","https://openalex.org/W2121598558","https://openalex.org/W1971025399"],"abstract_inverted_index":{"For":[0,114],"simplified":[1],"network":[2,39],"operations,":[3],"demands":[4],"are":[5,66,80],"often":[6],"routed":[7],"on":[8,62],"shortest":[9,22,48,83,103,125,135],"paths,":[10],"e.g.,":[11],"with":[12,102],"physical":[13],"length":[14],"as":[15,31],"metric.":[16],"We":[17],"propose":[18],"a":[19,57,72],"new":[20,95],"controlled":[21,124],"path":[23,49,84,104,126,136],"routing":[24,35,50,85,96,105,127],"concept":[25,36],"for":[26],"multiperiod":[27],"planned":[28],"networks,":[29,119],"formulated":[30],"optimization":[32,59],"model.":[33],"This":[34],"minimizes":[37],"the":[38,44,52,107],"costs":[40],"(capital":[41],"expenditures)":[42],"under":[43,82],"constraint":[45],"of":[46],"using":[47],"within":[51,86],"lit":[53],"fiber":[54,74,89],"network.":[55,90],"Within":[56],"single":[58],"step,":[60],"fibers":[61],"candidate":[63,108],"topology":[64,109],"edges":[65],"chosen":[67],"to":[68,116,143],"become":[69],"lit,":[70],"constituting":[71],"(lit)":[73],"network,":[75],"such":[76],"that":[77,123],"cost-optimal":[78,112,144],"results":[79,133],"obtained":[81],"this":[87],"selected":[88],"In":[91],"case":[92,120],"studies":[93,121],"our":[94],"and":[97,110],"dimensioning":[98],"approach":[99],"is":[100],"compared":[101],"in":[106,141],"general":[111],"routing.":[113,145],"lightly":[115],"medium":[117],"loaded":[118],"show":[122],"can":[128],"achieve":[129],"significantly":[130],"lower":[131],"cost":[132,142],"than":[134],"routing,":[137],"while":[138],"being":[139],"comparable":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}