An effective randomized QoS routing algorithm on networks with inaccurate parameters
- 31 Downloads
This paper develops an effective randomized on-demand QoS routing algorithm on networks with inaccurate link-state information. Several new techniques are proposed in the algorithm. First, the maximum safety rate and the minimum delay for each node in the network are pre-computed, which simplify the network complexity and provide the routing process with useful information. The routing process is dynamically directed by the safety rate and delay of the partial routing path developed so far and by the maximum safety rate and the minimum delay of the next node. Randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the safety rate and delay of the routing path. A network testing environment has been established and five parameters are introduced to measure the performance of QoS routing algorithms. Experimental results demonstrate that in terms of the proposed parameters, the algorithm outperforms existing QoS algorithms appearing in the literature.
KeywordsQoS network routing randomized algorithm link-state information performance measure
Unable to display preview. Download preview PDF.
- Guérin R, Orda A. QoS routing in networks with inaccurate information: Theory and algorithms.IEEE/ACM Trans. Networking, June, 1990, 7(6): 350–364.Google Scholar
- Zhi-Li Zhang. End-to-end support for statistical quality-of-service guarantees in multimedia networks [dissertation]. University of Massachusetts at Amherst, Amherst, MA, Feb., 1997.Google Scholar
- Shenker S, Partridge C, Guérin R. Specification of Guaranteed Quality of Service. RFC 2212, IETF, Sept., 1997.Google Scholar
- Rajagopalan B, Sandick H. A Framework for QoS-based Routing in the Internet. RFC 2386, IETF, Aug., 1998.Google Scholar
- Apostolopoulos G, Guérin R, Kamat S, Tripathi S. Improving QoS routing performance under inaccurate link state information. InProc. ITC’16, June, 1999, pp.1351–1362.Google Scholar
- Shaikh A, Rexford J, Shin K. Dynamics of quality-of-service routing with inaccurate link-state information. Univ. of Michigan, Ann Arbor, MI, Tech. Rep. CSE-TR-350-97, Nov., 1997.Google Scholar
- Ma Q, Steenkiste P. Quality-of-service routing for traffic with performance guarantees. InIFIP Fifth International Workshop on Quality of Service (NY), May, 1997, pp.115–126.Google Scholar
- Korkmaz T, Krunz M. A randomized algorithm for finding a path subject to multiple QoS constraints. InProceedings of GLOBECOM’99, Dec., 1999, pp.1694–1698.Google Scholar
- Apostolopoulos G, Guérin R, Kamat S, Tripathi S. Quality of service based routing: A performance perspective. InProc. of ACM SIGCOMM’98 (Vancouver, Canada), Oct., 1998, pp.17–28.Google Scholar
- Kamat S, Guérin R, Orda A, Przygienda T. QoS Routing Mechanisms and OSPF Extensions. RFC 2676, IETF, Aug., 1999.Google Scholar
- Wang Jianxin, Wang Weiping Chen Jian’er, Chen Songqiao. A randomized QoS routing algorithm on networks with inaccurate link-state information. InProc. the 16th World Computer Conference, International Conference of Communication Technology, Beijing, Aug., 2000, pp.1617–1622.Google Scholar