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.