A distributed parallel QoS routing algorithm with multi-path probing

The task of Quality-of-Service(QoS) routing is to find a path in the network that satisfies certain constraints on metrics such as bandwidth, delay, delay jitter and cost. All recently-published QoS routing algorithms consider one or two metrics and most of them require the maintenance of a global network state at each node. This paper is proposed a distributed routing algorithm which require every node to maintain only its local state. The state information of intermediate nodes is collectively used to guide the routing messages along the most appropriate paths in order to maximize the success probability. It not only keeps the merits of simplicity and low link overhead in traditional QoS routing algorithm, but also can reduce resource fragments and admit more services into a network with heavy load.

[1]  Piet Van Mieghem,et al.  Conditions that impact the complexity of QoS routing , 2005, IEEE/ACM Transactions on Networking.

[2]  Sartaj Sahni,et al.  Data Structures, Algorithms, and Applications in C++ , 1997 .

[3]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in high-speed networks based on selective probing , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[4]  Sartaj Sahni,et al.  Approximation algorithms for multiconstrained quality-of-service routing , 2006, IEEE Transactions on Computers.

[5]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[6]  Sartaj Sahni,et al.  An online heuristic for maximum lifetime routing in wireless sensor networks , 2006, IEEE Transactions on Computers.

[7]  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).

[8]  Azzedine Boukerche,et al.  Quality of service based routing algorithms for heterogeneous networks [Guest editorial] , 2007, IEEE Communications Magazine.

[9]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS requirements , 2001, Comput. Networks.

[10]  Kang G. Shin,et al.  A distributed route-selection scheme for establishing real-time channels , 1995, HPN.

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

[12]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

[13]  Athanasios K. Tsakalidis,et al.  Data Structures , 2011 .

[14]  Klara Nahrstedt,et al.  Distributed QoS routing with imprecise state information , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .