Aggregate Flow Fairness in MANs

Paul Stoian, I. Cidon
{"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.
MANs中的聚合流公平性
城域网和骨干网由“用户”共享,这些用户可以是个人、组织以及通信服务提供商。这些用户同时产生来自多个网络位置的各种流量模式。传统的公平性定义将带宽分配给各个源到目的流。这些单独的流公平性定义通常为具有更多流的用户分配更多带宽,从而在用户级别上造成不公平。本文探讨了可选的用户级公平标准。我们研究了最大最小公平性的几个扩展,它们公平地为用户分配带宽。我们要求新标准基于最大最小定义,向后兼容传统的最大最小公平性(当每个用户有单个流时),并且不为任何单个流分配零带宽。我们描述了向用户公平分配带宽的三种不同标准。首先是加权最大最小标准,通过分配给每个流的权重来实现用户公平性;第二种方法尝试在每个链路上分别平衡用户分配;最后,我们引入了一种新的方案,称为重新定义的向量空间公平性,该方案基于用户和个人流的字典排序最大化。本文从行为和数值两个方面对这三种公平定义进行了评价。仿真结果表明,重新定义的向量空间公平性在用户公平性和总体吞吐量方面都有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信