A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms
Woodward, Mike E. Gao, Feng
Woodward, Mike E.
Gao, Feng
Publication Date
2007
End of Embargo
Supervisor
Rights
Peer-Reviewed
Yes
Open Access status
Accepted for publication
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
This paper presents a new partitioning strategy with the objective of increasing scalability by reducing computational effort of routing in networks. The original network is partitioned into blocks (subnetworks) so that there is a bi-directional link between any two blocks. When there is a connection request between a pair of nodes, if the nodes are in the same block, we only use the small single block to derive routings. Otherwise we combine the two blocks where the two nodes locate and in this way the whole network will never be used. The strategy is generic in that it can be used in any underlying routing algorithms in the network layer and can be applied to any networks with fixed topology such as fixed wired subnetworks of the Internet. The performance of this strategy has been investigated by building a simulator in Java and a comparison with existing stochastic partitioning techniques is shown to give superior performance in terms of trade-off in blocking probability (the probability of failure to find a path between source and destination satisfying QoS constraints) and reduction of computational effort.
Version
No full-text in the repository
Citation
Gao F and Woodward ME (2007) A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms. Computer Networks. 51(6): 1705-1724.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article