Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
On the effectiveness of alternative paths in QoS routing: Research Articles
International Journal of Communication Systems
A routing protocol for dynamic and large computer networks with clustering topology
Computer Communications
Scalability in communication networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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 sub-networks 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.