{"id":"https://openalex.org/W2115611436","doi":"https://doi.org/10.1109/glocom.2010.5683581","title":"An Effective Approximation Scheme for Multiconstrained Quality-of-Service Routing","display_name":"An Effective Approximation Scheme for Multiconstrained Quality-of-Service Routing","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2115611436","doi":"https://doi.org/10.1109/glocom.2010.5683581","mag":"2115611436"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","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/A5020146420","display_name":"Jun Huang","orcid":"https://orcid.org/0000-0001-9393-4416"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Huang","raw_affiliation_strings":["Institute of Network Technology, Beijing University of Posts and Telecommunications, China","Inst. of Network Technol., Beijing Univ. of Posts & Telecommun., Beijing, , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Network Technology, Beijing University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Inst. of Network Technol., Beijing Univ. of Posts & Telecommun., Beijing, , China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078113299","display_name":"Xiaohong Huang","orcid":"https://orcid.org/0000-0002-7275-2274"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaohong Huang","raw_affiliation_strings":["Institute of Network Technology, BUPT, China","Inst. of Network Technol., Beijing Univ. of Posts & Telecommun., Beijing, , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Network Technology, BUPT, China","institution_ids":[]},{"raw_affiliation_string":"Inst. of Network Technol., Beijing Univ. of Posts & Telecommun., Beijing, , China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054182752","display_name":"Yan Ma","orcid":"https://orcid.org/0000-0003-4626-1401"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Ma","raw_affiliation_strings":["Institute of Network Technology, Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, China","Beijing Key Lab. of Intell. Telecommun. Softw. & Multim., BUPT, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Network Technology, Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Beijing Key Lab. of Intell. Telecommun. Softw. & Multim., BUPT, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":2.9338,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.92251082,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"6"},"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.9994000196456909,"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.9950000047683716,"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.7713286876678467},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6698884963989258},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6383026242256165},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5814133286476135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5210525393486023},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4573066532611847},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41531747579574585},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4135040044784546},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.347728967666626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23690205812454224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16502949595451355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7713286876678467},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6698884963989258},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6383026242256165},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5814133286476135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5210525393486023},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4573066532611847},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41531747579574585},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4135040044784546},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.347728967666626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23690205812454224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16502949595451355},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2010.5683581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1997487288","https://openalex.org/W2030170468","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2096774592","https://openalex.org/W2102234396","https://openalex.org/W2114686820","https://openalex.org/W2119775299","https://openalex.org/W2130626677","https://openalex.org/W2140556610","https://openalex.org/W2147799577","https://openalex.org/W2148837283","https://openalex.org/W2154355266","https://openalex.org/W2160658249","https://openalex.org/W2169369745","https://openalex.org/W2170358592","https://openalex.org/W6682908328","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W2140798747","https://openalex.org/W2948169060","https://openalex.org/W2730112582","https://openalex.org/W2323516465","https://openalex.org/W2110696645","https://openalex.org/W2358580169","https://openalex.org/W4238615239","https://openalex.org/W2111347279","https://openalex.org/W2487211728","https://openalex.org/W2378096925"],"abstract_inverted_index":{"Finding":[0],"a":[1,95],"path":[2,57,75,97,144],"that":[3,140],"satisfies":[4],"multiple":[5],"Quality-of-Service":[6],"(QoS)":[7],"requirements":[8],"is":[9],"vital":[10],"to":[11,115],"the":[12,62,70,74,81,90,103,107,117],"deployment":[13],"of":[14,64,73,80,106,125],"current":[15],"emerged":[16],"services.":[17],"However,":[18],"existing":[19],"QoS":[20,41],"routing":[21,118],"algorithms":[22],"are":[23],"not":[24,87],"very":[25],"efficient":[26],"and":[27,77,110,128,148],"effective":[28,49],"at":[29],"finding":[30],"such":[31],"path.":[32],"Moreover,":[33],"few":[34],"works":[35],"focus":[36],"on":[37,61],"two":[38],"or":[39],"more":[40],"constraints.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46],"propose":[47],"an":[48],"fully":[50],"polynomial":[51],"approximation":[52],"scheme":[53],"(FPAS)":[54],"for":[55],"multiconstrainted":[56],"optimal":[58],"problem":[59],"based":[60],"technique":[63],"auxiliary":[65],"graph":[66],"construction.":[67],"By":[68],"employing":[69],"nonlinear":[71],"definition":[72],"constraint":[76],"limited":[78],"iteration":[79],"FPAS":[82,85,131,141],"itself,":[83],"our":[84,130],"can":[86,142],"only":[88],"achieve":[89],"complexity":[91,147],"reduction":[92],"but":[93],"generate":[94],"preferable":[96],"as":[98],"well.":[99],"We":[100,120],"further":[101],"analyze":[102],"Markov":[104],"properties":[105],"entire":[108],"network":[109],"obtain":[111],"some":[112],"key":[113],"parameters":[114],"reflect":[116],"characteristic.":[119],"experiment":[121],"with":[122,145],"different":[123],"scale":[124],"random":[126],"networks":[127],"compare":[129],"against":[132],"previous":[133],"well":[134],"known":[135],"studies.":[136],"Our":[137],"results":[138],"show":[139],"find":[143],"lower":[146],"better":[149],"quality.":[150]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}