{"id":"https://openalex.org/W2135425811","doi":"https://doi.org/10.1145/1015467.1015497","title":"Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler","display_name":"Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler","publication_year":2004,"publication_date":"2004-08-30","ids":{"openalex":"https://openalex.org/W2135425811","doi":"https://doi.org/10.1145/1015467.1015497","mag":"2135425811"},"language":"en","primary_location":{"id":"doi:10.1145/1015467.1015497","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1015467.1015497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications","raw_type":"proceedings-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/A5015054071","display_name":"Paolo Valente","orcid":"https://orcid.org/0000-0002-1842-4974"},"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":"Paolo Valente","raw_affiliation_strings":["Universit\u00e0 di Pisa, Italy","Universita di Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Universita di Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015054071"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":2.7103,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.9017223,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"269","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9994000196456909,"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/T10138","display_name":"Network Traffic and Congestion Control","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/global-positioning-system","display_name":"Global Positioning System","score":0.7466826438903809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6954182386398315},{"id":"https://openalex.org/keywords/generalized-processor-sharing","display_name":"Generalized processor sharing","score":0.586329460144043},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.552703320980072},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5234279632568359},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5086268186569214},{"id":"https://openalex.org/keywords/network-scheduler","display_name":"Network scheduler","score":0.462898850440979},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4543655216693878},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3964571952819824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37202519178390503},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.3092547059059143},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2223028540611267},{"id":"https://openalex.org/keywords/transmission-delay","display_name":"Transmission delay","score":0.2179233729839325},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21586072444915771},{"id":"https://openalex.org/keywords/processing-delay","display_name":"Processing delay","score":0.167880117893219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1579483449459076},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.14862802624702454},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.13117298483848572}],"concepts":[{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.7466826438903809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6954182386398315},{"id":"https://openalex.org/C200651375","wikidata":"https://www.wikidata.org/wiki/Q5532503","display_name":"Generalized processor sharing","level":5,"score":0.586329460144043},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.552703320980072},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5234279632568359},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5086268186569214},{"id":"https://openalex.org/C163099246","wikidata":"https://www.wikidata.org/wiki/Q1978975","display_name":"Network scheduler","level":5,"score":0.462898850440979},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4543655216693878},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3964571952819824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37202519178390503},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.3092547059059143},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2223028540611267},{"id":"https://openalex.org/C108921912","wikidata":"https://www.wikidata.org/wiki/Q7834639","display_name":"Transmission delay","level":3,"score":0.2179233729839325},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21586072444915771},{"id":"https://openalex.org/C21434264","wikidata":"https://www.wikidata.org/wiki/Q7247320","display_name":"Processing delay","level":4,"score":0.167880117893219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1579483449459076},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.14862802624702454},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.13117298483848572},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1015467.1015497","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1015467.1015497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.3373","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.3373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sigcomm.org/sigcomm2004/papers/p410-valente111.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W117611736","https://openalex.org/W1495775250","https://openalex.org/W1593096882","https://openalex.org/W1600795850","https://openalex.org/W1867018545","https://openalex.org/W2049429083","https://openalex.org/W2104276806","https://openalex.org/W2108669526","https://openalex.org/W2117907118","https://openalex.org/W2123088319","https://openalex.org/W2124827397","https://openalex.org/W2132493857","https://openalex.org/W2139475785","https://openalex.org/W2148253102","https://openalex.org/W2154509734","https://openalex.org/W2156530904","https://openalex.org/W2162128924","https://openalex.org/W2171872428","https://openalex.org/W2562160379","https://openalex.org/W2752885492","https://openalex.org/W2799213254","https://openalex.org/W3145128584","https://openalex.org/W4232721844","https://openalex.org/W4255970238"],"related_works":["https://openalex.org/W2069264494","https://openalex.org/W2151463257","https://openalex.org/W2172009019","https://openalex.org/W1597107533","https://openalex.org/W2364890844","https://openalex.org/W1917112730","https://openalex.org/W2141358973","https://openalex.org/W2091999583","https://openalex.org/W2131843493","https://openalex.org/W2382677107"],"abstract_inverted_index":{"Generalized":[0],"Processor":[1],"Sharing":[2],"(GPS)":[3],"is":[4,27,45,134],"a":[5,24,138],"fluid":[6],"scheduling":[7],"policy":[8],"providing":[9],"perfect":[10],"fairness.":[11],"The":[12],"minimum":[13,43,192],"deviation":[14,44,100,133,193],"(lead/lag)":[15],"with":[16,86,159,198],"respect":[17],"to":[18,59,109,130],"the":[19,32,37,71,94,102,126,171,175,191,195,204,211,214],"GPS":[20,55,61,103,157,180,196],"service":[21,197],"achievable":[22],"by":[23,217],"packet":[25,29,39,67,176],"scheduler":[26,40,139],"one":[28],"size.":[30],"To":[31],"best":[33],"of":[34,73,96,173,213],"our":[35,185],"knowledge,":[36],"only":[38],"guaranteeing":[41],"such":[42,141,168],"Worst-case":[46],"Fair":[47,49],"Weighted":[48],"Queueing":[50],"(WF2Q),":[51],"that":[52,125,154],"requires":[53],"on-line":[54],"simulation.":[56,181],"Existing":[57],"algorithms":[58],"perform":[60],"simulation":[62,158],"have":[63,89],"O(N)":[64,82,99],"complexity":[65,83,88,129,163,172],"per":[66],"transmission":[68],"(N":[69],"being":[70],"number":[72],"competing":[74],"flows).":[75],"Hence":[76],"WF2Q":[77],"has":[78,106,122,143],"been":[79,90,107,123],"charged":[80],"for":[81,112],"too.":[84],"Schedulers":[85],"lower":[87,127,206],"devised,":[91],"but":[92],"at":[93,97],"price":[95],"least":[98],"from":[101,194],"service,":[104],"which":[105],"shown":[108],"be":[110],"detrimental":[111],"real-time":[113],"adaptive":[114],"applications":[115],"and":[116,164],"feedback":[117],"based":[118,178],"applications.":[119],"Furthermore,":[120,208],"it":[121,169],"proven":[124],"bound":[128],"guarantee":[131],"O(1)":[132],"\u03a9(log":[135],"N),":[136],"yet":[137],"achieving":[140],"result":[142],"remained":[144],"elusive":[145],"so":[146],"far.In":[147],"this":[148],"paper":[149],"we":[150,189,209],"present":[151],"an":[152],"algorithm":[153,186],"performs":[155],"exact":[156],"O(log":[160,199],"N)":[161,200],"worst-case":[162],"small":[165],"constants.":[166],"As":[167],"improves":[170],"all":[174],"schedulers":[177],"on":[179],"In":[182],"particular,":[183],"using":[184],"within":[187],"WF2Q,":[188],"achieve":[190],"complexity,":[201],"thus":[202],"matching":[203],"aforementioned":[205],"bound.":[207],"assess":[210],"effectiveness":[212],"proposed":[215],"solution":[216],"simulating":[218],"real-world":[219],"scenarios.":[220]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}