Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.

Description

No / A new scheme is presented for partitioning a network having a specific number of nodes and degree of connectivity such that the number of operations required to find a constrained path between a source node and destination node, averaged over all source-destination pairs, is minimised. The scheme can speed up the routing function, possibly by orders of magnitude under favourable conditions, at the cost of a sub-optimal solution.

Links & Downloads

1. Woodward, M.E. and Al-Fawaz, M.M.(2004). Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks. IEE Proceedings - Communications. Vol. 151, No. 1, pp. 95-100.
2. http://hdl.handle.net/10454/3256
3. https://doi.org/10.1049/ip-com:20040150

Tags

Performance evaluation

Scalability

Optimization

Partition method

Network routing

Computer network

Additional Fields

Identifer	oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3256
Date	January 2004
Creators	Woodward, Mike E., Al-Fawaz, M.M.
Source Sets	Bradford Scholars
Language	English
Detected Language	English
Type	Article, No full-text available in the repository