Nonlinear search based pre-computation path selection algorithm

Authors:
Deng Bo;Zheng Yanxing;Wang Xiaoqiing
Affiliations:
Beijing Institute of System Engineering, People's Republic of China;Beijing Institute of System Engineering, People's Republic of China;Beijing Institute of System Engineering, People's Republic of China
Venue:
CSECS'08 Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing
Year:
2008

Citing 6
Cited 0

Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing multimedia traffic with QoS guarantees

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

Computer Communications
Performance evaluation of constraint-based path selection algorithms

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-constraints path selection is an important problem challenging Quality of Service routing(QoSR). There are two classes of QoSR algorithms, namely linear and nonlinear search based QoSR algorithms. For linear search based algorithms, they loss some feasible paths sometimes even they search in all directions. While for nonlinear search based algorithms, even the best existing solutions require a few iterations of Dijkstra algorithm, reducing the speed of response. We, for the first time, propose a nonlinear search pre-computation algorithm that gives better responsiveness and higher success rate in identifying feasible paths. Simulations validate the efficiency of our algorithm.