• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computer networks >Multi-hour network planning based on domination between sets of traffic matrices
【24h】

Multi-hour network planning based on domination between sets of traffic matrices

机译：基于流量矩阵集之间的支配时间的多小时网络规划

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the week can be exploited. This paper investigates the application of the traffic domination relation between sets of traffic matrices to multi-hour network planning. Two problem variants are considered: a network with a static, and with a dynamic traffic routing. We derive a set of techniques for, given a multi-hour traffic demand potentially composed of hundreds of matrices, obtaining a traffic series with a smaller number of matrices. The traffic domination relation guarantees that the network designed for the simplified series is suitable for the original one. Also, we apply the domination relation to derive lower bounds to the network cost, and upper bounds to the suboptimality incurred by simplifying the traffic demand. The algorithms proposed are tested in a case of study with the Abilene network. In our tests, a long traffic series could be reduced to a small number of traffic matrices, and be effective for network planning.
机译：在数小时的网络设计中，在确定尺寸的过程中要考虑到交通流量随时间的周期性变化。然后，可以利用一天或一周中流量高峰的不一致。本文研究了交通矩阵之间的交通支配关系在多小时网络规划中的应用。考虑了两个问题变体：具有静态网络和动态流量路由的网络。对于给定可能由数百个矩阵组成的多小时流量需求，我们得出了一组技术，以获取具有较少矩阵数量的流量序列。流量控制关系确保为简化系列设计的网络适合于原始网络。另外，我们应用支配关系来推导网络成本的下限，并通过简化流量需求而导致次优性的上限。在Abilene网络研究的情况下，对提出的算法进行了测试。在我们的测试中，长流量系列可以减少为少量流量矩阵，并且对于网络规划有效。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号