{"title":"On the Trade-offs between User-to-Replica Distance and CDN Robustness to Link Cut Attacks","authors":"C. Natalino, A. Sousa, L. Wosinska, M. Furdek","doi":"10.1109/RNDM.2018.8489838","DOIUrl":null,"url":null,"abstract":"Content Delivery Networks (CDNs) are a key enabler for geographically-distributed content delivery with high throughput and low latency. As CDNs utilize the underlying optical core network infrastructure, they inherit its vulnerability to targeted link cut attacks which can cause severe service degradation. One of the fundamental problems in CDN configuration is deciding on the placement of content replicas across the underlying network of data centers, which should obtain balance among multiple, often conflicting performance criteria. This paper investigates the implications of minimizing the average distance between the users and the content replicas on the CDN robustness to targeted link cuts.To this end, we compute Pareto-optimal replica placement solutions with minimal user-to-replica distance and maximal robustness to link cut attacks of the highest damaging potential. k-best replica placement solutions in terms of the user-to-replica distance are calculated by formulating the problem as an Integer Linear Programming (ILP) exact method. For each replica placement solution, the worst case link cut attack scenario is identified by defining the Critical Link Set Detection (CLSD) problem. CLSD returns the link set whose cutting disconnects the maximal number of nodes from the content. We develop an ILP model for the CLSD and evaluate the robustness of the resulting CDN attack scenario in terms of mean content accessibility. The approach is evaluated through extensive simulations on real-world reference topologies, indicating that it is possible to improve the robustness to link cuts at the expense of small user-to-replica distance penalties. Moreover, the improvement of robustness is more significant for topologies with smaller average node degree and when cuts involve a larger number of links.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2018.8489838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
Content Delivery Networks (CDNs) are a key enabler for geographically-distributed content delivery with high throughput and low latency. As CDNs utilize the underlying optical core network infrastructure, they inherit its vulnerability to targeted link cut attacks which can cause severe service degradation. One of the fundamental problems in CDN configuration is deciding on the placement of content replicas across the underlying network of data centers, which should obtain balance among multiple, often conflicting performance criteria. This paper investigates the implications of minimizing the average distance between the users and the content replicas on the CDN robustness to targeted link cuts.To this end, we compute Pareto-optimal replica placement solutions with minimal user-to-replica distance and maximal robustness to link cut attacks of the highest damaging potential. k-best replica placement solutions in terms of the user-to-replica distance are calculated by formulating the problem as an Integer Linear Programming (ILP) exact method. For each replica placement solution, the worst case link cut attack scenario is identified by defining the Critical Link Set Detection (CLSD) problem. CLSD returns the link set whose cutting disconnects the maximal number of nodes from the content. We develop an ILP model for the CLSD and evaluate the robustness of the resulting CDN attack scenario in terms of mean content accessibility. The approach is evaluated through extensive simulations on real-world reference topologies, indicating that it is possible to improve the robustness to link cuts at the expense of small user-to-replica distance penalties. Moreover, the improvement of robustness is more significant for topologies with smaller average node degree and when cuts involve a larger number of links.
内容交付网络(cdn)是具有高吞吐量和低延迟的地理分布式内容交付的关键推动者。由于cdn利用底层的光核心网络基础设施,它们继承了其易受定向链路切断攻击的脆弱性,这可能导致严重的业务降级。CDN配置中的一个基本问题是决定在数据中心的底层网络中放置内容副本,这应该在多个经常相互冲突的性能标准之间取得平衡。本文研究了最小化用户和内容副本之间的平均距离对CDN对目标链路切割的鲁棒性的影响。为此,我们计算了具有最小用户到副本距离和最大鲁棒性的帕累托最优副本放置解决方案,以应对具有最高破坏性潜力的链接切断攻击。通过将问题表述为整数线性规划(ILP)精确方法,计算了用户到副本距离的k-最佳副本放置解。对于每个副本放置解决方案,通过定义关键链路集检测(Critical link Set Detection, CLSD)问题来确定最坏情况下的链路切断攻击场景。CLSD返回链接集,其切割将最大数量的节点与内容断开连接。我们为CLSD开发了一个ILP模型,并根据平均内容可访问性评估了由此产生的CDN攻击场景的鲁棒性。该方法通过对现实世界参考拓扑的广泛模拟进行了评估,表明可以以较小的用户到副本距离惩罚为代价提高链接切割的鲁棒性。此外,对于平均节点度较小的拓扑结构和切割涉及较多链路的拓扑结构,鲁棒性的提高更为显著。