A Fast Branch and Bound Based Algorithm for Bandwidth Allocation and QoS Routing on Class-based IP Networks

摘要：

We present a bandwidth allocation scheme offering optimal solutions to the network optimization problem. The bandwidth allocation policy in classbased communication networks can be determined with utility functions. This scheme is formulated as a mixed-integer nonlinear programming model, which prepares a routing table identifying suitable end-toend paths upon each connection request. A fast branch and bound algorithm is proposed for solving the network optimization problem efficiently.

关键词： bandwidth allocation QoS routing branch and bound algorithm

作者: Chia-Hung Wang Hsing Luh

作者单位: Department of Mathematical Sciences, National Chengchi University No. 64, Section 2, ZhiNan Road, We Department of Mathematical Sciences, National Chengchi University No. 64, Section 2, ZhiNan Road, We

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 169-174

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