{"id":"https://openalex.org/W3148569179","doi":"https://doi.org/10.1109/iwqos.2011.5931329","title":"QoS routing algorithms using fully polynomial time approximation scheme","display_name":"QoS routing algorithms using fully polynomial time approximation scheme","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W3148569179","doi":"https://doi.org/10.1109/iwqos.2011.5931329","mag":"3148569179"},"language":"en","primary_location":{"id":"doi:10.1109/iwqos.2011.5931329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2011.5931329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","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/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"]},{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["CN","JP"],"is_corresponding":true,"raw_author_name":"Jun Huang","raw_affiliation_strings":["GITI, Waseda University, Tokyo, Japan","Institute of Network Technology, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"GITI, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"Institute of Network Technology, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101622612","display_name":"Yoshiaki Tanaka","orcid":"https://orcid.org/0000-0003-3344-222X"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshiaki Tanaka","raw_affiliation_strings":["Global Information and Telecommunication Institute, Waseda University, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Global Information and Telecommunication Institute, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020146420"],"corresponding_institution_ids":["https://openalex.org/I139759216","https://openalex.org/I150744194"],"apc_list":null,"apc_paid":null,"fwci":3.1507,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92420834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"3"},"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.9995999932289124,"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.9987000226974487,"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.7592769861221313},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6305429339408875},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5911957621574402},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5665729641914368},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5393580794334412},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5217077136039734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5052765011787415},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4983377456665039},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.49386340379714966},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4767792522907257},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.4553215801715851},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4444037079811096},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.436564564704895},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.38378292322158813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3431151509284973},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21775811910629272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16988617181777954}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7592769861221313},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6305429339408875},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5911957621574402},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5665729641914368},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5393580794334412},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5217077136039734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5052765011787415},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4983377456665039},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.49386340379714966},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4767792522907257},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.4553215801715851},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4444037079811096},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.436564564704895},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.38378292322158813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3431151509284973},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21775811910629272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16988617181777954},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwqos.2011.5931329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2011.5931329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334394","display_name":"Manipal College of Pharmaceutical Sciences, Manipal Academy of Higher Education","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1997487288","https://openalex.org/W2030170468","https://openalex.org/W2061701207","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2114686820","https://openalex.org/W2130626677","https://openalex.org/W2160658249","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2204238626","https://openalex.org/W2105937634","https://openalex.org/W2041855631","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W2138035214","https://openalex.org/W2361465121","https://openalex.org/W2129293467","https://openalex.org/W1483323741","https://openalex.org/W2620451430"],"abstract_inverted_index":{"Routing":[0],"with":[1],"end-to-end":[2],"Quality-of-Service":[3],"(QoS)":[4],"guarantees":[5],"is":[6,24,59,69],"a":[7,39,53],"key":[8],"to":[9],"the":[10,22,32,50,66,76,80],"widespread":[11],"deployment":[12],"of":[13,65],"recent":[14],"emerged":[15],"services.":[16],"Developing":[17],"QoS":[18,33,47],"routing":[19,34],"algorithm":[20,68],"in":[21],"network":[23],"an":[25,62],"important":[26],"open":[27],"topic.":[28],"This":[29],"paper":[30],"investigates":[31],"related":[35],"problems":[36],"and":[37,61],"proposes":[38],"Fully":[40],"Polynomial":[41],"Time":[42],"Approximation":[43],"Scheme":[44],"(FPTAS)":[45],"for":[46],"routing.":[48],"In":[49],"proposed":[51,67,77],"FPTAS,":[52],"graph-extending":[54],"based":[55],"dynamic":[56],"programming":[57],"approach":[58],"developed,":[60],"extended":[63],"version":[64],"studied.":[70],"The":[71],"theoretical":[72],"analyses":[73],"show":[74],"that":[75],"algorithms":[78],"outperform":[79],"previous":[81],"best-known":[82],"studies.":[83]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}