Clustering for the Design of SONET Rings in Interoffice Telecommunications
针对SONET环网设计中逻辑环配置的复杂问题，提出基于聚类的办公室分组方法，并开发禁忌搜索启发式算法寻找最优或近优解，对电信网络规划者有用。
Optical fiber systems play an essential role in today's telecommunications networks. The recently standardized SONET (Synchronous Optical Network) technology has made rings the preferred architecture for designing survivable networks. The network design problem is very complex in nature, because it involves not only the configuration of rings at the logical level, but also the mapping of this configuration into physical fiber paths. This paper deals with the problem of finding optimal clusters of offices, which can be used as the basis for designing logical rings. A mathematical model of the problem is presented, and a heuristic solution based on the tabu search framework is developed to find optimal or near-optimal solutions.