A Delay Constraint Optimal Path Algorithm for Ad Hoc MPLS Networks

摘要

Multiple constraints optimal path (MCOP) problem is a key problem of Ad Hoc MPLS Networks. For the restricted computing and memory capability of Ad Hoc networks node equipments, the MCOP problem of Ad Hoc MPLS Networks is more difficult than the current networks. In this paper, a novel Ad Hoc networks delay constraint optimal path (ADCOP) algorithm is proposed. By reduced the search region of the algorithm, the efficiency of algorithm can be improved effectively and an optimal loop-less path can be gotten. The self-adapting parameter design is adopted in this algorithm to improve the adaptability on the network scale. Using extensive simulations on random graphs and random assigned link weights, the huge improvement in complexity of the new algorithm is tested. The test also indicates that the algorithm has more adaptability and more practicability.