A Max-min Fairness and NBS Model for Bandwidth Allocation

摘要：

In this paper, we use max-min fairness and the idea of NBS GNash bargaining solution) from cooperative game theory to allocate bandwidth automatically. In our model, any users basic bandwidth requirement as well as fairness must be guaranteed. If the capacity is smaller than the sum of initial requirements, we use max-min fairness to decide which connection will be refused. After solving the access problem, we use Nash bargaining solution for bandwidth allocation of elastic services in high-speed networks. We also propose a distributed algorithm to implement optimal and fair bandwidth allocation.

关键词： max-min fairness Nash bargaining solution(NBS) bandwidth allocation fairness

作者: CHEN Jing LU Quan

作者单位: School of computer science Wuhan University Wuhan, Hubei Province, China School of information management Wuhan University Wuhan, Hubei Province, China

会议类型: 国际会议

会议名称: 第一届国际计算机新科技与教育学术会议(Proceedings of the First International Conference on Computer Science & Education ICCSE2006)

会议地点: 厦门

会议语种:英文

页码: 742-745

在线出版日期: 2006-07-27（万方平台首次上网日期，不代表论文的发表时间）