This paper presents an extension to a clustering algorithm used for the heuristic calculation of switch location and interconnection in large networks. The original algorithm, a geometric form of weighted, representative reduction is constrained by a maximum load limit for replacement nodes. This has the effect of permitting more than one switch in a neighbourhood, possibly at the same site, more realistically reflecting the requirements of certain types of network. Also, with tighter weight constraints, a faster, more efficient heuristic is seen to perform slightly better than before.
展开▼
