{"id":"https://openalex.org/W2122157580","doi":"https://doi.org/10.1093/comjnl/bxu053","title":"Optimal Joint Path Computation and Rate Allocation for Real-time Traffic","display_name":"Optimal Joint Path Computation and Rate Allocation for Real-time Traffic","publication_year":2014,"publication_date":"2014-06-22","ids":{"openalex":"https://openalex.org/W2122157580","doi":"https://doi.org/10.1093/comjnl/bxu053","mag":"2122157580"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxu053","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxu053","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://academic.oup.com/comjnl/article/58/6/1416/396320/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061303343","display_name":"Antonio Frangioni","orcid":"https://orcid.org/0000-0002-5704-3170"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Frangioni","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","1Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"1Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043357839","display_name":"Laura Galli","orcid":"https://orcid.org/0000-0002-5801-9439"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Galli","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","1Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"1Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008205801","display_name":"Giovanni Stea","orcid":"https://orcid.org/0000-0001-5310-6763"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Stea","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Largo Lucio Lazzarino 1, 56122 Pisa, Italy","2Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Largo Lucio Lazzarino 1, 56122 Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Largo Lucio Lazzarino 1, 56122 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"2Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Largo Lucio Lazzarino 1, 56122 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008205801"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":1.0448,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81348278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"58","issue":"6","first_page":"1416","last_page":"1430"},"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/T11409","display_name":"Advanced Wireless Network Optimization","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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7627517580986023},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.702958345413208},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5672695636749268},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5612521171569824},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5559122562408447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5491469502449036},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4901181161403656},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4498717188835144},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42271339893341064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23782271146774292},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.19960281252861023},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16924288868904114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1575746238231659},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1443495750427246},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13543552160263062}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7627517580986023},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.702958345413208},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5672695636749268},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5612521171569824},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5559122562408447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5491469502449036},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4901181161403656},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4498717188835144},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42271339893341064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23782271146774292},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.19960281252861023},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16924288868904114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1575746238231659},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1443495750427246},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13543552160263062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1093/comjnl/bxu053","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxu053","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:arpi.unipi.it:11568/457467","is_oa":true,"landing_page_url":"https://academic.oup.com/comjnl/article/58/6/1416/396320/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:cris.unibo.it:11585/1000227","is_oa":false,"landing_page_url":"https://hdl.handle.net/11585/1000227","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arpi.unipi.it:11568/457467","is_oa":true,"landing_page_url":"https://academic.oup.com/comjnl/article/58/6/1416/396320/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1512355478","https://openalex.org/W1526206232","https://openalex.org/W1602541202","https://openalex.org/W1651117873","https://openalex.org/W1731982387","https://openalex.org/W1737589985","https://openalex.org/W1831112114","https://openalex.org/W1866760549","https://openalex.org/W1968143987","https://openalex.org/W1971036258","https://openalex.org/W1977867524","https://openalex.org/W2008099469","https://openalex.org/W2019932110","https://openalex.org/W2029539439","https://openalex.org/W2040656129","https://openalex.org/W2063871132","https://openalex.org/W2064051723","https://openalex.org/W2068762076","https://openalex.org/W2080249702","https://openalex.org/W2080988740","https://openalex.org/W2093022060","https://openalex.org/W2095796020","https://openalex.org/W2102760493","https://openalex.org/W2105020099","https://openalex.org/W2109092710","https://openalex.org/W2114686820","https://openalex.org/W2121323396","https://openalex.org/W2122154958","https://openalex.org/W2122519341","https://openalex.org/W2126024311","https://openalex.org/W2130202407","https://openalex.org/W2140556610","https://openalex.org/W2148837283","https://openalex.org/W2155042491","https://openalex.org/W2160233994","https://openalex.org/W2161372147","https://openalex.org/W2170569252","https://openalex.org/W2176566884","https://openalex.org/W2286092420","https://openalex.org/W2291101245","https://openalex.org/W2595833503","https://openalex.org/W4234856657","https://openalex.org/W4247222896","https://openalex.org/W4253826867"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2007032764","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2149442301","https://openalex.org/W2143239491"],"abstract_inverted_index":{"Computing":[0],"network":[1],"paths":[2,31,101],"under":[3],"worst-case":[4],"delay":[5],"constraints":[6],"has":[7],"been":[8,53],"the":[9,15,25,56,68,74,78,87,114,130,196],"subject":[10],"of":[11,100,173,175,201],"abundant":[12],"literature":[13],"in":[14,42,55,142,167,186,199],"past":[16,57],"two":[17],"decades.":[18],"Assuming":[19],"weighted":[20],"fair":[21],"queueing":[22],"scheduling":[23],"at":[24,35,63,102,123],"nodes,":[26],"this":[27,82,108,152],"translates":[28],"to":[29,98],"computing":[30],"and":[32,71,106,119,138,192],"reserving":[33],"rates":[34,62,75],"each":[36,64],"link.":[37],"The":[38],"problem":[39,131],"is":[40,126],"\ud835\udca9\ud835\udcab-hard":[41],"general,":[43],"even":[44],"for":[45,145,170],"a":[46,133,160,164],"single":[47],"path;":[48],"hence":[49],"polynomial-time":[50],"heuristics":[51],"have":[52],"proposed":[54],"that":[58,86,107,181],"either":[59],"assume":[60],"equal":[61],"node,":[65],"or":[66],"compute":[67],"path":[69,117],"heuristically":[70],"then":[72],"allocate":[73],"optimally":[76,141],"on":[77,149],"given":[79],"path.":[80],"In":[81],"paper":[83],"we":[84],"show":[85,180],"above":[88],"heuristics,":[89],"albeit":[90],"finding":[91],"optimal":[92],"solutions":[93],"quite":[94],"often,":[95],"can":[96,154],"lead":[97],"failing":[99],"very":[103],"low":[104],"loads,":[105],"could":[109],"be":[110,156],"avoided":[111],"by":[112,128],"solving":[113,139],"problem,":[115],"i.e.":[116],"computation":[118,176],"rate":[120],"allocation,":[121],"jointly":[122],"optimality.":[124],"This":[125],"possible":[127],"modeling":[129],"as":[132],"mixed-integer":[134],"second-order":[135],"cone":[136],"program":[137],"it":[140],"split-second":[143],"times":[144],"relatively":[146],"large":[147],"networks":[148,191],"commodity":[150],"hardware;":[151],"approach":[153],"also":[155],"easily":[157],"turned":[158],"into":[159],"heuristic":[161],"one,":[162],"trading":[163],"negligible":[165],"increase":[166],"blocking":[168,202],"probability":[169],"one":[171],"order":[172],"magnitude":[174],"time.":[177],"Extensive":[178],"simulations":[179],"these":[182],"methods":[183],"are":[184],"feasible":[185],"today's":[187],"Internet":[188],"service":[189],"provider":[190],"they":[193],"significantly":[194],"outperform":[195],"existing":[197],"schemes":[198],"terms":[200],"probability.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}