{"id":"https://openalex.org/W2015209296","doi":"https://doi.org/10.1109/iscc.2014.6912454","title":"Loop detection and automated route aggregation in distance vector routing","display_name":"Loop detection and automated route aggregation in distance vector routing","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2015209296","doi":"https://doi.org/10.1109/iscc.2014.6912454","mag":"2015209296"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2014.6912454","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2014.6912454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computers and Communications (ISCC)","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/A5042270320","display_name":"Frank Bohdanowicz","orcid":null},"institutions":[{"id":"https://openalex.org/I16264642","display_name":"Koblenz University of Applied Sciences","ror":"https://ror.org/04j351e79","country_code":"DE","type":"education","lineage":["https://openalex.org/I16264642"]},{"id":"https://openalex.org/I4387153937","display_name":"Universit\u00e4t Koblenz","ror":"https://ror.org/0433e6t24","country_code":null,"type":"education","lineage":["https://openalex.org/I4387153937"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Bohdanowicz","raw_affiliation_strings":["University of Koblenz, Germany"],"affiliations":[{"raw_affiliation_string":"University of Koblenz, Germany","institution_ids":["https://openalex.org/I16264642","https://openalex.org/I4387153937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022058820","display_name":"Markus Henke","orcid":"https://orcid.org/0000-0002-1544-6123"},"institutions":[{"id":"https://openalex.org/I16264642","display_name":"Koblenz University of Applied Sciences","ror":"https://ror.org/04j351e79","country_code":"DE","type":"education","lineage":["https://openalex.org/I16264642"]},{"id":"https://openalex.org/I4387153937","display_name":"Universit\u00e4t Koblenz","ror":"https://ror.org/0433e6t24","country_code":null,"type":"education","lineage":["https://openalex.org/I4387153937"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Henke","raw_affiliation_strings":["University of Koblenz, Germany"],"affiliations":[{"raw_affiliation_string":"University of Koblenz, Germany","institution_ids":["https://openalex.org/I16264642","https://openalex.org/I4387153937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042270320"],"corresponding_institution_ids":["https://openalex.org/I16264642","https://openalex.org/I4387153937"],"apc_list":null,"apc_paid":null,"fwci":0.9194,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74516587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"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/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8264590501785278},{"id":"https://openalex.org/keywords/virtual-routing-and-forwarding","display_name":"Virtual routing and forwarding","score":0.7394165396690369},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6872090697288513},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5728058815002441},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5608521699905396},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5566565990447998},{"id":"https://openalex.org/keywords/ip-forwarding","display_name":"IP forwarding","score":0.5353147983551025},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.5295653939247131},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5114232897758484},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.5093816518783569},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.48554345965385437},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.47644761204719543},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46974876523017883},{"id":"https://openalex.org/keywords/enhanced-interior-gateway-routing-protocol","display_name":"Enhanced Interior Gateway Routing Protocol","score":0.4581091105937958},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4138544201850891},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.35795581340789795}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8264590501785278},{"id":"https://openalex.org/C157626507","wikidata":"https://www.wikidata.org/wiki/Q7935037","display_name":"Virtual routing and forwarding","level":5,"score":0.7394165396690369},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6872090697288513},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5728058815002441},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5608521699905396},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5566565990447998},{"id":"https://openalex.org/C174809319","wikidata":"https://www.wikidata.org/wiki/Q5973191","display_name":"IP forwarding","level":5,"score":0.5353147983551025},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.5295653939247131},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5114232897758484},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.5093816518783569},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.48554345965385437},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.47644761204719543},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46974876523017883},{"id":"https://openalex.org/C87044965","wikidata":"https://www.wikidata.org/wiki/Q1091139","display_name":"Enhanced Interior Gateway Routing Protocol","level":5,"score":0.4581091105937958},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4138544201850891},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.35795581340789795},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2014.6912454","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2014.6912454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W82717862","https://openalex.org/W1675699606","https://openalex.org/W1977543579","https://openalex.org/W2011440271","https://openalex.org/W2064595734","https://openalex.org/W2106404099","https://openalex.org/W2108712752","https://openalex.org/W2109403421","https://openalex.org/W2115150885","https://openalex.org/W2118172426","https://openalex.org/W2124651399","https://openalex.org/W2132127273","https://openalex.org/W2138760535","https://openalex.org/W2145721479","https://openalex.org/W2157422153","https://openalex.org/W2248064281","https://openalex.org/W2298498790","https://openalex.org/W4249186852","https://openalex.org/W4300490703","https://openalex.org/W6640380507","https://openalex.org/W6691190440","https://openalex.org/W6697236513"],"related_works":["https://openalex.org/W1533805642","https://openalex.org/W2118395071","https://openalex.org/W1964890720","https://openalex.org/W2783496005","https://openalex.org/W1964317229","https://openalex.org/W2103355668","https://openalex.org/W87393373","https://openalex.org/W3007708020","https://openalex.org/W3011498814","https://openalex.org/W2015209296"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,72],"distance":[4],"vector":[5],"routing":[6,25,67,86],"algorithm":[7],"for":[8,117],"IP":[9,47,53],"computer":[10,102],"networks":[11],"is":[12,15,34],"presented":[13],"which":[14,90],"able":[16],"to":[17,43],"aggregate":[18],"routes":[19,42],"automatically":[20],"and":[21,23,68,87,96,126],"detect":[22],"prevent":[24],"loops":[26],"even":[27],"on":[28,109],"the":[29,35,44,64,94,100,118],"aggregated":[30],"routes.":[31],"Route":[32],"aggregation":[33,80,122],"method":[36],"of":[37,66,99,120],"summarizing":[38],"two":[39],"or":[40],"more":[41],"corresponding":[45],"destination":[46],"subnetwork":[48],"addresses":[49],"into":[50],"one":[51],"common":[52],"prefix":[54],"address.":[55],"Thus,":[56],"it":[57],"enables":[58],"non-hierarchical":[59],"network":[60,83],"scalability":[61],"by":[62],"keeping":[63],"volume":[65],"forwarding":[69,88,130],"information":[70],"within":[71],"reasonable":[73],"size.":[74],"Nevertheless,":[75],"under":[76],"certain":[77],"circumstances":[78],"route":[79,121],"can":[81,91],"cause":[82],"anomalies,":[84],"e.g.,":[85],"loops,":[89],"seriously":[92],"impact":[93],"performance":[95],"failure":[97],"safety":[98],"whole":[101],"network.":[103],"We":[104],"describe":[105],"an":[106],"approach":[107],"based":[108],"well-known":[110],"Routing":[111],"Information":[112],"Protocol":[113],"(RIPv2)":[114],"that":[115],"allows":[116],"automation":[119],"without":[123],"manual":[124],"intervention":[125],"still":[127],"ensures":[128],"loop-free":[129],"paths":[131],"and,":[132],"therefore,":[133],"short":[134],"convergence":[135],"times.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}