• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Transparent Optical Networks >Anycast (re)routing of multi-period traffic in dimensioning resilient backbone networks for multi-site data centers
【24h】

Anycast (re)routing of multi-period traffic in dimensioning resilient backbone networks for multi-site data centers

机译：在确定多站点数据中心的弹性骨干网规模时，多周期流量的任意播送（重新路由）

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the problem of dimensioning resilient backbone networks for cloud-like scenarios where demand is to be served at one among several candidate data centers (DCs), and where that demand varies over time, which we assume to be slotted. We thus consider multi-period traffic, for which we need to find routes to both a primary DC and a backup DC (in case the primary, or the network connection towards it, fails) and account also for synchronization traffic (following its own routes) between the two chosen DCs. We propose a path formulation and adopt a column generation approach: the (restricted) master problem (RMP) selects “configurations” to use for each demand in each of the time periods, while pricing problems (PPs) construct new, potentially cost-reducing configurations for a given demand. Our model allows for several PPs to be solved in parallel, and we demonstrate the time savings achieved by doing so. We compare several anycast (re)routing strategies, where we allow traffic that spans multiple periods to either (i) not be rerouted in different periods, (ii) only change the backup DC and routes, or (iii) freely change both primary and backup DC choices and routes towards them.
机译：我们考虑了为类似云的方案确定弹性骨干网的尺寸的问题，在这种情况下，需求将在几个候选数据中心（DC）中的一个中服务，并且该需求随时间而变化（我们假定是按时隙划分）。因此，我们考虑了多周期流量，为此，我们需要查找到主DC和备用DC的路由（以防主DC或与之连接的网络连接失败），并且还要考虑同步流量（遵循其自身的路由） ）在两个选定的DC之间。我们提出一条路径公式并采用一种列生成方法：（受限）主问题（RMP）选择“配置”以在每个时间段内用于每种需求，而定价问题（PP）构成了新的，可能降低成本的给定需求的配置。我们的模型允许并行解决多个PP，我们演示了这样做所节省的时间。我们比较了几种任播（重新）路由策略，在这些策略中，我们允许跨越多个时间段的流量要么（i）在不同时间段内不重新路由，（ii）仅更改备用DC和路由，要么（iii）自由更改主要和备份DC选择并路由到它们。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号