{"id":"https://openalex.org/W2126390168","doi":"https://doi.org/10.1109/icccn.2002.1043125","title":"An efficient path selection algorithm for on-demand link-state hop-by-hop routing","display_name":"An efficient path selection algorithm for on-demand link-state hop-by-hop routing","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2126390168","doi":"https://doi.org/10.1109/icccn.2002.1043125","mag":"2126390168"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2002.1043125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2002.1043125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","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/A5068612592","display_name":"Soumya Roy","orcid":null},"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":"S. Roy","raw_affiliation_strings":["Computer Engineering Department, University of California, Santa Cruz, CA, USA","Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","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":false,"raw_author_name":"J.J. Garcia-Luna-Aceves","raw_affiliation_strings":["Computer Engineering Department, University of California, Santa Cruz, CA, USA","Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068612592"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.496,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74029942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"561","last_page":"564"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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/T11158","display_name":"Wireless Networks and Protocols","score":0.9987999796867371,"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.7389600276947021},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6936064958572388},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.6792181730270386},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6185779571533203},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.618172824382782},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.595999002456665},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5948693752288818},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5888803601264954},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5147533416748047},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5102384090423584},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4761464595794678},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4665878415107727},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.463792622089386},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.46220090985298157},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.4491736590862274},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.42706602811813354},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4251651167869568},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.4176822304725647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39419981837272644},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.3499135971069336},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1620088517665863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07469668984413147}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389600276947021},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6936064958572388},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.6792181730270386},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6185779571533203},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.618172824382782},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.595999002456665},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5948693752288818},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5888803601264954},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5147533416748047},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5102384090423584},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4761464595794678},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4665878415107727},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.463792622089386},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.46220090985298157},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.4491736590862274},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.42706602811813354},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4251651167869568},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.4176822304725647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39419981837272644},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.3499135971069336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1620088517665863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07469668984413147},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icccn.2002.1043125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2002.1043125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","raw_type":"proceedings-article"},{"id":"pmh:ADA461324","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA461324","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.2559","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ucsc.edu/research/ccrg/publications/soumya.ic3n02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W59797447","https://openalex.org/W1498122251","https://openalex.org/W1537112912","https://openalex.org/W1726571582","https://openalex.org/W1768241861","https://openalex.org/W2096183418","https://openalex.org/W2099574482","https://openalex.org/W2135035173","https://openalex.org/W2157457404","https://openalex.org/W2965940991","https://openalex.org/W6602412010","https://openalex.org/W6629752705","https://openalex.org/W6637740498","https://openalex.org/W6683140140"],"related_works":["https://openalex.org/W2597144308","https://openalex.org/W2368964068","https://openalex.org/W2161960576","https://openalex.org/W2523719706","https://openalex.org/W2358094779","https://openalex.org/W4352982540","https://openalex.org/W2356132210","https://openalex.org/W2158422636","https://openalex.org/W1506649542","https://openalex.org/W2755818550"],"abstract_inverted_index":{"Traditional":[0],"routing":[1,49,122],"protocols":[2],"based":[3],"on":[4],"link-state":[5,15,48],"information":[6,16,24],"form":[7],"a":[8,34,68,71,75,88,105],"network":[9],"topology":[10,23],"through":[11,97],"the":[12,41,57,64,83,91,119],"exchange":[13],"of":[14],"by":[17,20],"flooding":[18],"or":[19,40],"reporting":[21],"partial":[22],"and":[25],"compute":[26],"shortest":[27,112,116],"routes":[28],"to":[29,55,59,90],"each":[30],"reachable":[31],"destination":[32],"using":[33],"path-selection":[35,107],"algorithm":[36,39,108],"like":[37],"Dijkstra's":[38],"Bellman-Ford":[42],"algorithm.":[43],"However,":[44],"in":[45,63],"an":[46],"on-demand":[47,121],"protocol,":[50],"no":[51],"one":[52],"node":[53,62,69,99],"needs":[54],"know":[56],"paths":[58,117],"every":[60],"other":[61],"network.":[65],"Accordingly,":[66],"when":[67],"chooses":[70],"next":[72,84],"hop":[73,85],"for":[74],"given":[76],"destination,":[77],"it":[78],"must":[79],"be":[80,101],"true":[81],"that":[82,98,109],"has":[86],"reported":[87],"path":[89,113],"same":[92],"destination;":[93],"otherwise,":[94],"packets":[95],"sent":[96],"would":[100],"dropped.":[102],"We":[103],"present":[104],"new":[106],"unlike":[110],"traditional":[111],"algorithms,":[114],"computes":[115],"with":[118],"above":[120],"constraint.":[123]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}