{"id":"https://openalex.org/W2044081853","doi":"https://doi.org/10.1137/s0097539797329142","title":"Allocating Bandwidth for Bursty Connections","display_name":"Allocating Bandwidth for Bursty Connections","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2044081853","doi":"https://doi.org/10.1137/s0097539797329142","mag":"2044081853"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797329142","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797329142","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5055710645","display_name":"Jon Kleinberg","orcid":"https://orcid.org/0000-0002-1929-2512"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jon Kleinberg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Rabani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025175846","display_name":"\u00c9va Tardos","orcid":"https://orcid.org/0000-0002-2978-1475"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00c9va Tardos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055710645"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7144,"has_fulltext":false,"cited_by_count":145,"citation_normalized_percentile":{"value":0.87073651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"30","issue":"1","first_page":"191","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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/T12288","display_name":"Optimization and Search Problems","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8030211925506592},{"id":"https://openalex.org/keywords/statistical-time-division-multiplexing","display_name":"Statistical time division multiplexing","score":0.6730026006698608},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5860875248908997},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.548860490322113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5463621020317078},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.5234636664390564},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4885488450527191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4712398946285248},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4190465211868286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.406985342502594},{"id":"https://openalex.org/keywords/multiplexing","display_name":"Multiplexing","score":0.3933447599411011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22986680269241333},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.22782617807388306}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8030211925506592},{"id":"https://openalex.org/C173512123","wikidata":"https://www.wikidata.org/wiki/Q5978010","display_name":"Statistical time division multiplexing","level":3,"score":0.6730026006698608},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5860875248908997},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.548860490322113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5463621020317078},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5234636664390564},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4885488450527191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4712398946285248},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4190465211868286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.406985342502594},{"id":"https://openalex.org/C19275194","wikidata":"https://www.wikidata.org/wiki/Q222903","display_name":"Multiplexing","level":2,"score":0.3933447599411011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22986680269241333},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.22782617807388306},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797329142","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797329142","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1986721815","https://openalex.org/W1998205886","https://openalex.org/W2022191808","https://openalex.org/W2057190861","https://openalex.org/W2068193298","https://openalex.org/W2071104320","https://openalex.org/W2093979815","https://openalex.org/W2096909875","https://openalex.org/W2104680817","https://openalex.org/W2329816423","https://openalex.org/W2563178574"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078","https://openalex.org/W2159351466"],"abstract_inverted_index":{"In":[0,126,148,190,207],"this":[1,84],"paper,":[2],"we":[3,137,192,217,238,252,334],"undertake":[4],"the":[5,12,24,47,62,78,99,127,130,141,145,149,153,164,174,177,183,208,233,248,266,291,322,336,358],"first":[6,128],"study":[7],"of":[8,14,49,77,87,95,101,132,144,179,275,293,299,321,325,348],"statistical":[9,21,267],"multiplexing":[10,22,268],"from":[11],"perspective":[13],"approximation":[15,317],"algorithms.":[16],"The":[17,222],"basic":[18],"issue":[19],"underlying":[20],"is":[23,67,106,134,166,186,224,290,296],"following:":[25],"in":[26,61,83,265],"high-speed":[27],"networks,":[28],"individual":[29],"connections":[30,52,169,229],"(i.e.,":[31],"communication":[32],"sessions)":[33],"are":[34,161,339],"very":[35],"bursty,":[36],"with":[37,270,286,304],"transmission":[38],"rates":[39],"that":[40,86,173,176,281,308,333,345],"vary":[41],"greatly":[42],"over":[43],"time.":[44],"As":[45],"such,":[46],"problem":[48,129,210,223,237],"packing":[50],"multiple":[51],"together":[53],"on":[54,341,357],"a":[55,71,93,107,180,199,214,271,297,301,305,330,346],"link":[56,154,181,184,200],"becomes":[57],"more":[58],"subtle":[59],"than":[60],"case":[63,263],"when":[64],"each":[65,102,196,211],"connection":[66,103,197,212,307],"assumed":[68],"to":[69,139,167,170,194,198,225,256,354],"have":[70,218,253],"fixed":[72,302],"demand.":[73],"We":[74,110],"consider":[75,111],"one":[76,220,332],"most":[79,188,260],"commonly":[80],"studied":[81,264],"models":[82],"domain:":[85],"two":[88,151,250],"communicating":[89],"nodes":[90],"connected":[91],"by":[92],"set":[94],"parallel":[96],"edges,":[97],"where":[98],"rate":[100],"between":[104],"them":[105],"random":[108,245],"variable.":[109],"three":[112],"related":[113],"problems:":[114],"(1)":[115],"stochastic":[116,120,124,234],"load":[117,178,235],"balancing,":[118],"(2)":[119],"bin-packing,":[121],"and":[122,136,156,163,216,328],"(3)":[123],"knapsack.":[125],"number":[131],"links":[133,204],"given":[135],"want":[138],"minimize":[140],"expected":[142],"value":[143],"maximum":[146],"load.":[147],"other":[150,249],"problems":[152,251],"capacity":[155,185],"an":[157,240],"allowed":[158],"overflow":[159],"probabilityp":[160],"given,":[162],"objective":[165],"assign":[168,195],"links,":[171],"so":[172],"probability":[175],"exceeds":[182],"at":[187],"p.":[189],"bin-packing":[191],"need":[193],"using":[201],"as":[202,205,227,230,312,314],"few":[203],"possible.":[206,231,315],"knapsack":[209],"has":[213,282],"value,":[215],"only":[219],"link.":[221],"accept":[226],"many":[228],"For":[232,247],"balancing":[236],"give":[239],"O(1)-approximation":[241],"algorithm":[242],"for":[243,284],"arbitrary":[244],"variables.":[246],"algorithms":[254,318],"restricted":[255],"on-off":[257],"sources":[258],"(the":[259],"common":[261],"special":[262],"literature),":[269],"somewhat":[272],"weaker":[273],"range":[274],"performance":[276,337],"guarantees.":[277],"A":[278],"standard":[279,323],"approach":[280],"emerged":[283],"dealing":[285],"probabilistic":[287],"resource":[288],"requirements":[289],"notion":[292],"effective":[294,326],"bandwidth---this":[295],"means":[298],"associating":[300],"demand":[303],"bursty":[306],"\"represents\"":[309],"its":[310],"distribution":[311],"closely":[313],"Our":[316],"make":[319],"use":[320],"definition":[324],"bandwidth":[327],"also":[329],"new":[331,342],"introduce;":[335],"guarantees":[338],"based":[340],"results":[343],"showing":[344],"combination":[347],"these":[349],"measures":[350],"can":[351],"be":[352],"used":[353],"provide":[355],"bounds":[356],"optimal":[359],"solution.":[360]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}