No / 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.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3063 |
| Date | January 2007 |
| Creators | Woodward, Mike E., Gao, Feng |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, No full-text in the repository |
Page generated in 0.0148 seconds