{"id":"https://openalex.org/W2964140331","doi":"https://doi.org/10.1109/allerton.2014.7028588","title":"Store-forward and its implications for proportional scheduling","display_name":"Store-forward and its implications for proportional scheduling","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2964140331","doi":"https://doi.org/10.1109/allerton.2014.7028588","mag":"2964140331"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5068542108","display_name":"Neil Walton","orcid":"https://orcid.org/0000-0002-5241-9765"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"N. S. Walton","raw_affiliation_strings":["Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068542108"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":0.4079,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61428594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1174","last_page":"1181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9975000023841858,"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.6714575290679932},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.608558177947998},{"id":"https://openalex.org/keywords/pooling","display_name":"Pooling","score":0.5098642706871033},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4942641258239746},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.44149333238601685},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.42494767904281616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3594890832901001},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35425853729248047},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3521726429462433},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.23141402006149292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23018217086791992},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.17839190363883972},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16315758228302002},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.14263761043548584}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6714575290679932},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.608558177947998},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.5098642706871033},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4942641258239746},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.44149333238601685},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.42494767904281616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3594890832901001},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35425853729248047},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3521726429462433},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.23141402006149292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23018217086791992},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.17839190363883972},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16315758228302002},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.14263761043548584},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/allerton.2014.7028588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/a339ba76-bbc3-4790-ac59-2e4aa0cc35eb","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/storeforward-and-its-implications-for-proportional-scheduling(a339ba76-bbc3-4790-ac59-2e4aa0cc35eb).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Walton, N S 2014, Store-Forward and its implications for Proportional Scheduling. in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing: September 30, 2014-Oct. 3, 2014, Monticello, Il, USA. Piscataway, NJ, pp. 1174-1181, 52nd Annual Allerton Conference on Communication, Control, and Computing, 30/09/14. https://doi.org/10.1109/ALLERTON.2014.7028588","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dare.uva.nl:publications/a339ba76-bbc3-4790-ac59-2e4aa0cc35eb","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/storeforward-and-its-implications-for-proportional-scheduling(a339ba76-bbc3-4790-ac59-2e4aa0cc35eb).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Walton, N S 2014, Store-Forward and its implications for Proportional Scheduling. in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing: September 30, 2014-Oct. 3, 2014, Monticello, Il, USA. Piscataway, NJ, pp. 1174-1181, 52nd Annual Allerton Conference on Communication, Control, and Computing, 30/09/14. https://doi.org/10.1109/ALLERTON.2014.7028588","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W319976220","https://openalex.org/W1681209285","https://openalex.org/W1966102514","https://openalex.org/W1967746794","https://openalex.org/W1973199140","https://openalex.org/W1987497363","https://openalex.org/W1990160109","https://openalex.org/W2001821940","https://openalex.org/W2003346154","https://openalex.org/W2009760900","https://openalex.org/W2015207483","https://openalex.org/W2018654380","https://openalex.org/W2020799600","https://openalex.org/W2026748654","https://openalex.org/W2065649422","https://openalex.org/W2070317877","https://openalex.org/W2076490284","https://openalex.org/W2083514968","https://openalex.org/W2105177639","https://openalex.org/W2147703203","https://openalex.org/W2153857052","https://openalex.org/W2165723486","https://openalex.org/W2167370536","https://openalex.org/W2167478885","https://openalex.org/W2168055141","https://openalex.org/W2324876764","https://openalex.org/W2798236146","https://openalex.org/W2951355287","https://openalex.org/W3100286036","https://openalex.org/W3100718985","https://openalex.org/W3105753827","https://openalex.org/W4241915176","https://openalex.org/W4253990512"],"related_works":["https://openalex.org/W3123702486","https://openalex.org/W2019081563","https://openalex.org/W2377701455","https://openalex.org/W2155614503","https://openalex.org/W2402400303","https://openalex.org/W2134861634","https://openalex.org/W2042830833","https://openalex.org/W4293870911","https://openalex.org/W1720966280","https://openalex.org/W1982585569"],"abstract_inverted_index":{"The":[0],"Proportional":[1,30,57,75,99],"Scheduler":[2,31,58,76],"was":[3],"recently":[4],"proposed":[5],"as":[6],"a":[7,136],"scheduling":[8,154],"algorithm":[9],"for":[10,46,102,187],"multi-hop":[11],"switch":[12,189],"networks.":[13,48,190],"For":[14,24,111],"these":[15],"networks,":[16,104],"the":[17,21,29,50,56,70,74,78,85,98,118,131,170,175],"BackPressure":[18,45],"scheduler":[19],"is":[20,32,134],"classical":[22],"benchmark.":[23],"networks":[25,113,180],"with":[26],"fixed":[27],"routing,":[28],"maximum":[33],"stable,":[34],"myopic":[35],"and,":[36],"furthermore,":[37],"will":[38],"alleviate":[39],"certain":[40],"scaling":[41],"issues":[42],"found":[43],"in":[44,181],"large":[47,171],"Nonetheless,":[49],"equilibrium":[51,71,106,176],"and":[52,122],"delay":[53],"properties":[54],"of":[55,73,80,174,178],"have":[59],"not":[60],"been":[61,90],"fully":[62],"characterized.":[63],"In":[64],"this":[65,147],"article,":[66],"we":[67,116,139,159,168],"postulate":[68],"on":[69,155],"behaviour":[72,173],"through":[77],"analysis":[79],"an":[81],"analogous":[82],"rule":[83],"called":[84],"Store-Forward":[86,93,103,179],"allocation.":[87],"It":[88],"has":[89],"shown":[91],"that":[92,161],"allocates":[94],"asymptotically":[95],"according":[96],"to":[97,151,183],"Scheduler.":[100],"Further,":[101],"numerous":[105],"quantities":[107],"are":[108,164],"explicitly":[109],"calculable.":[110],"FIFO":[112,188],"under":[114],"Store-Forward,":[115],"calculate":[117],"policies":[119],"stationary":[120,132],"distribution":[121,133,177],"end-to-end":[123],"route":[124],"delay.":[125],"We":[126,145],"discuss":[127],"network":[128],"topologies":[129],"where":[130,158],"product-form,":[135],"phenomenon":[137],"which":[138],"call":[140],"product":[141,148],"form":[142,149],"resource":[143],"pooling.":[144],"extend":[146],"notion":[150],"independent":[152],"set":[153],"perfect":[156],"graphs,":[157],"show":[160],"non-neighbouring":[162],"queues":[163],"statistically":[165],"independent.":[166],"Finally,":[167],"analyse":[169],"deviations":[172],"order":[182],"construct":[184],"Lyapunov":[185],"functions":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}