{"id":"https://openalex.org/W2100356349","doi":"https://doi.org/10.1109/icccn.2005.1523810","title":"Computing delay constrained paths from one source to single/all destinations","display_name":"Computing delay constrained paths from one source to single/all destinations","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W2100356349","doi":"https://doi.org/10.1109/icccn.2005.1523810","mag":"2100356349"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2005.1523810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","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":null,"display_name":"Gang Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I1745920","display_name":"University of Wisconsin\u2013Platteville","ror":"https://ror.org/02xpkhc07","country_code":"US","type":"education","lineage":["https://openalex.org/I1745920"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gang Feng","raw_affiliation_strings":["Department of Electrical Engineering, University of Wisconsin, USA","Dept. of Electr. Eng., Wisconsin Univ., Platteville, WI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Wisconsin, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Wisconsin Univ., Platteville, WI, USA","institution_ids":["https://openalex.org/I1745920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074","https://openalex.org/I1745920"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17628095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"e85 b","issue":null,"first_page":"65","last_page":"70"},"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.9998000264167786,"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.9998000264167786,"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.9998000264167786,"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.9966999888420105,"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/heuristics","display_name":"Heuristics","score":0.7668149471282959},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6913394331932068},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6174191236495972},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6042212843894958},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.45684799551963806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4534459710121155},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4530397057533264},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4275120496749878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1639150083065033},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15998107194900513},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.053944170475006104}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7668149471282959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6913394331932068},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6174191236495972},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6042212843894958},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.45684799551963806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4534459710121155},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4530397057533264},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4275120496749878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1639150083065033},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15998107194900513},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.053944170475006104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icccn.2005.1523810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.843.5052","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.843.5052","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.uwplatt.edu/%7Efengg/PAPER/ic3n05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1494160116","https://openalex.org/W1596723592","https://openalex.org/W2011039300","https://openalex.org/W2098793224","https://openalex.org/W2112169033","https://openalex.org/W2118708968","https://openalex.org/W2130626677","https://openalex.org/W2140556610","https://openalex.org/W2148837283","https://openalex.org/W2157993733","https://openalex.org/W2169528473","https://openalex.org/W4285719527","https://openalex.org/W6635783931","https://openalex.org/W6674573048"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2007032764","https://openalex.org/W2513360157","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2149442301"],"abstract_inverted_index":{"Delay-constrained":[0],"least":[1],"cost":[2,38,138],"(DCLC)":[3],"path":[4],"problem":[5],"is":[6,91],"a":[7,30,53],"typical":[8],"delay":[9,36,69,78,86,126,136],"sensitive":[10],"quality":[11],"of":[12,25,29],"service":[13],"(QoS)":[14],"routing":[15],"problem.":[16,99],"In":[17],"this":[18],"paper,":[19],"we":[20],"provide":[21],"an":[22],"explicit":[23],"expression":[24,42],"the":[26,58,68,85,94,125,135],"time":[27,106],"complexity":[28],"previously":[31],"proposed":[32],"heuristic":[33,54,96],"NR-DCLC":[34],"when":[35,124,134],"and":[37,137],"are":[39,139],"integers.":[40],"The":[41],"indicates":[43],"it":[44,112],"compares":[45],"favorably":[46],"with":[47,81],"other":[48,120],"heuristics.":[49],"We":[50],"further":[51],"describe":[52],"NR-DCLC-1toN":[55,74,102],"to":[56,64,129],"compute":[57],"DCLC":[59],"paths":[60,80],"from":[61],"one":[62],"source":[63],"all":[65],"destinations":[66],"satisfying":[67],"constraint.":[70],"Simulations":[71],"demonstrate":[72],"that":[73],"can":[75],"always":[76],"find":[77],"constrained":[79],"lower":[82],"costs":[83],"than":[84,107,116],"scaling":[87],"algorithm":[88],"(DSA),":[89],"which":[90],"so":[92],"far":[93],"best":[95],"for":[97],"such":[98,122],"Even":[100],"though":[101],"needs":[103],"higher":[104],"execution":[105],"DSA":[108,117],"in":[109,118],"some":[110],"cases,":[111],"runs":[113],"much":[114],"faster":[115],"many":[119],"cases":[121],"as":[123],"constraint":[127],"has":[128],"be":[130],"strictly":[131],"guaranteed":[132],"or":[133],"distributed":[140],"on":[141],"large":[142],"intervals.":[143]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}