{"id":"https://openalex.org/W2133721813","doi":"https://doi.org/10.1109/ispan.2004.1300531","title":"Unicast routing algorithm with multiple quality-of-service parameters","display_name":"Unicast routing algorithm with multiple quality-of-service parameters","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2133721813","doi":"https://doi.org/10.1109/ispan.2004.1300531","mag":"2133721813"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2004.1300531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","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/A5112777021","display_name":"A. K. Daniel K.","orcid":null},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"A. Koundinya K","raw_affiliation_strings":["DCIS, University of Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"DCIS, University of Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070889481","display_name":"Atul Negi","orcid":"https://orcid.org/0000-0001-5707-130X"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Negi","raw_affiliation_strings":["DCIS, University of Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"DCIS, University of Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074528054","display_name":"V. N. Sastry","orcid":null},"institutions":[{"id":"https://openalex.org/I150312865","display_name":"Institute for Development and Research in Banking Technology","ror":"https://ror.org/00ta0g865","country_code":"IN","type":"government","lineage":["https://openalex.org/I150312865"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V.N. Sastry","raw_affiliation_strings":["IDRBT, India"],"affiliations":[{"raw_affiliation_string":"IDRBT, India","institution_ids":["https://openalex.org/I150312865"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112777021"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":null,"apc_paid":null,"fwci":0.2318,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64848841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":null,"first_page":"520","last_page":"525"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9980999827384949,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7951479554176331},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.7880722284317017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7723387479782104},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.664611279964447},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5818760395050049},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5343536138534546},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5146356821060181},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4943244457244873},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4805482029914856},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4634546935558319},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4571085572242737},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4463302195072174},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4239349365234375},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.41831445693969727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41713282465934753},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37725722789764404},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.32815781235694885},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20464518666267395},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.1259596049785614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12141886353492737},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08680811524391174}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7951479554176331},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7880722284317017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7723387479782104},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.664611279964447},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5818760395050049},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5343536138534546},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5146356821060181},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4943244457244873},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4805482029914856},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4634546935558319},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4571085572242737},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4463302195072174},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4239349365234375},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.41831445693969727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41713282465934753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37725722789764404},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.32815781235694885},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20464518666267395},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.1259596049785614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12141886353492737},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08680811524391174},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispan.2004.1300531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1493713932","https://openalex.org/W2096774592","https://openalex.org/W2151246443","https://openalex.org/W2151688044","https://openalex.org/W2169528473","https://openalex.org/W2170358592","https://openalex.org/W6682131790","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W2152381136","https://openalex.org/W2322343330","https://openalex.org/W146128134","https://openalex.org/W2001312276","https://openalex.org/W2188031262","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W2615810221","https://openalex.org/W2351097701","https://openalex.org/W2769345041"],"abstract_inverted_index":{"Quality":[0],"of":[1],"service":[2,8],"(QoS)":[3],"is":[4,73],"an":[5,46,61],"important":[6],"network":[7],"requirement":[9],"to":[10,51,59,65,77],"support":[11,35],"various":[12],"real":[13],"time":[14],"applications":[15,31],"such":[16],"as":[17],"video":[18],"on":[19],"demand,":[20],"remote-meeting":[21],"systems,":[22],"etc.":[23],"While":[24],"QoS":[25,34],"parameters":[26],"are":[27],"specified":[28],"by":[29],"the":[30,52,66],"it":[32,93],"appears":[33],"at":[36],"routing":[37,49,58],"level":[38],"would":[39],"be":[40],"more":[41],"appropriate.":[42],"Here":[43],"we":[44,82],"consider":[45],"on-demand":[47],"source":[48],"modification":[50],"Dijkstra's":[53],"algorithm,":[54],"which":[55],"supports":[56],"multi-parameter":[57],"find":[60],"optimal":[62,90],"path":[63],"according":[64],"given":[67],"optimality":[68],"condition.":[69],"The":[70],"modified":[71],"algorithm":[72,86],"analyzed":[74],"with":[75],"respect":[76],"its":[78],"computational":[79],"requirements":[80],"and":[81],"prove":[83],"that":[84],"this":[85],"finds":[87],"a":[88],"loop-free":[89],"path,":[91],"if":[92],"exists.":[94]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}