Localized QoS routing algorithm based on residual bandwidth

Authors:
Turki A. AlGhamdi;M. E. Woodward
Affiliations:
Department of Computing, School of Informatics, University of Bradford, Bradford, UK;Department of Computing, School of Informatics, University of Bradford, Bradford, UK
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 9
Cited 0

Dynamic alternative routing

Routing in communications networks
Evaluating the impact of stale link state on quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
Adaptive proportional routing: a localized QoS routing approach

IEEE/ACM Transactions on Networking (TON)
Survey of QoS routing

ICCC '02 Proceedings of the 15th international conference on Computer communication
On path selection for traffic with bandwidth guarantees

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On selection of candidate paths for proportional routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Localized Credit Based QoS Routing: Performance Evaluation Using

ANSS '06 Proceedings of the 39th annual Symposium on Simulation
Weighted Random Routing on Torus Networks

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

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Localized routing is the method to avoid this problem. New localized routing algorithms called Highest Minimum Bandwidth routing (HMB) is introduced in this paper. The new algorithm is compared under different traffic loads and network topologies to the existing localized Credit Based Routing (CBR) and the global WSP routing algorithm. New algorithm shows better performance without undue increase in complexity. The selection of disjoint paths and recalculation of the set of candidate paths, which assist both existing localized routing and our novel algorithm to achieve superior performance, are also described.