{"id":"https://openalex.org/W2134593611","doi":"https://doi.org/10.1109/glocom.2009.5425313","title":"Novel Topological Framework for Adaptive Routing","display_name":"Novel Topological Framework for Adaptive Routing","publication_year":2009,"publication_date":"2009-11-01","ids":{"openalex":"https://openalex.org/W2134593611","doi":"https://doi.org/10.1109/glocom.2009.5425313","mag":"2134593611"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2009.5425313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2009.5425313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","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/A5002750515","display_name":"A. S. Stepanenko","orcid":null},"institutions":[{"id":"https://openalex.org/I169199633","display_name":"Aston University","ror":"https://ror.org/05j0ve876","country_code":"GB","type":"education","lineage":["https://openalex.org/I169199633"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alexander Stepanenko","raw_affiliation_strings":["School of Engineering and Applied Sciences, Aston University, Birmingham, UK","Aston University, Aston Triangle, Birmingham, UK"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Aston University, Birmingham, UK","institution_ids":["https://openalex.org/I169199633"]},{"raw_affiliation_string":"Aston University, Aston Triangle, Birmingham, UK","institution_ids":["https://openalex.org/I169199633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061988303","display_name":"Costas Constantinou","orcid":"https://orcid.org/0000-0002-9484-6474"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Costas Constantinou","raw_affiliation_strings":["School of Electronic, Electrical and Computer Engineering, University of Binningham, Birmingham, UK","University of Birmingham, Edgbaston, Birmingham, UK;"],"affiliations":[{"raw_affiliation_string":"School of Electronic, Electrical and Computer Engineering, University of Binningham, Birmingham, UK","institution_ids":[]},{"raw_affiliation_string":"University of Birmingham, Edgbaston, Birmingham, UK;","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002750515"],"corresponding_institution_ids":["https://openalex.org/I169199633"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66716204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9977999925613403,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9977999925613403,"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.9973999857902527,"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.9965999722480774,"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.802699089050293},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.661259651184082},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6501989960670471},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6314291954040527},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6019121408462524},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5844244956970215},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.569499135017395},{"id":"https://openalex.org/keywords/interior-gateway-protocol","display_name":"Interior gateway protocol","score":0.5522361993789673},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5191047191619873},{"id":"https://openalex.org/keywords/routing-domain","display_name":"Routing domain","score":0.5144281983375549},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.5049968361854553},{"id":"https://openalex.org/keywords/enhanced-interior-gateway-routing-protocol","display_name":"Enhanced Interior Gateway Routing Protocol","score":0.4821707606315613},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4814583361148834},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.4465555250644684},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3034612536430359}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.802699089050293},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.661259651184082},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6501989960670471},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6314291954040527},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6019121408462524},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5844244956970215},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.569499135017395},{"id":"https://openalex.org/C52837422","wikidata":"https://www.wikidata.org/wiki/Q431028","display_name":"Interior gateway protocol","level":5,"score":0.5522361993789673},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5191047191619873},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.5144281983375549},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.5049968361854553},{"id":"https://openalex.org/C87044965","wikidata":"https://www.wikidata.org/wiki/Q1091139","display_name":"Enhanced Interior Gateway Routing Protocol","level":5,"score":0.4821707606315613},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4814583361148834},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.4465555250644684},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3034612536430359}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/glocom.2009.5425313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2009.5425313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/4c50655f-6e40-46b9-8dd3-a673bf627ea9","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/novel-topological-framework-for-adaptiverouting(4c50655f-6e40-46b9-8dd3-a673bf627ea9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stepanenko , A & Constantinou , C 2008 , ' Novel Topological Framework for AdaptiveRouting ' , Paper presented at Proceedings of 3rd International Conference on the Latest Advances in Networks , 1/01/08 .","raw_type":"conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/a45f9582-2242-4209-ae70-9019a5d4f067","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/novel-topological-framework-for-adaptive-routing(a45f9582-2242-4209-ae70-9019a5d4f067).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stepanenko , A & Constantinou , C 2009 , ' Novel Topological Framework for Adaptive Routing ' , Paper presented at IEEE Global Communications Conference (GLOBECOM 2009) , 1/12/09 .","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W62072953","https://openalex.org/W1966878439","https://openalex.org/W2028895534","https://openalex.org/W2088632464","https://openalex.org/W2104534750","https://openalex.org/W2114234222","https://openalex.org/W2126496074","https://openalex.org/W2131754091","https://openalex.org/W2135810626","https://openalex.org/W2168637639","https://openalex.org/W2215798487","https://openalex.org/W2591621738","https://openalex.org/W3103987592","https://openalex.org/W6602465000","https://openalex.org/W6635204323","https://openalex.org/W6979908527"],"related_works":["https://openalex.org/W2537880892","https://openalex.org/W1616997497","https://openalex.org/W3217697430","https://openalex.org/W2220567392","https://openalex.org/W3134602991","https://openalex.org/W2096480024","https://openalex.org/W2461681138","https://openalex.org/W4390546506","https://openalex.org/W2218255545","https://openalex.org/W4322624389"],"abstract_inverted_index":{"We":[0,53],"identify":[1],"that":[2,59,125],"a":[3,33,36,55,61,135,149],"major":[4],"contributing":[5],"factor":[6],"to":[7,21,92],"the":[8,28,77,84,156,160],"shortcomings":[9],"of":[10,18,39,64,83,133,159],"current":[11],"routing":[12,25,50,57,122,144],"protocols":[13,26,145],"is":[14,114,137],"their":[15],"mathematical":[16],"treatment":[17],"graphs":[19],"used":[20],"represent":[22],"networks.":[23],"Typically,":[24],"decimate":[27],"rich":[29,87],"connectivity":[30],"present":[31],"in":[32],"network":[34,111,151],"into":[35,49],"small":[37],"number":[38],"distinct":[40],"trees":[41],"for":[42,148],"every":[43],"source,":[44],"which":[45],"are":[46,95],"then":[47],"translated":[48],"table":[51],"entries.":[52],"propose":[54],"new":[56],"paradigm":[58],"introduces":[60],"novel":[62],"concept":[63],"neighbourhood,":[65],"embodying":[66],"path":[67,89,101],"diversity.":[68,90],"This":[69],"framework":[70],"summarises":[71],"rather":[72],"than":[73],"decimates":[74],"paths":[75],"throughout":[76],"network,":[78],"preserving":[79],"and":[80,99,106,142],"exploiting":[81],"all":[82],"network's":[85],"potentially":[86],"intrinsic":[88],"Central":[91],"our":[93],"abstraction":[94,112],"two":[96],"intimately":[97],"connected":[98],"complementary":[100],"diversity":[102],"units:":[103],"simple":[104,131],"cycles,":[105],"cycle":[107],"adjacencies.":[108],"A":[109,130],"recursive":[110,121],"procedure":[113],"presented,":[115],"together":[116],"with":[117,152],"an":[118],"associated":[119],"generic":[120],"protocol":[123,136],"family":[124],"offers":[126],"many":[127],"desirable":[128],"features.":[129],"instance":[132],"such":[134],"compared":[138],"against":[139],"existing":[140],"wired":[141],"wireless":[143],"through":[146],"simulations":[147],"highly-stressed":[150],"unstable":[153],"links,":[154],"illustrating":[155],"potential":[157],"advantages":[158],"proposed":[161],"approach.":[162]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
