Highly responsive and efficient qos routing using pre- and on-demand computations along with a new normal measure

Authors:
Yanxing Zheng;Turgay Korkmaz;Wenhua Dou
Affiliations:
School of Computer Science, National University of Defense Technology, ChangSha, HuNan, P.R. China;Department of Computer Science, University of Texas, San Antonio;School of Computer Science, National University of Defense Technology, ChangSha, HuNan, P.R. China
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 7
Cited 0

A randomized algorithm for finding a path subject to multiple QoS requirements

Computer Networks: The International Journal of Computer and Telecommunications Networking
Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

SIAM Journal on Optimization
Bandwidth-delay constrained path selection under inaccurate state information

IEEE/ACM Transactions on Networking (TON)
Routing multimedia traffic with QoS guarantees

IEEE Transactions on Multimedia
TAMCRA: a tunable accuracy multiple constraints routing algorithm

Computer Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Performance evaluation of constraint-based path selection algorithms

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-constrained path (MCP) selection is one of the great challenges that QoS routing (QoSR) faces. To address it in an efficient and highly responsive manner, we propose a new QoSR algorithm, namely NM_MCP. Using the Dijkstra's algorithm with respect to each link metric, NM_MCP pre-computes k primary paths, where k is the number of link weights. When a routing request arrives, it executes a modified version of the Dijkstra's algorithm using a newly proposed, normal-measure-based nonlinear cost function.