{"id":"https://openalex.org/W2111060285","doi":"https://doi.org/10.1109/iscc.2003.1214151","title":"Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies","display_name":"Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2111060285","doi":"https://doi.org/10.1109/iscc.2003.1214151","mag":"2111060285"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2003.1214151","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doras.dcu.ie/15506/1/collier7.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":0.2491,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.66525578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2676","issue":null,"first_page":"392","last_page":"398"},"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.9997000098228455,"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.9991999864578247,"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.8573180437088013},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6775763034820557},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6756755709648132},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.632615327835083},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5763668417930603},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5652467012405396},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5139893889427185},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4850163161754608},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.48432886600494385},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.44862276315689087},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.41371169686317444},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.38258421421051025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8573180437088013},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6775763034820557},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6756755709648132},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.632615327835083},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5763668417930603},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5652467012405396},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5139893889427185},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4850163161754608},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.48432886600494385},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.44862276315689087},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.41371169686317444},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.38258421421051025},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"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/iscc.2003.1214151","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},{"id":"pmh:oai:doras.dcu.ie:15506","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/42296/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15506/","pdf_url":"https://doras.dcu.ie/15506/1/collier7.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) Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies.  In: ISCC 2003 - 8th IEEE Symposium on Computers and Communications, 30 June-3 July 2003, Antalya, Turkey.  ISBN 0-7695-1961-X","raw_type":"Other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.7484","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.7484","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-CAR.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:http://www.rian.ie/42296/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15506/","pdf_url":"https://doras.dcu.ie/15506/1/collier7.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) Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies.  In: ISCC 2003 - 8th IEEE Symposium on Computers and Communications, 30 June-3 July 2003, Antalya, Turkey.  ISBN 0-7695-1961-X","raw_type":"Other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2111060285.pdf","grobid_xml":"https://content.openalex.org/works/W2111060285.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1586900838","https://openalex.org/W1602541202","https://openalex.org/W1795664639","https://openalex.org/W1917151598","https://openalex.org/W2000109702","https://openalex.org/W2032653899","https://openalex.org/W2075552181","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/W2155659292","https://openalex.org/W2243986870","https://openalex.org/W2613173048","https://openalex.org/W6635066063","https://openalex.org/W6650346765","https://openalex.org/W6677240351","https://openalex.org/W6690488776"],"related_works":["https://openalex.org/W757657516","https://openalex.org/W2539097916","https://openalex.org/W4377970799","https://openalex.org/W2944616377","https://openalex.org/W2918996422","https://openalex.org/W3127002380","https://openalex.org/W2889464401","https://openalex.org/W2251995179","https://openalex.org/W2556128816","https://openalex.org/W2351878639"],"abstract_inverted_index":{"Multimedia":[0],"traffic":[1],"and":[2,32,107],"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],"the":[15,43,92,124],"Internet.":[16],"These":[17],"difficulties":[18],"be":[20],"overcome":[21],"which":[24,63,69,86,102,115],"feature":[25],"dynamically":[26],"set":[27],"up":[28],"paths":[29,41],"with":[30],"bandwidth":[31],"delay":[33],"guarantees.":[34],"The":[35],"problem":[36],"of":[37,45,47,56,87,126],"selecting":[38],"constrained":[40],"is":[42,80],"task":[44],"service":[48],"(QoS)":[49],"routing.":[50],"Researchers":[51],"have":[52,75],"proposed":[53],"several":[54],"ways":[55],"implementing":[57],"QoS":[58],"routing,":[59],"preferring":[60],"either":[61],"mechanisms":[62],"distribute":[64],"network":[65,78,127],"load":[66,105],"or":[67],"algorithms":[68],"conserve":[70],"resources.":[71],"Our":[72,129],"previous":[73],"studies":[74],"shown":[76],"that":[77,132],"connectivity":[79],"an":[81,100],"important":[82],"factor":[83],"when":[84],"deciding":[85],"these":[88,118],"two":[89,119],"approaches":[90],"gives":[91],"best":[93],"performance.":[94],"In":[95],"this":[96,133],"paper":[97],"we":[98],"propose":[99],"algorithm,":[101],"features":[103],"both":[104],"distribution":[106],"resource":[108],"conservation.":[109],"It":[110],"takes":[111],"a":[112,139],"hybrid":[113],"approach":[114],"balances":[116],"between":[117],"extreme":[120],"approaches,":[121],"according":[122],"to":[123],"level":[125],"connectivity.":[128],"simulations":[130],"indicate":[131],"algorithm":[134],"offers":[135],"excellent":[136],"performance":[137],"over":[138],"than":[140],"existing":[141],"algorithms.":[142]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}