当前位置: X-MOL 学术Networks › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Content placement in 5G-enabled edge/core datacenter networks resilient to link cut attacks
Networks ( IF 2.1 ) Pub Date : 2020-06-01 , DOI: 10.1002/net.21930
Carlos Natalino 1 , Amaro de Sousa 2 , Lena Wosinska 1 , Marija Furdek 1
Affiliation  

High throughput, resilience, and low latency requirements drive the development of 5G‐enabled content delivery networks (CDNs) which combine core data centers (cDCs) with edge data centers (eDCs) that cache the most popular content closer to the end users for traffic load and latency reduction. Deployed over the existing optical network infrastructure, CDNs are vulnerable to link cut attacks aimed at disrupting the overlay services. Planning a CDN to balance the stringent service requirements and increase resilience to attacks in a cost‐efficient way entails solving the content placement problem (CPP) across the cDCs and eDCs. This article proposes a framework for finding Pareto‐optimal solutions with minimal user‐to‐content distance and maximal robustness to targeted link cuts, under a defined budget. We formulate two optimization problems as integer linear programming (ILP) models. The first, denoted as K‐best CPP with minimal distance (K‐CPP‐minD), identifies the eDC/cDC placement solutions with minimal user‐to‐content distance. The second performs critical link set detection to evaluate the resilience of the K‐CPP‐minD solutions to targeted fiber cuts. Extensive simulations verify that the eDC/cDC selection obtained by our models improves network resilience to link cut attacks without adversely affecting the user‐to‐content distances or the core network traffic mitigation benefits.

中文翻译:

支持 5G 的边缘/核心数据中心网络中的内容放置可抵御链接切断攻击

高吞吐量、弹性和低延迟要求推动了支持 5G 的内容交付网络 (CDN) 的发展,该网络将核心数据中心 (cDC) 与边缘数据中心 (eDC) 相结合,将最流行的内容缓存在更靠近最终用户的位置以进行流量减少负载和延迟。CDN 部署在现有的光网络基础设施上,容易受到旨在破坏覆盖服务的链接切断攻击。规划 CDN 以平衡严格的服务要求并以经济高效的方式提高对攻击的弹性需要解决跨 cDC 和 eDC 的内容放置问题 (CPP)。本文提出了一个框架,用于在定义的预算下寻找具有最小用户到内容距离和最大鲁棒性的帕累托最优解。我们将两个优化问题表述为整数线性规划 (ILP) 模型。第一个,表示为具有最小距离的 K-best CPP (K-CPP-minD),标识具有最小用户到内容距离的 eDC/cDC 放置解决方案。第二个执行关键链路集检测以评估 K-CPP-minD 解决方案对目标光纤切割的弹性。广泛的模拟验证了我们的模型获得的 eDC/cDC 选择提高了网络对链接切断攻击的弹性,而不会对用户到内容的距离或核心网络流量缓解产生不利影响。第二个执行关键链路集检测以评估 K-CPP-minD 解决方案对目标光纤切割的弹性。广泛的模拟验证了我们的模型获得的 eDC/cDC 选择提高了网络对链接切断攻击的弹性,而不会对用户到内容的距离或核心网络流量缓解产生不利影响。第二个执行关键链路集检测以评估 K-CPP-minD 解决方案对目标光纤切割的弹性。广泛的模拟验证了我们的模型获得的 eDC/cDC 选择提高了网络对链接切断攻击的弹性,而不会对用户到内容的距离或核心网络流量缓解产生不利影响。
更新日期:2020-06-01
down
wechat
bug