Limiting performance of stochastic partitioning in network routing
M.E. Woodward, Swati Sinha Deb · Electronics Letters · 2003
The limiting performance of stochastic partitioning in enhancing the scalability of routing algorithms for communication networks is investigated. It is shown that, under certain assumptions relating to the network topology, stochastic partitioning will allow any routing algorithm to scale to an arbitrarily large network while the computational effort remains finite and bounded.