Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
Woodward, Mike E. Al-Fawaz, M.M.
Woodward, Mike E.
Al-Fawaz, M.M.
Publication Date
2004
End of Embargo
Supervisor
Rights
Peer-Reviewed
Yes
Open Access status
closedAccess
Accepted for publication
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
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.
Version
No full-text in the repository
Citation
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.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article