{"id":"https://openalex.org/W4285044125","doi":"https://doi.org/10.1109/lanman54755.2022.9820398","title":"THORP: Choosing Ordered Neighbors To Attain Efficient Loop-Free Minimum-Hop Routing","display_name":"THORP: Choosing Ordered Neighbors To Attain Efficient Loop-Free Minimum-Hop Routing","publication_year":2022,"publication_date":"2022-07-11","ids":{"openalex":"https://openalex.org/W4285044125","doi":"https://doi.org/10.1109/lanman54755.2022.9820398"},"language":"en","primary_location":{"id":"doi:10.1109/lanman54755.2022.9820398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman54755.2022.9820398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt427547dg/qt427547dg.pdf?t=req4jg","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J.J. Garcia-Luna-Aceves","raw_affiliation_strings":["University of California, Santa Cruz,Computer Science and Engineering Department,Santa Cruz,CA,USA","Computer Science and Engineering Department, University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz,Computer Science and Engineering Department,Santa Cruz,CA,USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Computer Science and Engineering Department, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065935907"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.1427,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47509161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9983000159263611,"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/hop","display_name":"Hop (telecommunications)","score":0.7064630389213562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6262322068214417},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.5932217836380005},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5407692193984985},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.4854477047920227},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4599967896938324},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4432264268398285},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43482428789138794},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4192018508911133},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.35796457529067993},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.35758572816848755},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3454086184501648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32122522592544556},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3108132779598236},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22633612155914307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08739319443702698}],"concepts":[{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.7064630389213562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6262322068214417},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.5932217836380005},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5407692193984985},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.4854477047920227},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4599967896938324},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4432264268398285},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43482428789138794},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4192018508911133},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35796457529067993},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.35758572816848755},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3454086184501648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32122522592544556},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3108132779598236},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22633612155914307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08739319443702698}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lanman54755.2022.9820398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman54755.2022.9820398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt427547dg","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/427547dg","pdf_url":"https://escholarship.org/content/qt427547dg/qt427547dg.pdf?t=req4jg","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"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":{"id":"pmh:oai:escholarship.org:ark:/13030/qt427547dg","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/427547dg","pdf_url":"https://escholarship.org/content/qt427547dg/qt427547dg.pdf?t=req4jg","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285044125.pdf","grobid_xml":"https://content.openalex.org/works/W4285044125.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1557978627","https://openalex.org/W1597295510","https://openalex.org/W1620856823","https://openalex.org/W1728701145","https://openalex.org/W1914254714","https://openalex.org/W1969057198","https://openalex.org/W1971663816","https://openalex.org/W2033347526","https://openalex.org/W2120450054","https://openalex.org/W2133723319","https://openalex.org/W2138760535","https://openalex.org/W2157457404","https://openalex.org/W2237196758","https://openalex.org/W2249711818","https://openalex.org/W2298498790","https://openalex.org/W2325877089","https://openalex.org/W4247255165","https://openalex.org/W4298174748","https://openalex.org/W6691700171"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W4385819622","https://openalex.org/W2031792015","https://openalex.org/W2347665962","https://openalex.org/W2564595897","https://openalex.org/W3135534252","https://openalex.org/W2579315322","https://openalex.org/W2246113009","https://openalex.org/W3120299446"],"abstract_inverted_index":{"We":[0],"introduce":[1],"THORP":[2,27,64],"(Totally":[3],"Hop-Ordered":[4],"Routing":[5],"Procedure),":[6],"a":[7,76],"simple":[8],"distributed":[9],"algorithm":[10,95],"for":[11],"minimum-hop":[12,62,73],"routing":[13,24],"that":[14,44,96],"works":[15],"in":[16,101],"much":[17],"the":[18,84,91],"same":[19],"way":[20],"as":[21,35],"traditional":[22],"distance-vector":[23],"algorithms":[25],"do.":[26],"eliminates":[28],"routing-table":[29],"loops":[30],"by":[31],"having":[32],"routers":[33,43,57],"choose":[34],"their":[36,50,55],"next":[37],"hops":[38],"to":[39,58,61,67,70,72,80],"destinations":[40],"those":[41],"neighbor":[42],"are":[45],"totally":[46],"ordered":[47],"based":[48],"on":[49],"current":[51],"distances,":[52],"without":[53],"requiring":[54],"next-hop":[56],"correspond":[59],"necessarily":[60],"paths.":[63],"is":[65,90,104],"shown":[66],"be":[68,81],"loop-free,":[69],"converge":[71],"distances":[74],"within":[75],"finite":[77],"time,":[78],"and":[79,103],"faster":[82],"than":[83],"Diffusing":[85],"Update":[86],"Algorithm":[87],"(DUAL),":[88],"which":[89],"only":[92],"loop-free":[93],"shortest-path":[94],"has":[97],"been":[98],"used":[99],"successfully":[100],"practice":[102],"part":[105],"of":[106],"Cisco\u2019s":[107],"EIGRP.":[108]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}