A multi-constrained distributed QoS routing algorithm

Multi-criteria QoS routing has been regarded by researchers as a vital mechanism to support multimedia communications. Unfortunately, finding a qualified path meeting the multiple criteria is indeed a very difficult problem to solve. Multi-path-constrained routing problems are considered to be NP complete, and most existing QoS routing algorithms are based on maintaining global network state at every node. This paper proposes a multi-constrained flooding-based QoS routing with minimum computation and implementation complexity which relies on local link-state information only. It takes the least delay to establish a QoS connection which meets all QoS requirements and addresses the "over-reservation" problem of the flooding-based QoS routing in an elegant and efficient manner. We study the performance of the proposed algorithm, in terms of blocking probability, routing overhead, and connection set-up time, through simulation.

[1]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[2]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[3]  Anujan Varma,et al.  Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.

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

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

[6]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[8]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

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

[10]  Hung Keng Pung,et al.  Fast and efficient flooding based QoS routing algorithm , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

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

[12]  C. Siva Ram Murthy,et al.  A new distributed route selection approach for channel establishment in real-time networks , 1999, TNET.

[13]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[14]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

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

[16]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..