{"title":"Aggregate Flow Fairness in MANs","authors":"Paul Stoian, I. Cidon","doi":"10.1109/LANMAN.2007.4295979","DOIUrl":null,"url":null,"abstract":"MANs and backbone networks are shared by \"users\" that can be individuals, organizations as well as communication service providers. Such users produce concurrently a variety of traffic patterns from multiple network locations. Traditional fairness definitions allocate bandwidth to individual source to destination flows. These individual flow fairness definitions generally allocate more bandwidth to users with a larger number of flows, thus creating unfairness at the user level. This paper explores alternative user level fairness criteria. We examine several extensions of the max-min fairness that allocate bandwidth fairly to users. We require the new criteria to be based on a max-min definition, to be backward compatible with the traditional max-min fairness (when each user has a single flow) and not to allocate zero bandwidth to any individual flow. We describe three different criteria for fair bandwidth allocation to users. The first is a weighted max-min criteria, achieving user fairness by the weights assigned to each flow; The second attempts to balance the user allocation separately over each link; Finally, we introduce a novel scheme termed the redefined vector-space fairness that is based on a lexicographical maximization of both user and individual flows. This paper evaluates the three fairness definitions both behaviorally and numerically. The simulation results show a clear advantage for the redefined vector-space fairness both in terms of user fairness and overall throughput.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.2007.4295979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
MANs and backbone networks are shared by "users" that can be individuals, organizations as well as communication service providers. Such users produce concurrently a variety of traffic patterns from multiple network locations. Traditional fairness definitions allocate bandwidth to individual source to destination flows. These individual flow fairness definitions generally allocate more bandwidth to users with a larger number of flows, thus creating unfairness at the user level. This paper explores alternative user level fairness criteria. We examine several extensions of the max-min fairness that allocate bandwidth fairly to users. We require the new criteria to be based on a max-min definition, to be backward compatible with the traditional max-min fairness (when each user has a single flow) and not to allocate zero bandwidth to any individual flow. We describe three different criteria for fair bandwidth allocation to users. The first is a weighted max-min criteria, achieving user fairness by the weights assigned to each flow; The second attempts to balance the user allocation separately over each link; Finally, we introduce a novel scheme termed the redefined vector-space fairness that is based on a lexicographical maximization of both user and individual flows. This paper evaluates the three fairness definitions both behaviorally and numerically. The simulation results show a clear advantage for the redefined vector-space fairness both in terms of user fairness and overall throughput.