An enhanced algorithm for multiple constraints optimal path calculation

One of the key issues in the design of a QoS-oriented service is how to identify a feasible route which satisfies multiple constraints while simultaneously achieving efficient utilization of network resource. The underlying problem can be stated as a multiple constraint optimal path (MCOP) problem. Some algorithms have been proposed in the literature, but they suffered from various disadvantages and cannot meet the practical requirements. A formal definition of the MCOP problem is stated. A novel enhanced heuristic algorithm for solving the MCOP problem is proposed, in which elegant path searching techniques are used to achieve higher performance in terms of path selection success ratio and average path cost. The advantage of the proposed algorithm is verified via extensive simulations on networks with random topologies and link weights. The impact of some key design parameters on the performance is discussed.

[1]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[2]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2000, SIGMETRICS '00.

[3]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[5]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[6]  Jianzhong Zhou,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, ICCT'98. 1998 International Conference on Communication Technology. Proceedings (IEEE Cat. No.98EX243).

[7]  T. M. Chen,et al.  Reliable services in MPLS , 1999, IEEE Commun. Mag..

[8]  Ariel Orda,et al.  Routing with end to end QoS guarantees in broadband networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[11]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

[12]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[13]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).