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...
| Main Authors: | , |
|---|---|
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10454/3256 |
| Summary: | 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. |
|---|