The Unicast Multi-Constraint Routing Algorithm Based on Lagrangian Relaxation Method
The QoS routing is a hot issue in research,among which the QoS multi-constraint routing is a difficult problem.Pointing out a weak point in the H_MCOP algorithm,the author successfully applies geometric series and binary search algorithm to it,and gets a heuristic routing algorithm of the QoS multi-constrained routing.And the author makes simulation basedon NS2,the results of which indicate that this algorithm can find a low COSt path and the calculation costs to find the path is low too.
QoS Routing Muti-Constraint Lagrangian relaxation
Jiang Yinghua Zhang Min Ren Jinan Ji Honming
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
870-873
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）