{"id":"https://openalex.org/W2158567705","doi":"https://doi.org/10.1109/infcom.2003.1208931","title":"Efficient QoS routing","display_name":"Efficient QoS routing","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2158567705","doi":"https://doi.org/10.1109/infcom.2003.1208931","mag":"2158567705"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2003.1208931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","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/A5049513823","display_name":"Sofia Siachalou","orcid":"https://orcid.org/0000-0002-7010-293X"},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"S. Siachalou","raw_affiliation_strings":["Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001052113","display_name":"Leonidas Georgiadis","orcid":null},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"L. Georgiadis","raw_affiliation_strings":["Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21370196"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"938","last_page":"947 vol.2"},"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.9997000098228455,"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.9997000098228455,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9994999766349792,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"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.7721543908119202},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6255993843078613},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6004029512405396},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5201876163482666},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5000760555267334},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4913448393344879},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4594612121582031},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45943209528923035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.379304975271225},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20495721697807312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1675960123538971}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7721543908119202},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6255993843078613},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6004029512405396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5201876163482666},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5000760555267334},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4913448393344879},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4594612121582031},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45943209528923035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.379304975271225},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20495721697807312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1675960123538971},{"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/infcom.2003.1208931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","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":17,"referenced_works":["https://openalex.org/W1498798861","https://openalex.org/W1602541202","https://openalex.org/W1834436800","https://openalex.org/W1977545325","https://openalex.org/W2011039300","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2084224084","https://openalex.org/W2086581750","https://openalex.org/W2121842672","https://openalex.org/W2130626677","https://openalex.org/W2156153879","https://openalex.org/W2157993733","https://openalex.org/W2170358592","https://openalex.org/W4210777595","https://openalex.org/W4285719527","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4252842032","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3103742520","https://openalex.org/W4390579151"],"abstract_inverted_index":{"The":[0,37],"problem":[1],"of":[2,29,51,72],"routing":[3],"in":[4,82,95],"a":[5,48],"network":[6,13],"where":[7],"QoS":[8],"constraints":[9],"are":[10,23],"placed":[11],"on":[12,25,68],"traffic":[14],"is":[15],"considered.":[16],"We":[17],"provide":[18,90],"two":[19],"optimal":[20],"algorithms":[21,39,88],"that":[22],"based":[24,67],"determining":[26],"the":[27,33,65,69,73],"discontinuities":[28],"functions":[30],"related":[31],"to":[32,89,97],"optimization":[34],"at":[35],"hand.":[36],"proposed":[38],"have":[40,55],"pseudopolynomial":[41],"worst":[42],"case":[43,93],"running":[44,58,101],"time":[45],"and":[46,77],"for":[47],"wide":[49],"variety":[50],"tested":[52],"networks":[53],"they":[54],"fairly":[56],"satisfactory":[57],"times.":[59],"They":[60],"perform":[61],"significantly":[62],"better":[63],"than":[64],"algorithm":[66],"direct":[70],"application":[71],"dynamic":[74],"programming":[75],"equations":[76],"can":[78],"also":[79],"be":[80],"used":[81],"conjunction":[83],"with":[84],"known":[85],"polynomial-time":[86],"approximation":[87],"good":[91],"average":[92],"behavior,":[94],"addition":[96],"guaranteeing":[98],"polynomial":[99],"worst-case":[100],"time.":[102]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}