SDH网络规划中PRC接入网元选取算法
DOI:
CSTR:
作者:
作者单位:

河海大学计算机与信息学院南京211000

作者简介:

通讯作者:

中图分类号:

TN915.11

基金项目:


Accessed network elements of PRC algorithm for SDH network planning
Author:
Affiliation:

Hohai University,Nanjing 21100,China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为了实现SDH网络的时钟同步规划,提出了一种基于迭代思想的PRC接入网元的选取方案。通过设定同步网络规划原则中的参数,根据所有网元到备选网元的时钟跟踪长度,按照有效跳数内覆盖网元个数尽可能多、覆盖网元的平均时钟跟踪长度尽可能小、PRC在网络中部署尽可能均匀3条原则进行迭代,计算出PRC接入网元,并且通过MATLAB编写了该算法。该算法能够通过计算机自动计算代替人工规化PRC接入网元,有效地降低了时钟同步规划工作的困难性,在能够保证规划方案性能的同时提高了规划效率。

    Abstract:

    In order to complete the clock synchronization planning of SDH network, this paper introduces a selection scheme of the accessed network elements of PRC based on iteration thought. Through setting the parameters in the synchronization network planning principles, according to the clock track distance from all the network elements to alternative network elements. In order to make the number of network elements covered within effective jump number as many as possible and make the average clock track distance of network elements covered as short as possible and make the PRC in the network as wellproportioned as possible. Iteration will make the results optimal. This scheme is encoded in MATLAB platform. This algorithm can intelligently plan out the network elements of PRC by automatic calculation instead of manual planning and reduce the difficulty of clock synchronization planning effectively. Meanwhile, it can improve the planning efficiency while ensuring the performance of the planning scheme.

    参考文献
    相似文献
    引证文献
引用本文

陈晓阳,张扬. SDH网络规划中PRC接入网元选取算法[J].电子测量技术,2016,39(12):44-47

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2017-02-21
  • 出版日期:
文章二维码