Multi-constraint-pruning: an algorithm for finding K shortest paths subject to multiple constraints

The main task of network resilience research is: when network is failure how to find a replacement path for the affected business as soon as possible, and also guarantee the quality of service (QoS). Different businesses have different QoS needs, in order to find a best resilience routing for different business, we need to take into account a variety of constraints, it has also increased the routing complexity. In this paper, a new algorithm to calculate the first K multiple-constrained-shortest-paths (KMCSP) in a given constraints network has been presented. We call it multi-constraint-pruning algorithm. The algorithm is able to calculate the k shortest paths based on the required constraints weights. In different QoS, the weight of different priority for each constraint would be considered in the algorithm. The program we wrote for multiple-pruning algorithm is able to list the KMCSP for different QoS, and draw a graphic represent the KMCSP. After extensive experiments in Matlab environment, the feasibility and speed improvement of algorithm has been proved in this paper.

[1]  Ke Xu,et al.  Precomputation for intra-domain QoS routing , 2005, Comput. Networks.

[2]  Arun K. Somani,et al.  Optimal wavelength converter placement in arbitrary topology wavelength-routed networks , 2003, Comput. Commun..

[3]  Zhaohui Zhang,et al.  Quality of Service Extensions to OSPF or Quality Of Service Path First Routing (QOSPF) , 1997 .

[4]  Anand Srinivasan,et al.  A New Algorithm to Compute Alternate Paths in Reliable OSPF ( ROSPF ) , 2002 .

[5]  Anirudha Sahoo.  An OSPF based load sensitive QoS routing algorithm using alternate paths , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[6]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Marília Curado,et al.  Deployment of Class-Based Routing in Wide Area Networks: Cost and Performance Assessment , 2003, HSNMC.

[8]  K. R. Venugopal,et al.  A heuristic for placement of limited range wavelength converters in all-optical networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .

[10]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[11]  Yishay Mansour,et al.  A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization , 1998, ICML.

[12]  Edmundo Monteiro,et al.  Quality of service routing in the differentiated services framework , 2001, SPIE Optics East.