A distributed parallel QoS routing algorithm with multi-path probing

Authors:
Zhuo Guo;Jianzhong Qiao;Shukuan Lin;Xueliang Cai
Affiliations:
College of Information Science and Engineering, Northeastern University, Liaoning Province, China;College of Information Science and Engineering, Northeastern University, Liaoning Province, China and Key Laboratory of Software System Application and Development Generic Technology, Liaoning Pro ...;College of Information Science and Engineering, Northeastern University, Liaoning Province, China;College of Information Science and Engineering, Northeastern University, Liaoning Province, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Year:
2009

Citing 11
Cited 0

Internetworking with TCP/IP: principles, protocols, and architecture

Internetworking with TCP/IP: principles, protocols, and architecture
A randomized algorithm for finding a path subject to multiple QoS requirements

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A distributed route-selection scheme for establishing real-time channels

Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
Distributed Quality-of-Service Routing in High-Speed Networks Based on Selective Probing

LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
Multi-Path Routing combined with Resource Reservation

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed QoS Routing with Imprecise State Information

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Conditions that impact the complexity of QoS routing

IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing

IEEE Transactions on Computers
Data Structures, Algorithms, And Applications In C++

Data Structures, Algorithms, And Applications In C++
Quality of service based routing algorithms for heterogeneous networks [Guest editorial]

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The task of Quality-of-Service(QoS) routing is to find a path in the network that satisfies certain constraints on metrics such as bandwidth, delay, delay jitter and cost. All recently-published QoS routing algorithms consider one or two metrics and most of them require the maintenance of a global network state at each node. This paper is proposed a distributed routing algorithm which require every node to maintain only its local state. The state information of intermediate nodes is collectively used to guide the routing messages along the most appropriate paths in order to maximize the success probability. It not only keeps the merits of simplicity and low link overhead in traditional QoS routing algorithm, but also can reduce resource fragments and admit more services into a network with heavy load.