首页> 外文会议>International Conference on Distributed Computing Systems Workshops >Flow Inspection Router Assignment (FIRA) in Access/Aggregation Network Clouds
【24h】

Flow Inspection Router Assignment (FIRA) in Access/Aggregation Network Clouds

机译:Flow Inspection Router分配(FiRA)在访问/聚合网络云中

获取原文

摘要

Sufficient computing resources available at future generation routers in the access/aggregation networks can be pooled to form a cloud at edge, which we call Access/Aggregation Network Cloud (or ANC). An ANC can be used to handle some of the information processing conventionally done inside the enterprise networks. ANC computing can also result in a much less delay and more flexibility than if such information processing is done centrally in a data center in the core. In this paper, we formulate two representative optimization problems related to Flow Inspection Router Assignment (FIRA) in ANCs. Their objectives are to minimize the (weighted) number of flows that still need to be inspected inside the enterprise network when only some flows can be assigned to the ANC due to the additional flow inspection delay in the ANC, and when all the flows can be assigned to the ANC, to minimize the additional flow inspection delay, respectively. We prove the NP-hardness of these two new problems, study their performance bounds and propose efficient heuristics. We further extend the formulation and solution to support multicast flows. Simulation shows that our heuristic algorithms can perform close to their performance bounds, implying their near optimality and the tightness of the bounds. In addition, simulation also demonstrates how inspection computing resources can be reduced for multicast flows.
机译:可以汇总在访问/聚合网络中的未来生成路由器中可用的足够计算资源以在边沿形成云,我们调用访问/聚合网络云(或ANC)。 ANC可用于处理传统上在企业网络内部完成的信息处理。如果在核心中的数据中心中集中地完成了这样的信息处理,则CANC计算还可以产生更少的延迟和更大的灵活性。在本文中,我们制定了两个与ANC中的流量检查路由器分配(Fira)相关的代表性优化问题。它们的目标是最小化(加权)仍然需要在企业网络内部的流量,只有在ANC中的额外流量检查延迟,并且当所有流动都可以是分配给ANC,以最小化额外的流量检查延迟。我们证明了这两个新问题的NP硬度,研究了他们的绩效界限并提出了高效的启发式。我们进一步扩展了配方和解决方案以支持多播流。仿真表明,我们的启发式算法可以接近其性能界限,这意味着它们的近乎最优性和边界的紧张性。此外,仿真还演示了如何为多播流降低检查资源。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号