{"id":"https://openalex.org/W2167370536","doi":"https://doi.org/10.1109/tnet.2002.1012364","title":"Bandwidth sharing: objectives and algorithms","display_name":"Bandwidth sharing: objectives and algorithms","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2167370536","doi":"https://doi.org/10.1109/tnet.2002.1012364","mag":"2167370536"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2002.1012364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2002.1012364","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5007698196","display_name":"Laurent Massouli\u00e9","orcid":"https://orcid.org/0000-0001-7263-0069"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"L. Massoulie","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002468591","display_name":"James W. Roberts","orcid":"https://orcid.org/0000-0001-6204-5325"},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J. Roberts","raw_affiliation_strings":["France T\u00e9l\u00e9com Research and Development, Issy-les-Moulineaux, France"],"affiliations":[{"raw_affiliation_string":"France T\u00e9l\u00e9com Research and Development, Issy-les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007698196"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":15.0096,"has_fulltext":false,"cited_by_count":356,"citation_normalized_percentile":{"value":0.99127815,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"10","issue":"3","first_page":"320","last_page":"328"},"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.9994999766349792,"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.9976999759674072,"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.8407996892929077},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6351186037063599},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.5945850610733032},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5885030031204224},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.5703374147415161},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.5085533857345581},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.4464414417743683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4053988456726074},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3606363534927368},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30630412697792053},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.30630025267601013},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.18902382254600525},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.18822124600410461},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1706337332725525},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.1705905795097351},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13953155279159546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1333659291267395},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.12195271253585815}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8407996892929077},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6351186037063599},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.5945850610733032},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5885030031204224},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.5703374147415161},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.5085533857345581},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4464414417743683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4053988456726074},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3606363534927368},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30630412697792053},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30630025267601013},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.18902382254600525},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.18822124600410461},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1706337332725525},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.1705905795097351},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13953155279159546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1333659291267395},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.12195271253585815},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2002.1012364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2002.1012364","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321979","display_name":"University of Surrey","ror":"https://ror.org/00ks66431"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1275161073","https://openalex.org/W1524963856","https://openalex.org/W1529132671","https://openalex.org/W1987497363","https://openalex.org/W2025865193","https://openalex.org/W2037710455","https://openalex.org/W2105520014","https://openalex.org/W2108093369","https://openalex.org/W2114202040","https://openalex.org/W2119570376","https://openalex.org/W2120972066","https://openalex.org/W2130301482","https://openalex.org/W2130556831","https://openalex.org/W2147524058","https://openalex.org/W2158700277","https://openalex.org/W2159715570","https://openalex.org/W2161809383","https://openalex.org/W2176566884","https://openalex.org/W2613173048","https://openalex.org/W2753542457","https://openalex.org/W3020151382","https://openalex.org/W4231918747","https://openalex.org/W4240896209","https://openalex.org/W4245558686","https://openalex.org/W4248409180","https://openalex.org/W4252999360","https://openalex.org/W6631672338"],"related_works":["https://openalex.org/W2076773727","https://openalex.org/W1605983382","https://openalex.org/W1999684000","https://openalex.org/W2002544160","https://openalex.org/W2132850534","https://openalex.org/W2402400303","https://openalex.org/W1974879901","https://openalex.org/W2138888940","https://openalex.org/W2320592338","https://openalex.org/W4385757676"],"abstract_inverted_index":{"This":[0,136],"paper":[1],"concerns":[2],"the":[3,21,56,112,119,131,144],"design":[4],"of":[5,55,76,147],"distributed":[6,94],"algorithms":[7],"for":[8],"sharing":[9,72],"network":[10],"bandwidth":[11,71],"resources":[12],"among":[13],"contending":[14],"flows.":[15],"The":[16,25],"classical":[17],"fairness":[18,28],"notion":[19],"is":[20,50,84,139],"so-called":[22],"max-min":[23],"fairness.":[24],"alternative":[26],"proportional":[27],"criterion":[29],"has":[30],"recently":[31],"been":[32],"introduced":[33],"by":[34,59],"F.":[35],"Kelly":[36],"(see":[37],"Eur.":[38],"Trans.":[39],"Telecommun.,":[40],"vol.8,":[41],"p.33-7,":[42],"1997);":[43],"we":[44],"introduce":[45],"a":[46,93],"third":[47],"criterion,":[48],"which":[49],"naturally":[51],"interpreted":[52],"in":[53,86],"terms":[54],"delays":[57],"experienced":[58],"ongoing":[60],"transfers.":[61],"We":[62,90,114],"prove":[63],"that":[64],"fixed-size":[65],"window":[66],"control":[67],"can":[68],"achieve":[69,125],"fair":[70,133],"according":[73],"to":[74,117,124,142],"any":[75],"these":[77],"criteria,":[78],"provided":[79],"scheduling":[80],"at":[81],"each":[82,98],"link":[83],"performed":[85],"an":[87,126],"appropriate":[88],"manner.":[89],"then":[91,140],"consider":[92],"random":[95],"scheme":[96],"where":[97],"traffic":[99],"source":[100,120],"varies":[101],"its":[102],"sending":[103],"rate":[104,134,149],"randomly,":[105],"based":[106],"on":[107],"binary":[108],"feedback":[109],"information":[110],"from":[111],"network.":[113],"show":[115],"how":[116],"select":[118],"behavior":[121,146],"so":[122],"as":[123],"equilibrium":[127],"distribution":[128],"concentrated":[129],"around":[130],"considered":[132],"allocations.":[135],"stochastic":[137],"analysis":[138],"used":[141],"assess":[143],"asymptotic":[145],"deterministic":[148],"adaption":[150],"procedures.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":24},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":21}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}