【24h】

An algorithm for broadband network dimensioning

机译:宽带网络规模确定算法

获取原文

摘要

Dimensioning and designing broadband networks are big challenges for a network operator. Considering the functionality accompanying ATM-based networks, there is a necessity of having network planning procedures being able to exploit the advantages provided by ATM. One of the benefits is potential use of Virtual Paths, which then could ompose a set of logical networks within the physical network. this paper presents algorithms for dimensioning broadband networks and for designing VP networks. The algorithms are based on a decomposition approach, where the locations are examined one by one. therefore, more comprehensive relationships than found in most of the design algorithms using global optimisation could be applied. Due to the modularity further enhancements could be used within the algorithms with respect to, for instance, network element functionality, traffic handling principles, cost model, network design objectives and traffic approximations.
机译:尺寸和设计宽带网络是网络运营商面临的巨大挑战。考虑到伴随基于ATM的网络的功能,有必要使网络规划程序能够利用ATM提供的优点。好处之一是可以潜在地使用虚拟路径,然后可以将物理网络中的一组逻辑网络摆放在一起。本文提出了用于确定宽带网络尺寸和设计VP网络的算法。该算法基于分解方法,其中逐一检查位置。因此,可以应用比使用全局优化的大多数设计算法中发现的关系更全面的关系。由于模块化,可以在算法内使用例如关于网元功能,流量处理原理,成本模型,网络设计目标和流量近似的进一步增强。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号