Title :
Limiting performance of stochastic partitioning in network routing
Author :
Woodward, M.E. ; Deb, Swati Sinha
Author_Institution :
Dept. of Comput. & Math., Bradford Univ., UK
fDate :
2/6/2003 12:00:00 AM
Abstract :
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.
Keywords :
network topology; probability; quality of service; telecommunication network routing; communication networks; computational effort; network routing; network topology; routing algorithm; scalability; stochastic partitioning;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20030222