The enhanced ticket-based routing algorithm

The delay-constrained least-cost routing problem is to find the least cost path which satisfies a given delay constraint. There are two major difficulties to solve in this problem. The first difficulty is the NP-completeness of this routing problem. The second difficulty is that the networking information used for routing may be imprecise. The ticket-based routing (TBR) algorithm, aiming to find a sub-optimal solution, provides a heuristic approach to overcome the above difficulties and solve the routing problem. Although TBR proposes a detailed ticket forwarding method based on imprecise end-to-end information, it does not optimize the ticket probing process so as to find better paths. This paper proposes an enhanced ticket-based routing (ETBR) algorithm. The ETBR improves the effectiveness of ticket probing by two techniques. The first technique uses color-based ticket distribution for tickets of different colors. The tracing information of green tickets and yellow tickets is kept separately to avoid unnecessary ticket dropping. The second technique uses historical probing results to optimize ticket probing, so that redundant probing paths are eliminated. Through extensive simulations, we demonstrate that the ETBR can find paths which have much lower cost than TBR, without decreasing the success ratio or increasing the message overhead.

[1]  Zhong Fan,et al.  Multiple QoS constrained routing with inaccurate state information , 1999 .

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

[3]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[4]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[5]  Satish K. Tripathi,et al.  Improving QoS Routing Performance Under Inaccurate Link State Information , 1999 .

[6]  Jie Zhang,et al.  Resource reservation mechanisms for distributed multi-path quality of service routing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[7]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 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.

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

[9]  Xin Yuan,et al.  Impact of resource reservation on the distributed multi-path quality of service routing scheme , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).