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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
