QoS Aware and Fair Resource Allocation Scheme in Transport Networks

Transparent Optical Networks, 2006 International Conference(2006)

引用 2|浏览7
暂无评分
摘要
This paper presents a QoS aware fair routing and bandwidth management method for transport networks. We consider a variant of the maximum concurrent multicommodity flow problem where only paths of bounded length are allowed to carry flow. We show two possible approaches to the problem. First, we give a column generation method, where the Bellman-Ford algorithm provides the path of bounded length with minimum reduced cost. Then we present an epsi-approximation scheme to the problem, applying the method of Garg and Konemann with new ideas for speedup. Finally the computational experience is presented
更多
查看译文
关键词
bandwidth allocation,quality of service,telecommunication network management,telecommunication network routing,bellman-ford algorithm,qos aware fair routing,bandwidth management method,column generation method,epsi-approximation scheme,fair resource allocation scheme,maximum concurrent multicommodity flow problem,transport networks,qos,approximation method,bandwidth management,faire routing,multicommodity flow,operations research,column generation,resource allocation,switches,routing,bandwidth,computer experiment,resource management,polynomials,approximation algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要