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

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 sc...

Full description

Bibliographic Details
Main Authors: Woodward, Mike E., Al-Fawaz, M.M.
Language:en
Published: 2009
Subjects:
Performance evaluation
Scalability
Optimization
Partition method
Network routing
Computer network
Online Access:http://hdl.handle.net/10454/3256
id ndltd-BRADFORD-oai-bradscholars.brad.ac.uk-10454-3256
record_format oai_dc
spelling ndltd-BRADFORD-oai-bradscholars.brad.ac.uk-10454-32562019-08-31T03:02:09Z Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks. Woodward, Mike E. Al-Fawaz, M.M. Performance evaluation Scalability Optimization Partition method Network routing Computer network 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. 2009-08-10T09:18:08Z 2009-08-10T09:18:08Z 2004 Article No full-text available in the repository 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. http://hdl.handle.net/10454/3256 en http://dx.doi.org/10.1049/ip-com:20040150
collection NDLTD
language en
sources NDLTD
topic Performance evaluation
Scalability
Optimization
Partition method
Network routing
Computer network
spellingShingle Performance evaluation
Scalability
Optimization
Partition method
Network routing
Computer network
Woodward, Mike E.
Al-Fawaz, M.M.
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.
author Woodward, Mike E.
Al-Fawaz, M.M.
author_facet Woodward, Mike E.
Al-Fawaz, M.M.
author_sort Woodward, Mike E.
title Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
title_short Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
title_full Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
title_fullStr Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
title_full_unstemmed Partitioning Techniques for Reducing Computational Effort of Routing in Large Networks.
title_sort partitioning techniques for reducing computational effort of routing in large networks.
publishDate 2009
url http://hdl.handle.net/10454/3256
work_keys_str_mv AT woodwardmikee partitioningtechniquesforreducingcomputationaleffortofroutinginlargenetworks
AT alfawazmm partitioningtechniquesforreducingcomputationaleffortofroutinginlargenetworks
_version_ 1719239488207585280

Similar Items