{"id":"https://openalex.org/W2086334072","doi":"https://doi.org/10.1109/lanman.2011.6076938","title":"Case study of a gearbox-like routing algorithm selection in runtime","display_name":"Case study of a gearbox-like routing algorithm selection in runtime","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2086334072","doi":"https://doi.org/10.1109/lanman.2011.6076938","mag":"2086334072"},"language":"en","primary_location":{"id":"doi:10.1109/lanman.2011.6076938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2011.6076938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","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/A5057655513","display_name":"Andrei Bogdan Rus","orcid":"https://orcid.org/0000-0003-1882-641X"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Andrei B. Rus","raw_affiliation_strings":["Technical University of Cluj-Napoca, Cluj-Napoca, Romania","[Technical University of Cluj-Napoca, Memorandumului 28, 400114, Cluj-Napoca, Romania]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I158333966"]},{"raw_affiliation_string":"[Technical University of Cluj-Napoca, Memorandumului 28, 400114, Cluj-Napoca, Romania]","institution_ids":["https://openalex.org/I158333966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028369867","display_name":"Virgil Dobrot\u0103","orcid":"https://orcid.org/0000-0001-5917-4003"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Virgil Dobrota","raw_affiliation_strings":["Technical University of Cluj-Napoca, Cluj-Napoca, Romania","[Technical University of Cluj-Napoca, Memorandumului 28, 400114, Cluj-Napoca, Romania]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I158333966"]},{"raw_affiliation_string":"[Technical University of Cluj-Napoca, Memorandumului 28, 400114, Cluj-Napoca, Romania]","institution_ids":["https://openalex.org/I158333966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I158333966"],"apc_list":null,"apc_paid":null,"fwci":0.286,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46512047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"pp","issue":null,"first_page":"1","last_page":"6"},"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.9998999834060669,"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.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9994000196456909,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.807640552520752},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7686192393302917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6032080054283142},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5984448790550232},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.587692141532898},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.572658360004425},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5387865304946899},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5374423265457153},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.48880860209465027},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.4872783422470093},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.48717254400253296},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47334814071655273},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4626999497413635},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4310910701751709},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4121035933494568},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.339863121509552},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14951103925704956}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.807640552520752},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7686192393302917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6032080054283142},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5984448790550232},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.587692141532898},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.572658360004425},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5387865304946899},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5374423265457153},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.48880860209465027},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.4872783422470093},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.48717254400253296},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47334814071655273},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4626999497413635},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4310910701751709},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4121035933494568},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.339863121509552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14951103925704956},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lanman.2011.6076938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2011.6076938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W100245444","https://openalex.org/W2004475176","https://openalex.org/W2021581665","https://openalex.org/W2088506653","https://openalex.org/W2101090782","https://openalex.org/W2114774964","https://openalex.org/W2407521002","https://openalex.org/W6672807701","https://openalex.org/W6713775629"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W142214912","https://openalex.org/W2154440508","https://openalex.org/W2188773866","https://openalex.org/W2114321370","https://openalex.org/W1924167960","https://openalex.org/W2159325933"],"abstract_inverted_index":{"Routing":[0],"protocols":[1],"for":[2,9,81,176],"the":[3,14,17,26,48,72,77,92,101,106,113,121],"Future":[4],"Internet":[5],"need":[6],"to":[7,54,66,137,167],"adapt":[8],"any":[10,30],"given":[11],"status":[12],"of":[13,42,133,142,150],"network.":[15],"However":[16],"legacy":[18],"routing":[19,62,122,173],"algorithms":[20],"(e.g.":[21],"Dijkstra)":[22],"could":[23],"not":[24,119],"seize":[25],"congestion":[27],"determined":[28],"by":[29,57],"other":[31],"event":[32],"except":[33,105],"link":[34],"failure":[35],"and/or":[36],"Layer":[37],"2":[38],"technology":[39],"changes.":[40],"Instead":[41],"a":[43,58,67,82,87,127,138],"sophisticated":[44],"mechanism":[45,102],"we":[46],"select":[47],"most":[49],"competitive":[50],"path":[51,84,108],"determination":[52],"solution":[53,174],"be":[55,96],"used":[56],"generic":[59],"link-state":[60],"based":[61],"protocol,":[63],"operating":[64],"similar":[65],"gearbox":[68],"system.":[69],"We":[70],"suppose":[71],"Service":[73],"Providers":[74,100],"work":[75],"with":[76,155],"Modified":[78],"Dijkstra's":[79],"algorithm":[80,157],"single":[83,107],"routing.":[85],"Whenever":[86],"multi-path":[88],"delivery":[89],"is":[90,103,165,175],"needed,":[91],"Ford-Fulkerson":[93],"scheme":[94],"might":[95],"considered.":[97],"For":[98],"Infrastructure":[99],"similar,":[104],"approach,":[109],"involving":[110],"this":[111,134,151],"time":[112],"Floyd-Warshall":[114],"algorithm.":[115],"This":[116],"paper":[117],"does":[118],"cover":[120],"protocol":[123],"implementation,":[124],"being":[125],"rather":[126],"case":[128],"study.":[129],"The":[130,148,163],"major":[131],"achievement":[132],"proposal":[135],"refers":[136],"more":[139],"efficient":[140],"use":[141],"resources":[143],"(i.e.":[144],"Available":[145],"Transfer":[146],"Rate).":[147],"feasibility":[149],"idea":[152],"was":[153],"demonstrated":[154],"per":[156],"OMNET++":[158],"simulations":[159],"on":[160],"eight-node":[161],"topology.":[162],"scalability":[164],"limited":[166],"an":[168],"autonomous":[169],"system":[170],"and":[171],"inter-domain":[172],"further":[177],"work.":[178]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}