Towards Scaling QoS Routing Using Partitioning Technique

Abstract — Scalability is the primary challenge to studying large networks. 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