{"id":"https://openalex.org/W2128866116","doi":"https://doi.org/10.1109/icccn.2007.4317849","title":"On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing","display_name":"On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2128866116","doi":"https://doi.org/10.1109/icccn.2007.4317849","mag":"2128866116"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2007.4317849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th 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/A5005228383","display_name":"H. K. Dai","orcid":"https://orcid.org/0000-0003-4589-8400"},"institutions":[{"id":"https://openalex.org/I115475287","display_name":"Oklahoma State University","ror":"https://ror.org/01g9vbr38","country_code":"US","type":"education","lineage":["https://openalex.org/I115475287"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. K. Dai","raw_affiliation_strings":["Computer Science Department, Oklahoma State University, Stillwater, OK, USA","Oklahoma State University - Stillwater"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Oklahoma State University, Stillwater, OK, USA","institution_ids":["https://openalex.org/I115475287"]},{"raw_affiliation_string":"Oklahoma State University - Stillwater","institution_ids":["https://openalex.org/I115475287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006709853","display_name":"Yuanqi Du","orcid":"https://orcid.org/0000-0003-2988-0374"},"institutions":[{"id":"https://openalex.org/I115475287","display_name":"Oklahoma State University","ror":"https://ror.org/01g9vbr38","country_code":"US","type":"education","lineage":["https://openalex.org/I115475287"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Du","raw_affiliation_strings":["Computer Science Department, Oklahoma State University, Stillwater, OK, USA","Oklahoma State University - Stillwater"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Oklahoma State University, Stillwater, OK, USA","institution_ids":["https://openalex.org/I115475287"]},{"raw_affiliation_string":"Oklahoma State University - Stillwater","institution_ids":["https://openalex.org/I115475287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005228383"],"corresponding_institution_ids":["https://openalex.org/I115475287"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16779694,"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":"384","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.9995999932289124,"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.7621074914932251},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6901140213012695},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6897198557853699},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.609307587146759},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6059440970420837},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5748280882835388},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5658941268920898},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5542687773704529},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5112276077270508},{"id":"https://openalex.org/keywords/elmore-delay","display_name":"Elmore delay","score":0.46456021070480347},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3595251142978668},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2227552831172943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20746517181396484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16430407762527466},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.13479870557785034}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7621074914932251},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6901140213012695},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6897198557853699},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.609307587146759},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6059440970420837},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5748280882835388},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5658941268920898},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5542687773704529},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5112276077270508},{"id":"https://openalex.org/C84434228","wikidata":"https://www.wikidata.org/wiki/Q4531332","display_name":"Elmore delay","level":4,"score":0.46456021070480347},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3595251142978668},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2227552831172943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20746517181396484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16430407762527466},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.13479870557785034},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C174086752","wikidata":"https://www.wikidata.org/wiki/Q5253471","display_name":"Delay calculation","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2007.4317849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W3976408","https://openalex.org/W1487374707","https://openalex.org/W1528496190","https://openalex.org/W1602423779","https://openalex.org/W1809132297","https://openalex.org/W1971834700","https://openalex.org/W2062939617","https://openalex.org/W2096774592","https://openalex.org/W2102056016","https://openalex.org/W2105808107","https://openalex.org/W2112169033","https://openalex.org/W2130626677","https://openalex.org/W2137877895","https://openalex.org/W2476899828","https://openalex.org/W2540792017","https://openalex.org/W6674847561"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2041180560"],"abstract_inverted_index":{"A":[0],"wide":[1],"range":[2],"of":[3,15,39,99,111,123],"communication-intensive":[4],"real-time":[5],"multimedia":[6],"applications":[7],"over":[8],"networks":[9,20],"require":[10],"guaranteed":[11],"end-":[12],"to-end":[13],"quality":[14],"service":[16],"(QoS).":[17],"QoS-routing":[18,40],"in":[19,103],"aims":[21],"to":[22,30,53,86],"find":[23,87],"feasible":[24,51,101],"routes":[25],"that":[26],"have":[27],"sufficient":[28],"resources":[29],"satisfy":[31],"imposed":[32],"QoS-constraints.":[33],"The":[34],"bounded-delay":[35],"minimum-cost":[36],"path":[37],"problem":[38],"is":[41],"provably":[42],"difficult;":[43],"several":[44],"efficient":[45],"heuristic":[46,62],"algorithms":[47],"exist":[48],"for":[49,64,72,78],"computing":[50,100],"solutions":[52,89,102],"the":[54,66,91,121,124],"problem.":[55],"We":[56,94],"design":[57],"and":[58,81,106,126,129],"implement":[59],"an":[60],"improved":[61],"algorithm":[63,125],"solving":[65],"problem,":[67],"which":[68],"employs":[69],"bounded-size":[70],"buffers":[71],"properly":[73],"maintaining":[74],"competitive":[75],"cost-delay":[76],"combinations":[77],"feasible-path":[79],"extension":[80],"offers":[82],"a":[83,118,130],"better":[84],"chance":[85],"optimal/quality":[88],"than":[90],"known":[92],"heuristics.":[93],"also":[95],"prove":[96],"its":[97],"correctness":[98],"worst-case":[104],"polynomial-time":[105],"-space":[107],"complexities.":[108],"Two":[109],"sets":[110],"experimental":[112],"results":[113],"via":[114],"simulations":[115],"are":[116],"presented:":[117],"tradeoff":[119],"between":[120],"cost/time-performance":[122],"buffer":[127],"size,":[128],"delay/cost/time-performance":[131],"comparison":[132],"study.":[133]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}