关键词: 拓扑设计, 分区, 最短路径, 可选路径

Abstract: The basic principle of Resource Partitioning Algorithm[1,2] is to apply the idea of partitioning to the network topology design. In this paper, we modify the original Resource Partition Algorithm by redefining two key parameters, i.e., length tolerance and hop-count limit, in order to optimize the design of access network topology. We also present the experiment on an example access network to illustrate the efficacy of our algorithm.

Key words: Topology design, partitioning, shortest path, plausible path/alternative