A Resource Management Algorithm Based On Multi-path Maz-min Fairness

摘要：

The Bandwidth Broker proposed to manage the resources for DiffServ networks has two ways to implement, namely centralized and distributed approach. The distributed Bandwidth Broker offers scalability advantages over the centralized one, but the improper pre-compute of resource will make its bandwidth allocation unfair. The solution to this issue is characterized by a new fairness criterion, multi-path max-min fairness. In this paper, we generalize single-path max-min fairness to multi-path, and show that the multi-path max-min fairness allocation is relevant to bottleneck links. Based on multi-path max-min fairness, we propose a new resource management algorithm for the distributed Bandwidth Broker scheme. The experiment results show that our resource management algorithm is better than previous one from the aspect of fairness.

关键词： resource management Bandwidth Broken maz-min fairness bottleneck link

作者: Zhang Min Wu chunming Jiang Ming Yu Jing

作者单位: Zhejiang University Computer Science College Hangzhou,China Hangzhou Dianzi University Computer Scie Zhejiang University Computer Science College Hangzhou,China Hangzhou Dianzi University Computer Science College Hangzhou,China National Digital Switching System Engineering & Technology R&D Center Zhengzhou,China

会议类型: 国际会议

会议名称: 2009 First International Conference on Future Information Networks(第一届未来信息网络国际会议)

会议地点: 北京

会议语种:英文

页码: 76-80

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