{"id":"https://openalex.org/W1494413017","doi":"https://doi.org/10.1109/glocom.2002.1189065","title":"An efficient packet fair queueing (PFQ) architecture for latency rate server","display_name":"An efficient packet fair queueing (PFQ) architecture for latency rate server","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W1494413017","doi":"https://doi.org/10.1109/glocom.2002.1189065","mag":"1494413017"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2002.1189065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2002.1189065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","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/A5100757796","display_name":"Haitao Wu","orcid":"https://orcid.org/0000-0003-3173-3322"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haitao Wu","raw_affiliation_strings":["National Key Laboratory of Switching Technology and Telecommunication Networks, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Key Laboratory of Switching Technology and Telecommunication Networks, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003556558","display_name":"Shiduan Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shiduan Cheng","raw_affiliation_strings":["National Key Laboratory of Switching Technology and Telecommunication Networks, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Key Laboratory of Switching Technology and Telecommunication Networks, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053122805","display_name":"Jian Ma","orcid":"https://orcid.org/0000-0003-2644-5756"},"institutions":[{"id":"https://openalex.org/I4210099903","display_name":"Nokia (China)","ror":"https://ror.org/01607kg94","country_code":"CN","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210099903"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Ma","raw_affiliation_strings":["Nokia China Research and Development Center, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia China Research and Development Center, Beijing, China","institution_ids":["https://openalex.org/I4210099903"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"2420","last_page":"2424"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8292213678359985},{"id":"https://openalex.org/keywords/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.7195895910263062},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5636826753616333},{"id":"https://openalex.org/keywords/generalized-processor-sharing","display_name":"Generalized processor sharing","score":0.5617889165878296},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5200355052947998},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5186282992362976},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.49392563104629517},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4773447811603546},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.472973495721817},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4345988631248474},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.15039607882499695},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.10563158988952637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08878767490386963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8292213678359985},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.7195895910263062},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5636826753616333},{"id":"https://openalex.org/C200651375","wikidata":"https://www.wikidata.org/wiki/Q5532503","display_name":"Generalized processor sharing","level":5,"score":0.5617889165878296},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5200355052947998},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5186282992362976},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.49392563104629517},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4773447811603546},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.472973495721817},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4345988631248474},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.15039607882499695},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.10563158988952637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08878767490386963},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2002.1189065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2002.1189065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1867018545","https://openalex.org/W2058819785","https://openalex.org/W2073440460","https://openalex.org/W2097827578","https://openalex.org/W2099440788","https://openalex.org/W2100892891","https://openalex.org/W2110398403","https://openalex.org/W2123923802","https://openalex.org/W2130251049","https://openalex.org/W2132493857","https://openalex.org/W2139475785","https://openalex.org/W2145248957","https://openalex.org/W2148253102","https://openalex.org/W2163198511","https://openalex.org/W2167195657","https://openalex.org/W2176566884","https://openalex.org/W3097540521","https://openalex.org/W6668949099"],"related_works":["https://openalex.org/W2379707329","https://openalex.org/W2107682335","https://openalex.org/W3151854040","https://openalex.org/W1566006727","https://openalex.org/W4205575766","https://openalex.org/W1867018545","https://openalex.org/W1489964476","https://openalex.org/W2581865514","https://openalex.org/W2132767805","https://openalex.org/W1912482272"],"abstract_inverted_index":{"The":[0,50],"queuing/scheduling":[1],"algorithm":[2],"is":[3,55,125],"one":[4],"of":[5,14,36],"the":[6,24,58,96,132],"most":[7],"important":[8],"mechanisms":[9],"to":[10,44,57,61,79,102],"provide":[11],"guaranteed":[12],"quality":[13],"service":[15,111],"(QoS)":[16],"in":[17,52,120],"high":[18],"speed":[19],"packet-switched":[20],"networks.":[21],"By":[22],"computing":[23],"system":[25,63,82,88,105],"virtual":[26,31,83,106],"time":[27,84],"and":[28],"per":[29,109],"packet/connection":[30],"start/finish":[32],"time,":[33,112],"a":[34,126],"number":[35],"packet":[37,110,117],"fair":[38],"queueing":[39],"(PFQ)":[40],"algorithms":[41],"are":[42],"designed":[43],"simulate":[45],"GPS":[46],"(generalized":[47],"processor":[48],"sharing).":[49],"difference":[51],"computation":[53],"complexity":[54],"due":[56],"variable":[59],"ways":[60],"compute":[62],"time.":[64],"Many":[65],"algorithms,":[66],"including":[67],"WFQ/WF/sup":[68],"2/Q,":[69],"SCFQ,":[70],"SPFQ,":[71],"WF/sup":[72],"2/Q+,":[73],"VC,":[74],"etc.,":[75],"have":[76],"been":[77],"proposed":[78],"use":[80],"different":[81],"(also":[85],"known":[86],"as":[87],"potential)":[89],"function.":[90],"This":[91],"paper":[92],"proves":[93],"that":[94,129],"all":[95,131],"latency-rate":[97],"(LR)":[98],"servers":[99],"only":[100],"need":[101],"calculate":[103],"their":[104],"times":[107],"once":[108],"no":[113],"matter":[114],"how":[115],"many":[116],"arrivals":[118],"occur":[119],"this":[121],"interval.":[122],"Thus,":[123],"it":[124],"general":[127],"scheme":[128],"benefits":[130],"well-known":[133],"LR":[134],"PFQ":[135],"algorithms.":[136]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}