{"id":"https://openalex.org/W1917151598","doi":"https://doi.org/10.1109/icc.2003.1204172","title":"Should QoS routing algorithms prefer shortest paths?","display_name":"Should QoS routing algorithms prefer shortest paths?","publication_year":2004,"publication_date":"2004-03-23","ids":{"openalex":"https://openalex.org/W1917151598","doi":"https://doi.org/10.1109/icc.2003.1204172","mag":"1917151598"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2003.1204172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doras.dcu.ie/15507/1/collier8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109068661","display_name":"K. Kowalik","orcid":null},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]},{"id":"https://openalex.org/I42934936","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81","country_code":"IE","type":"education","lineage":["https://openalex.org/I42934936"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"K. Kowalik","raw_affiliation_strings":["Research Institute for Networks and Communications Engineering, University of Dublin, Dublin, Ireland","Res. Inst. for Networks & Commun. Eng., Dublin City Univ., Ireland"],"affiliations":[{"raw_affiliation_string":"Research Institute for Networks and Communications Engineering, University of Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I42934936","https://openalex.org/I205274468"]},{"raw_affiliation_string":"Res. Inst. for Networks & Commun. Eng., Dublin City Univ., Ireland","institution_ids":["https://openalex.org/I42934936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029543164","display_name":"Martin Collier","orcid":"https://orcid.org/0000-0002-6410-3899"},"institutions":[{"id":"https://openalex.org/I42934936","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81","country_code":"IE","type":"education","lineage":["https://openalex.org/I42934936"]},{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"M. Collier","raw_affiliation_strings":["Research Institute for Networks and Communications Engineering, University of Dublin, Dublin, Ireland","Res. Inst. for Networks & Commun. Eng., Dublin City Univ., Ireland"],"affiliations":[{"raw_affiliation_string":"Research Institute for Networks and Communications Engineering, University of Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I42934936","https://openalex.org/I205274468"]},{"raw_affiliation_string":"Res. Inst. for Networks & Commun. Eng., Dublin City Univ., Ireland","institution_ids":["https://openalex.org/I42934936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109068661"],"corresponding_institution_ids":["https://openalex.org/I205274468","https://openalex.org/I42934936"],"apc_list":null,"apc_paid":null,"fwci":4.4832,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.94860942,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"213","last_page":"217"},"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.9995999932289124,"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/T10714","display_name":"Software-Defined Networks and 5G","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.795759916305542},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6901857852935791},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6820862889289856},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6318022012710571},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6038921475410461},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.587681770324707},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.574826717376709},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5671038031578064},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5154901146888733},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.507408082485199},{"id":"https://openalex.org/keywords/metrics","display_name":"Metrics","score":0.5006444454193115},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.46117767691612244},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4315158724784851},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4217434525489807},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3548211455345154}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.795759916305542},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6901857852935791},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6820862889289856},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6318022012710571},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6038921475410461},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.587681770324707},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.574826717376709},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5671038031578064},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5154901146888733},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.507408082485199},{"id":"https://openalex.org/C195780805","wikidata":"https://www.wikidata.org/wiki/Q1535986","display_name":"Metrics","level":5,"score":0.5006444454193115},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.46117767691612244},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4315158724784851},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4217434525489807},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3548211455345154},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icc.2003.1204172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:doras.dcu.ie:15507","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401511","display_name":"Dublin City University Open Access Institutional Repository (Dublin City University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I42934936","host_organization_name":"Dublin City University","host_organization_lineage":["https://openalex.org/I42934936"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:http://www.rian.ie/42299/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15507/","pdf_url":"https://doras.dcu.ie/15507/1/collier8.pdf","source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kowalik, Karol and Collier, Martin  (2003) Should QoS routing algorithms prefer shortest paths?  In: ICC 2003 - IEEE International Conference on Communications, 11-15 May 2003, Anchorage, Alaska, USA.  ISBN 0-7803-7802-4","raw_type":"Other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.2368","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.2368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eeng.dcu.ie/~bssl/papers/kowalik-shortest.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:http://www.rian.ie/42299/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15507/","pdf_url":"https://doras.dcu.ie/15507/1/collier8.pdf","source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kowalik, Karol and Collier, Martin  (2003) Should QoS routing algorithms prefer shortest paths?  In: ICC 2003 - IEEE International Conference on Communications, 11-15 May 2003, Anchorage, Alaska, USA.  ISBN 0-7803-7802-4","raw_type":"Other"},"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1917151598.pdf"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1586900838","https://openalex.org/W1602541202","https://openalex.org/W1731982387","https://openalex.org/W1795664639","https://openalex.org/W1977867261","https://openalex.org/W2000109702","https://openalex.org/W2026803050","https://openalex.org/W2032653899","https://openalex.org/W2075552181","https://openalex.org/W2096655151","https://openalex.org/W2100830208","https://openalex.org/W2111010037","https://openalex.org/W2112169033","https://openalex.org/W2114525688","https://openalex.org/W2122519341","https://openalex.org/W2139739478","https://openalex.org/W2156916299","https://openalex.org/W2243986870","https://openalex.org/W3014841294","https://openalex.org/W4253826867","https://openalex.org/W6635066063","https://openalex.org/W6637592115","https://openalex.org/W6650346765","https://openalex.org/W6677240351","https://openalex.org/W6690488776","https://openalex.org/W6695296356"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W3125210154","https://openalex.org/W2351878639","https://openalex.org/W3046124320","https://openalex.org/W2607223747"],"abstract_inverted_index":{"Multimedia":[0],"traffic":[1],"and":[2,32,56],"real-time":[3],"e-commerce":[4],"applications":[5],"can":[6,19],"experience":[7],"quality":[8,46],"degradation":[9],"in":[10,22],"traditional":[11],"networks":[12,23],"such":[13,39],"as":[14,92,105],"the":[15,43,57,74,119,138,150],"Internet.":[16],"These":[17],"difficulties":[18],"be":[20],"overcome":[21],"which":[24,114],"feature":[25],"dynamically":[26],"set":[27,156],"up":[28],"paths":[29,41],"with":[30],"bandwidth":[31],"delay":[33],"guarantees.":[34],"The":[35],"problem":[36],"of":[37,45,47,59,71,76,115,140,152,157],"selecting":[38],"constrained":[40],"is":[42,80,126],"task":[44],"service":[48],"(QoS)":[49],"routing.":[50,66],"This":[51,111],"paper":[52,112],"considers":[53],"link-state":[54],"routing,":[55],"choice":[58,75],"cost":[60],"metric":[61],"used":[62],"to":[63,93,106,131],"implement":[64],"QoS":[65,84],"There":[67],"are":[68],"two":[69],"schools":[70],"thought":[72],"regarding":[73],"link":[77],"cost.":[78],"It":[79],"commonly":[81],"assumed":[82],"that":[83,124],"routing":[85,145],"algorithms":[86],"should":[87],"limit":[88],"hop":[89],"count":[90],"so":[91,104],"conserve":[94],"resources":[95],"for":[96],"future":[97],"connections.":[98],"Others":[99],"advocate":[100],"load":[101],"balancing":[102],"mechanisms":[103],"increase":[107],"overall":[108],"network":[109,158],"utilisation.":[110],"investigates":[113],"these":[116],"approaches":[117],"gives":[118],"better":[120],"performance.":[121],"We":[122,134],"show":[123],"there":[125],"no":[127],"one":[128],"general":[129,142],"answer":[130],"this":[132],"question.":[133],"also":[135],"point":[136],"out":[137],"dangers":[139],"drawing":[141],"conclusions":[143],"about":[144],"algorithm":[146],"performance":[147],"based":[148],"on":[149],"study":[151],"only":[153],"a":[154],"limited":[155],"topologies.":[159]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}