{"id":"https://openalex.org/W2137714583","doi":"https://doi.org/10.1109/icccn.2011.6006055","title":"Using Dijkstra to Compute Hop-by-Hop QoS Paths","display_name":"Using Dijkstra to Compute Hop-by-Hop QoS Paths","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2137714583","doi":"https://doi.org/10.1109/icccn.2011.6006055","mag":"2137714583"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2011.6006055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5103541822","display_name":"Bradley R. Smith","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":"Bradley R. Smith","raw_affiliation_strings":["Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Comput. Eng. Dept., Univ. of California Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103541822"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":65},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9999,"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.9999,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9989,"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.9987,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6871033},{"id":"https://openalex.org/keywords/packet-forwarding","display_name":"Packet forwarding","score":0.6347136},{"id":"https://openalex.org/keywords/multi-hop-wireless-routing","display_name":"Multi-hop Wireless Routing","score":0.563944},{"id":"https://openalex.org/keywords/qos-routing","display_name":"QoS Routing","score":0.548764},{"id":"https://openalex.org/keywords/routing-protocols","display_name":"Routing Protocols","score":0.530759},{"id":"https://openalex.org/keywords/internet-topology","display_name":"Internet Topology","score":0.521121},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-Defined Networking","score":0.517806},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.49898005},{"id":"https://openalex.org/keywords/ip-forwarding","display_name":"IP forwarding","score":0.42830628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8352419},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7210664},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6871033},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6830969},{"id":"https://openalex.org/C120317029","wikidata":"https://www.wikidata.org/wiki/Q874048","display_name":"Packet forwarding","level":3,"score":0.6347136},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.6270948},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.59472847},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.588751},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.50650537},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.49898005},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46583763},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.45187634},{"id":"https://openalex.org/C174809319","wikidata":"https://www.wikidata.org/wiki/Q5973191","display_name":"IP forwarding","level":5,"score":0.42830628},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.40255702},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33815992},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16755372},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13561696},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.075957}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2011.6006055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.43}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":4,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W2096774592","https://openalex.org/W2137081436","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W4385819622","https://openalex.org/W3111233095","https://openalex.org/W2896613030","https://openalex.org/W2501800521","https://openalex.org/W2497028718","https://openalex.org/W2349715051","https://openalex.org/W2123812073","https://openalex.org/W2078987980","https://openalex.org/W2010600439","https://openalex.org/W1482650152"],"abstract_inverted_index":{"The":[0],"Internet":[1,23],"is":[2],"based":[3,13,113],"on":[4,14,114,141],"a":[5,15,64,94,146,180,197],"hop-by-hop":[6,81,106,151,192],"routing":[7,36,66],"model":[8],"where":[9],"forwarding":[10,82,127,193],"decisions":[11],"are":[12,73,175,187],"packet's":[16],"destination.":[17],"With":[18],"the":[19,22,34,46,84,167,203,208],"evolution":[20],"of":[21,50,58,166,205],"to":[24,41,178],"support":[25,42,80,191],"real-time":[26],"applications":[27],"such":[28],"as":[29,157,159],"video":[30],"and":[31,78,190],"audio":[32],"distribution,":[33],"Internet's":[35],"architecture":[37],"must":[38],"be":[39],"enhanced":[40],"metrics":[43],"that":[44,56,72,110,186],"ensure":[45,109],"quality-of-":[47],"service":[48],"requirements":[49,165],"these":[51,59,115],"applications.":[52],"Sobrinho":[53,91],"has":[54,92,162],"shown":[55],"some":[57],"metrics,":[60],"when":[61,194],"used":[62,195],"with":[63,196],"Dijkstra":[65,100,198],"computation,":[67,200],"may":[68],"result":[69],"in":[70,83,125],"paths":[71,98,116,131,185,209],"not":[74,103,156],"least-cost":[75,120],"or":[76],"loop-free,":[77,119,188],"don't":[79],"general":[85,158],"case.":[86],"To":[87],"address":[88],"this":[89,123,137,171],"problem":[90],"presented":[93],"technique":[95,182],"for":[96,149,183],"computing":[97,150,184],"using":[99],"that,":[101],"while":[102,155],"directly":[104],"supporting":[105],"forwarding,":[107],"do":[108],"packets":[111,128,212],"forwarded":[112],"will":[117],"follow":[118],"paths.":[121,152],"However,":[122],"results":[124],"routers":[126,206],"along":[129],"different":[130],"from":[132],"those":[133],"they":[134,210],"computed.":[135],"In":[136],"paper":[138],"we":[139,174],"build":[140],"Sobrinho's":[142,160],"work":[143],"by":[144],"presenting":[145],"sufficient":[147],"condition":[148],"This":[153],"condition,":[154],"solution,":[161],"more":[163],"relaxed":[164],"path":[168],"algebra.":[169],"Given":[170],"greater":[172],"latitude":[173],"then":[176],"able":[177],"present":[179],"new":[181],"least-cost,":[189],"route":[199],"thus":[201],"restoring":[202],"visibility":[204],"into":[207],"forward":[211],"over.":[213]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2137714583","counts_by_year":[],"updated_date":"2024-12-05T07:52:15.254770","created_date":"2016-06-24"}