A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms
Publication date
2007Keyword
Telecommunication networkFailures
JAVA language
Performance evaluation
Simulator
Internet
Topological structure
Network architecture
Bidirectional link
Network routing
Computational complexity
Routing algorithm
Stochastic method
Partition method
Peer-Reviewed
Yes
Metadata
Show full item recordAbstract
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 repositoryCitation
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 Version of Record
https://doi.org/10.1016/j.comnet.2006.09.004Type
Articleae974a485f413a2113503eed53cd6c53
https://doi.org/10.1016/j.comnet.2006.09.004