Return to search

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

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.

Identiferoai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3256
Date January 2004
CreatorsWoodward, Mike E., Al-Fawaz, M.M.
Source SetsBradford Scholars
LanguageEnglish
Detected LanguageEnglish
TypeArticle, No full-text in the repository

Page generated in 0.0025 seconds