{"id":"https://openalex.org/W2124396866","doi":"https://doi.org/10.1109/icc.2004.1312858","title":"Estimated link selection for DCLC problem","display_name":"Estimated link selection for DCLC problem","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2124396866","doi":"https://doi.org/10.1109/icc.2004.1312858","mag":"2124396866"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5026687678","display_name":"Moonseong Kim","orcid":"https://orcid.org/0000-0003-2692-6883"},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Moonseong Kim","raw_affiliation_strings":["School of Information and Communication Engineering, Sungkyunkwan University, Suwon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Engineering, Sungkyunkwan University, Suwon, South Korea","institution_ids":["https://openalex.org/I848706"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041068085","display_name":"Young-Cheol Bang","orcid":null},"institutions":[{"id":"https://openalex.org/I1322422313","display_name":"Tech University of Korea","ror":"https://ror.org/0060vt104","country_code":"KR","type":"education","lineage":["https://openalex.org/I1322422313"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-Cheol Bang","raw_affiliation_strings":["Department of Computer Engineering, Korea Polytechnic University, Gyeonggi, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Korea Polytechnic University, Gyeonggi, South Korea","institution_ids":["https://openalex.org/I1322422313"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054933494","display_name":"Hyunseung Choo","orcid":"https://orcid.org/0000-0002-6485-3155"},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyunseung Choo","raw_affiliation_strings":["School of Information and Communication Engineering, Sungkyunkwan University, Suwon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Engineering, Sungkyunkwan University, Suwon, South Korea","institution_ids":["https://openalex.org/I848706"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3217,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55905922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1937","last_page":"1941 Vol.4"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9993000030517578,"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.9973000288009644,"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/path","display_name":"Path (computing)","score":0.697759747505188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6568214297294617},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5894140601158142},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5756005644798279},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5557693839073181},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.534255862236023},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5226839780807495},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5104309916496277},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5009059906005859},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49942898750305176},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2887808084487915},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.22359636425971985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1749539077281952},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12978795170783997},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09397295117378235},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0812019407749176}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.697759747505188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6568214297294617},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5894140601158142},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5756005644798279},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5557693839073181},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.534255862236023},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5226839780807495},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5104309916496277},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5009059906005859},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49942898750305176},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2887808084487915},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.22359636425971985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1749539077281952},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12978795170783997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09397295117378235},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0812019407749176}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2004.1312858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1511398909","https://openalex.org/W1728701145","https://openalex.org/W1851684771","https://openalex.org/W2011039300","https://openalex.org/W2046245205","https://openalex.org/W2125618481","https://openalex.org/W2152950844","https://openalex.org/W2248064281","https://openalex.org/W2613173048","https://openalex.org/W2942228371","https://openalex.org/W4238664085","https://openalex.org/W6610072603","https://openalex.org/W6630746180","https://openalex.org/W6737445176","https://openalex.org/W7024001005"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W1490490684","https://openalex.org/W2962525871","https://openalex.org/W4310124294","https://openalex.org/W2170980056"],"abstract_inverted_index":{"The":[0,40,101,115],"development":[1],"of":[2,6,118,127,135,143,157,178,223],"the":[3,22,31,45,53,57,64,70,75,82,87,91,96,128,132,144,155,166,193,204,213],"efficient":[4],"quality":[5],"service":[7],"(QoS)":[8],"routing":[9,43,47],"algorithms":[10],"in":[11,52,147,195,221],"a":[12,25,158,170,175],"high":[13],"speed":[14],"network":[15,197],"environment":[16],"is":[17,44,50,61,84,121,138,174,216],"very":[18,26],"important":[19],"and,":[20],"at":[21],"same":[23],"time,":[24],"difficult":[27],"task":[28],"due":[29],"to":[30,33,62,85,112,202,218],"need":[32],"provide":[34],"divergent":[35],"services":[36],"with":[37,169,192],"QoS":[38],"requirements.":[39],"distributed":[41],"adaptive":[42],"typical":[46],"algorithm":[48,73,94],"that":[49,67,126,142,187],"used":[51],"current":[54],"Internet.":[55],"If":[56],"parameter":[58,83,172],"we":[59,153],"concern":[60],"measure":[63,86],"delay":[65,77,102,134,209],"on":[66],"link,":[68],"then":[69,90],"shortest":[71,92],"path":[72,93,107,116,120,133,137,146,211],"obtains":[74],"least":[76,97,104],"(LD)":[78],"path.":[79,100],"Meanwhile,":[80],"if":[81],"link":[88,162],"cost,":[89],"calculates":[95],"cost":[98,105,117,179,206],"(LC)":[99],"constrained":[103],"(DCLC)":[106],"problem":[108,168],"has":[109],"been":[110],"shown":[111],"be":[113],"NP-hard.":[114],"LD":[119,145],"relatively":[122,139],"more":[123],"expensive":[124],"than":[125,141],"LC":[129,136],"path,":[130],"and":[131,180,207,212],"higher":[140],"DCLC":[148,167],"problem.":[149],"In":[150],"this":[151],"paper,":[152],"investigate":[154],"performance":[156,214],"heuristic":[159],"algorithm,":[160],"estimated":[161],"selection":[163],"(ELS)":[164],"for":[165],"new":[171],"which":[173],"probabilistic":[176],"combination":[177],"delay.":[181],"We":[182],"have":[183],"performed":[184],"empirical":[185],"evaluation":[186],"compares":[188],"our":[189],"proposed":[190],"ELS":[191],"DCUR":[194],"various":[196],"situations.":[198],"It":[199],"significantly":[200],"contributes":[201],"identify":[203],"low":[205,208],"unicasting":[210],"improvement":[215],"up":[217],"about":[219],"49%":[220],"terms":[222],"normalized":[224],"surcharge.":[225]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}