Scalability issue for QoS routing algorithm with stochastic partitioning

Authors:
A. Montaser;M. E. Woodward
Affiliations:
University of Bradford, Bradford, West Yorkshire, UK;University of Bradford, Bradford, West Yorkshire, UK
Venue:
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Year:
2005

Citing 3
Cited 0

Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Scalability in communication networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the challenging issues in the environment of large networks with routing algorithms, including quality of service (QoS) routing algorithms is scalability network. This paper studies partitioning as a technique towards scaling QoS routing algorithms. We develop method to create partitions based on probabilities that reflect the frequency of connection requests between nodes across a network. Our evaluation methodology quantifies the reduction of computational effort to find suitable path between a source and destination. The proposed approach is called stochastic partitioning which is a probabilistic method. The performance is measured in terms of reduction in computational effort.