{"id":"https://openalex.org/W2038858798","doi":"https://doi.org/10.1109/socpar.2013.7054107","title":"Low complexity bandwidth guaranteed routing algorithms using path holding time","display_name":"Low complexity bandwidth guaranteed routing algorithms using path holding time","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2038858798","doi":"https://doi.org/10.1109/socpar.2013.7054107","mag":"2038858798"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2013.7054107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2013.7054107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","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/A5087945426","display_name":"Cao Thai Phuong Thanh","orcid":null},"institutions":[{"id":"https://openalex.org/I47807185","display_name":"Saigon University","ror":"https://ror.org/01f1fsr30","country_code":"VN","type":"education","lineage":["https://openalex.org/I47807185"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Cao Thai Phuong Thanh","raw_affiliation_strings":["Saigon University, Ho Chi Minh City, Vietnam","Saigon University, Ho Chi Minh city, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saigon University, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47807185"]},{"raw_affiliation_string":"Saigon University, Ho Chi Minh city, Vietnam","institution_ids":["https://openalex.org/I47807185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007862025","display_name":"H\u00e0 H\u1ea3i Nam","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095603","display_name":"Vietnam Posts and Telecommunications Group (Vietnam)","ror":"https://ror.org/00q0e7f94","country_code":"VN","type":"company","lineage":["https://openalex.org/I4210095603"]},{"id":"https://openalex.org/I4400600977","display_name":"Posts and Telecommunications Institute of Technology","ror":"https://ror.org/0363rtq22","country_code":null,"type":"education","lineage":["https://openalex.org/I4400600977"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Ha Hai Nam","raw_affiliation_strings":["Post & Telecommunications Institute of Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Post & Telecommunications Institute of Technology, Vietnam","institution_ids":["https://openalex.org/I4210095603","https://openalex.org/I4400600977"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080553391","display_name":"Tran Cong Hung","orcid":"https://orcid.org/0009-0001-1698-2673"},"institutions":[{"id":"https://openalex.org/I4210095603","display_name":"Vietnam Posts and Telecommunications Group (Vietnam)","ror":"https://ror.org/00q0e7f94","country_code":"VN","type":"company","lineage":["https://openalex.org/I4210095603"]},{"id":"https://openalex.org/I4400600977","display_name":"Posts and Telecommunications Institute of Technology","ror":"https://ror.org/0363rtq22","country_code":null,"type":"education","lineage":["https://openalex.org/I4400600977"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Cong Hung","raw_affiliation_strings":["Post & Telecommunications Institute of Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Post & Telecommunications Institute of Technology, Vietnam","institution_ids":["https://openalex.org/I4210095603","https://openalex.org/I4400600977"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2683,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45071873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"457","issue":null,"first_page":"86","last_page":"91"},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.7188265323638916},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.7156365513801575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6974183320999146},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6959506273269653},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6654168963432312},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6229721903800964},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5734124779701233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5372170805931091},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.507860004901886},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.487865686416626},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.462729811668396},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46157726645469666},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42003682255744934},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.41110464930534363},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3986775875091553},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2832699418067932}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.7188265323638916},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.7156365513801575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6974183320999146},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6959506273269653},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6654168963432312},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6229721903800964},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5734124779701233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5372170805931091},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.507860004901886},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.487865686416626},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.462729811668396},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46157726645469666},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42003682255744934},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.41110464930534363},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3986775875091553},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2832699418067932}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2013.7054107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2013.7054107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2006146932","https://openalex.org/W2010676865","https://openalex.org/W2096774592","https://openalex.org/W2110294867","https://openalex.org/W2150365829","https://openalex.org/W2293080294","https://openalex.org/W2536990626","https://openalex.org/W4245452456"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W1538003338","https://openalex.org/W2068473861","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":{"This":[0],"paper":[1],"introduces":[2],"new":[3],"bandwidth":[4],"guaranteed":[5],"routing":[6,32,65,98],"algorithms":[7,40,91],"using":[8],"remaining":[9],"path":[10],"holding":[11,29],"time.":[12],"The":[13,38],"idea":[14],"is":[15,54],"to":[16,34],"combine":[17],"residual":[18],"bandwidths":[19,47],"with":[20],"future":[21],"available":[22],"band-widths":[23],"which":[24],"are":[25,48,57],"calculated":[26],"based":[27,80],"on":[28],"time":[30,105],"of":[31,97],"paths":[33],"select":[35],"next":[36],"routes.":[37],"proposed":[39,90],"have":[41],"low":[42],"complexity":[43],"because":[44],"only":[45,93],"link":[46],"considered":[49],"and":[50,77],"no":[51],"critical":[52],"computation":[53,104],"needed.":[55],"They":[56],"tested":[58],"against":[59],"other":[60],"popular":[61],"traffic":[62],"engineering":[63],"(TE)":[64],"algorithms,":[66],"i.e.":[67],"Minimum":[68,72],"Hop":[69],"Algorithm":[70,75,81],"(MHA),":[71],"Interference":[73],"Routing":[74],"(MIRA),":[76],"Random":[78],"Race":[79],"for":[82],"TE":[83],"(RRATE).":[84],"Experimental":[85],"results":[86],"indicate":[87],"that":[88],"the":[89,108],"not":[92],"accept":[94],"more":[95],"number":[96],"requests":[99],"but":[100],"also":[101],"achieve":[102],"lower":[103],"than":[106],"all":[107],"others.":[109]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}