北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 研究报告 • 上一篇    下一篇

资源分区算法应用于接入网设计(增刊)

卢放鸣

  

  1. 北京邮电大学继续教育学院(即北京邮电大学通信网络综合技术研究所;北京邮电大学培训中心)
  • 收稿日期:2006-10-13 修回日期:2007-01-12 出版日期:2007-06-30 发布日期:2007-06-30
  • 通讯作者: 贾嘉

Resource Partitioning Algorithm for Access Network Design

  • Received:2006-10-13 Revised:2007-01-12 Online:2007-06-30 Published:2007-06-30

摘要: 对网络拓朴采用分区的概念进行设计,是资源分区算法[1,2]的基本思想。本文发展了资源分区算法, 通过调整该算法中的两个关键参数-长度容限和跳数约束寻找可行路径,从而完成接入网网络设计,并通过模拟设计实验进行了验证。

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

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