Show simple item record

dc.contributor.authorWoodward, Mike E.
dc.contributor.authorAl-Fawaz, M.M.
dc.date.accessioned2009-08-10T09:18:08Z
dc.date.available2009-08-10T09:18:08Z
dc.date.issued2004
dc.identifier.citationWoodward, 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.en
dc.identifier.urihttp://hdl.handle.net/10454/3256
dc.descriptionNoen
dc.description.abstractA 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.en
dc.language.isoenen
dc.relation.isreferencedbyhttp://dx.doi.org/10.1049/ip-com:20040150en
dc.subjectPerformance evaluationen
dc.subjectScalabilityen
dc.subjectOptimizationen
dc.subjectPartition methoden
dc.subjectNetwork routingen
dc.subjectComputer networken
dc.titlePartitioning Techniques for Reducing Computational Effort of Routing in Large Networks.en
dc.status.refereedYesen
dc.typeArticleen
dc.type.versionNo full-text available in the repositoryen


This item appears in the following Collection(s)

Show simple item record