{"id":"https://openalex.org/W2152523383","doi":"https://doi.org/10.1109/pccc.2003.1203735","title":"Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources","display_name":"Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources","publication_year":2003,"publication_date":"2003-10-31","ids":{"openalex":"https://openalex.org/W2152523383","doi":"https://doi.org/10.1109/pccc.2003.1203735","mag":"2152523383"},"language":"en","primary_location":{"id":"doi:10.1109/pccc.2003.1203735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2003.1203735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference Proceedings of the 2003 IEEE International","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/A5073763391","display_name":"Yunkai Zhou","orcid":"https://orcid.org/0000-0002-3225-1897"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yunkai Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001920041","display_name":"Harish Sethu","orcid":"https://orcid.org/0000-0002-0724-0707"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Sethu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"495","last_page":"504"},"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9983000159263611,"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/fairness-measure","display_name":"Fairness measure","score":0.8688383102416992},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7891634106636047},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.759454607963562},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5930882692337036},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5870195627212524},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.548408031463623},{"id":"https://openalex.org/keywords/fair-queuing","display_name":"Fair queuing","score":0.5452104806900024},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4831189811229706},{"id":"https://openalex.org/keywords/end-to-end-principle","display_name":"End-to-end principle","score":0.47776854038238525},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.4674215018749237},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4444953203201294},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4332568049430847},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.42036324739456177}],"concepts":[{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.8688383102416992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7891634106636047},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.759454607963562},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5930882692337036},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5870195627212524},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.548408031463623},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.5452104806900024},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4831189811229706},{"id":"https://openalex.org/C74296488","wikidata":"https://www.wikidata.org/wiki/Q2527392","display_name":"End-to-end principle","level":2,"score":0.47776854038238525},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.4674215018749237},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4444953203201294},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4332568049430847},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.42036324739456177},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pccc.2003.1203735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2003.1203735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference Proceedings of the 2003 IEEE International","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.46","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.46","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.drexel.edu/CCL/papers/compcommun-mra.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":22,"referenced_works":["https://openalex.org/W1867018545","https://openalex.org/W2028008625","https://openalex.org/W2073440460","https://openalex.org/W2097831241","https://openalex.org/W2098230371","https://openalex.org/W2098293598","https://openalex.org/W2100785182","https://openalex.org/W2114556314","https://openalex.org/W2120938471","https://openalex.org/W2128056079","https://openalex.org/W2139995534","https://openalex.org/W2148887091","https://openalex.org/W2152486473","https://openalex.org/W2158733823","https://openalex.org/W2159777336","https://openalex.org/W2166248905","https://openalex.org/W2176566884","https://openalex.org/W2562160379","https://openalex.org/W3144105281","https://openalex.org/W3163287424","https://openalex.org/W6682476667","https://openalex.org/W6683969366"],"related_works":["https://openalex.org/W2114791561","https://openalex.org/W2361713743","https://openalex.org/W1999684000","https://openalex.org/W2084765981","https://openalex.org/W2024808683","https://openalex.org/W2168281124","https://openalex.org/W2160893738","https://openalex.org/W2163922947","https://openalex.org/W1521255234","https://openalex.org/W2161808571"],"abstract_inverted_index":{"As":[0],"flows":[1,11,42,118,193],"of":[2,14,35,43,67,93,109,116,129,143,149,151,155,194,200,203,209],"traffic":[3,44,117],"traverse":[4],"a":[5,12,38,54,91,114,126,146,169,180,184,207],"network,":[6],"they":[7],"share":[8,119],"with":[9,125,183],"other":[10,230],"variety":[13],"resources":[15,36,70,121],"such":[16,157],"as":[17,90,158],"links,":[18],"buffers":[19],"and":[20,163,186,211,236],"router":[21],"CPUs":[22],"in":[23,32,37,50,64,71,122,229,232],"their":[24],"path.":[25],"Fairness":[26,144],"is":[27,74,111],"an":[28,187],"intuitively":[29],"desirable":[30],"property":[31],"the":[33,65,69,72,76,94,107,123,132,140,152,201],"allocation":[34,52,86,215],"network":[39,73,124],"shared":[40,55,127,190],"among":[41,191],"from":[45],"different":[46],"users.":[47],"While":[48],"fairness":[49,63,80,156,162,166,210],"bandwidth":[51],"over":[53,168],"link":[56,189],"has":[57],"been":[58],"extensively":[59],"studied,":[60],"overall":[61],"end-to-end":[62,99],"use":[66,135],"all":[68],"ultimately":[75],"desired":[77],"goal.":[78],"End-to-end":[79],"becomes":[81],"especially":[82],"critical":[83],"when":[84,113],"fair":[85,112],"algorithms":[87,216],"are":[88],"used":[89,96,228],"component":[92],"mechanisms":[95],"to":[97,105,134,179],"provide":[98],"quality-of-service":[100],"guarantees.":[101],"This":[102],"paper":[103],"seeks":[104],"answer":[106],"question":[108],"what":[110],"set":[115],"multiple":[120],"order":[128],"preference":[130],"for":[131],"opportunity":[133],"these":[136],"resources.":[137],"We":[138,172],"present":[139],"Generalized":[141],"Principle":[142],"(GPF),":[145],"powerful":[147],"extension":[148],"any":[150],"classic":[153],"notions":[154],"max-min":[159,165],"fairness,":[160],"proportional":[161],"utility":[164],"defined":[167],"single":[170],"resource.":[171],"illustrate":[173],"this":[174,219],"principle":[175],"by":[176],"applying":[177],"it":[178],"system":[181,238],"model":[182],"buffer":[185,214,222],"output":[188],"competing":[192],"traffic.":[195],"To":[196],"complete":[197],"our":[198],"illustration":[199],"applicability":[202],"GPF":[204,224],"we":[205],"propose":[206],"measure":[208],"evaluate":[212],"representative":[213],"based":[217],"on":[218],"measure.":[220],"Besides":[221],"allocation,":[223],"may":[225],"also":[226],"be":[227],"contexts":[231],"data":[233],"communication":[234],"networks":[235],"operating":[237],"design.":[239]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}