Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489830
Igor Kotenko, I. Saenko, O. Lauta
In the paper the term cyber resilience is interpreted as the stability of computer networks or systems operating under impact of cyber attacks and other negative impacts, including influence of inappropriate, dubious and harmful information. We consider an approach for construction of analytical models of cyber attacks and negative impacts based on the stochastic networks conversion. This approach has high accuracy and stability of the decisions and has worked well for modeling multi-stage stochastic processes of different nature. The result of the modeling is the distribution function of the time and the average time for implementation of cyber attacks. We also build analytical models for implementation of countermeasures, and integrate them with the analytical models of cyber. As the result the integrated analytical model of the behavior of computer networks under conditions of cyber actions is formed. They allow one to estimate and to choose the most effective countermeasures. These estimates are then used to find the indicators of cyber resilience. The results of experimental evaluation of cyber resilience of computer networks and discussion are given.
{"title":"Analytical modeling and assessment of cyber resilience on the base of stochastic networks conversion","authors":"Igor Kotenko, I. Saenko, O. Lauta","doi":"10.1109/RNDM.2018.8489830","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489830","url":null,"abstract":"In the paper the term cyber resilience is interpreted as the stability of computer networks or systems operating under impact of cyber attacks and other negative impacts, including influence of inappropriate, dubious and harmful information. We consider an approach for construction of analytical models of cyber attacks and negative impacts based on the stochastic networks conversion. This approach has high accuracy and stability of the decisions and has worked well for modeling multi-stage stochastic processes of different nature. The result of the modeling is the distribution function of the time and the average time for implementation of cyber attacks. We also build analytical models for implementation of countermeasures, and integrate them with the analytical models of cyber. As the result the integrated analytical model of the behavior of computer networks under conditions of cyber actions is formed. They allow one to estimate and to choose the most effective countermeasures. These estimates are then used to find the indicators of cyber resilience. The results of experimental evaluation of cyber resilience of computer networks and discussion are given.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131232085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489843
K. Walkowiak, Piotr Lechowicz, M. Klinkowski
In this article, we address the problem of survivable routing in spectrally-spatially flexible optical networks (SS-FONs) with dedicated path protection (DPP). The considered SS-FON supports spectral super-channel transmissions, in which flexible signal regeneration is realized with transceivers operating in back-to-back (B2B) configurations. We propose an Adaptive Survivable Routing with Back-to-Back Regeneration (ASRBR) algorithm to realize dynamic routing requests protected with the DPP method. The ASRBR algorithm is aware of limited spectrum and transceivers resources and makes use of the flexibility of the B2B regeneration. With the use of the ASRBR algorithm, we examine potential performance gains in terms of bandwidth blocking probability (BBP) in two regeneration scenarios: a reference one in which the use of regenerators is minimized and the modulation conversion is not allowed and intentional regeneration with possible modulation conversion. We analyze the efficiency of ASRBR for a set of various network scenarios using two representative topologies. Evaluation results show that the proposed method outperforms other reference algorithms. Moreover, the flexible B2B regeneration provides better utilization of both spectrum and transceiver resources, resulting in lower BBP than the minimal regeneration scenario. Finally, we study potential performance gains from applying a squeezed protection approach.
{"title":"Survivable Routing in Spectrally-Spatially Flexible Optical Networks with Back-to-Back Regeneration","authors":"K. Walkowiak, Piotr Lechowicz, M. Klinkowski","doi":"10.1109/RNDM.2018.8489843","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489843","url":null,"abstract":"In this article, we address the problem of survivable routing in spectrally-spatially flexible optical networks (SS-FONs) with dedicated path protection (DPP). The considered SS-FON supports spectral super-channel transmissions, in which flexible signal regeneration is realized with transceivers operating in back-to-back (B2B) configurations. We propose an Adaptive Survivable Routing with Back-to-Back Regeneration (ASRBR) algorithm to realize dynamic routing requests protected with the DPP method. The ASRBR algorithm is aware of limited spectrum and transceivers resources and makes use of the flexibility of the B2B regeneration. With the use of the ASRBR algorithm, we examine potential performance gains in terms of bandwidth blocking probability (BBP) in two regeneration scenarios: a reference one in which the use of regenerators is minimized and the modulation conversion is not allowed and intentional regeneration with possible modulation conversion. We analyze the efficiency of ASRBR for a set of various network scenarios using two representative topologies. Evaluation results show that the proposed method outperforms other reference algorithms. Moreover, the flexible B2B regeneration provides better utilization of both spectrum and transceiver resources, resulting in lower BBP than the minimal regeneration scenario. Finally, we study potential performance gains from applying a squeezed protection approach.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132029541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489838
C. Natalino, A. Sousa, L. Wosinska, M. Furdek
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攻击场景的鲁棒性。该方法通过对现实世界参考拓扑的广泛模拟进行了评估，表明可以以较小的用户到副本距离惩罚为代价提高链接切割的鲁棒性。此外，对于平均节点度较小的拓扑结构和切割涉及较多链路的拓扑结构，鲁棒性的提高更为显著。
{"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":"https://doi.org/10.1109/RNDM.2018.8489838","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.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123512248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489829
A. Basuki, F. Kuipers
Localizing network link failures is crucial to guarantee sufficient network capacity and to efficiently manage network resources. However, since most of today’s networks use link aggregation to increase bandwidth, localizing a single physical link failure within such aggregated links is challenging. In this paper, we propose and evaluate methods, for both legacy networks as well as SDN networks, to localize link failures in the presence of aggregated links.For legacy networks, we propose STreLo for localizing single link failures. We compare STreLo to a state-of-the-art solution, called SCMon, and show that, at the expense of using more probe packets, it is faster and uses less MPLS labels. Since probe packets are small, we deem the trade-off beneficial.For SDN networks, we propose StaF, which works in a decentralized way, requires no controller interaction, and can adapt to topological changes. Moreover, StaF can localize multi-link failures. Both approaches have been tested via Mininet implementations and experiments.
{"title":"Localizing link failures in legacy and SDN networks","authors":"A. Basuki, F. Kuipers","doi":"10.1109/RNDM.2018.8489829","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489829","url":null,"abstract":"Localizing network link failures is crucial to guarantee sufficient network capacity and to efficiently manage network resources. However, since most of today’s networks use link aggregation to increase bandwidth, localizing a single physical link failure within such aggregated links is challenging. In this paper, we propose and evaluate methods, for both legacy networks as well as SDN networks, to localize link failures in the presence of aggregated links.For legacy networks, we propose STreLo for localizing single link failures. We compare STreLo to a state-of-the-art solution, called SCMon, and show that, at the expense of using more probe packets, it is faster and uses less MPLS labels. Since probe packets are small, we deem the trade-off beneficial.For SDN networks, we propose StaF, which works in a decentralized way, requires no controller interaction, and can adapt to topological changes. Moreover, StaF can localize multi-link failures. Both approaches have been tested via Mininet implementations and experiments.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489823
H. Cancela, Graciela Ferreira, G. Guerberoff, F. Robledo, P. Romero
A Stochastic Binary System (SBS) is a mathematical model of multi-component on-off systems subject to random failures. SBS models extend classical network reliability models (where the components subject to failure are nodes or links of a graph) and are able to represent more complex interactions between the states of the individual components and the operation of the system under study.The reliability evaluation of stochastic binary systems belongs to the class of ${mathcal{N}}{mathcal{P}}$-Hard computational problems. Furthermore, the number of states is exponential with respect to the size of the system (measured in the number of components). As a consequence, the representation of an SBS becomes a key element in order to develop exact and/or approximation methods for reliability evaluation.We introduce the concept of separable stochastic binary systems, whose structure can be efficiently represented. Reliability bounds for arbitrary SBS are provided inspired by a measure of a distance to a separable system, duality and Chernoff inequality. Opportunities for future work arising from this representation are also discussed.
{"title":"Building Reliability Bounds in Stochastic Binary Systems","authors":"H. Cancela, Graciela Ferreira, G. Guerberoff, F. Robledo, P. Romero","doi":"10.1109/RNDM.2018.8489823","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489823","url":null,"abstract":"A Stochastic Binary System (SBS) is a mathematical model of multi-component on-off systems subject to random failures. SBS models extend classical network reliability models (where the components subject to failure are nodes or links of a graph) and are able to represent more complex interactions between the states of the individual components and the operation of the system under study.The reliability evaluation of stochastic binary systems belongs to the class of ${mathcal{N}}{mathcal{P}}$-Hard computational problems. Furthermore, the number of states is exponential with respect to the size of the system (measured in the number of components). As a consequence, the representation of an SBS becomes a key element in order to develop exact and/or approximation methods for reliability evaluation.We introduce the concept of separable stochastic binary systems, whose structure can be efficiently represented. Reliability bounds for arbitrary SBS are provided inspired by a measure of a distance to a separable system, duality and Chernoff inequality. Opportunities for future work arising from this representation are also discussed.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128940684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489811
Tachun Lin, Zhili Zhou
Network function virtualization enables on-demand network function (NF) deployment providing agile and dynamic network services. Early works on NF focused on its provisioning, design, and management with quality metrics – NF-service availability and reliability under system failure(s). To facilitate flexible NF service recovery and migration with high reliability against random NF-enabled node failures, with a known NF resource pool, we first introduce a new NF service evaluation metric to quantify the minimum reliability among all requested NFs for all end-to-end demands – a tight lower bound on individual NF’s service reliability among all requests. We then study the robust virtual network function (VNF) provisioning problem where only a limited number of VNF instances may be instantiated while maximizing the proposed evaluation metric. We present exact solution approach which guarantees the minimum reliability of all NF service to be in the range [76%, 94%] even when physical nodes may fail with a very high (50%) probability.
{"title":"Robust Virtual Network Function Provisioning Under Random Failures on Network Function Enabled Nodes","authors":"Tachun Lin, Zhili Zhou","doi":"10.1109/RNDM.2018.8489811","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489811","url":null,"abstract":"Network function virtualization enables on-demand network function (NF) deployment providing agile and dynamic network services. Early works on NF focused on its provisioning, design, and management with quality metrics – NF-service availability and reliability under system failure(s). To facilitate flexible NF service recovery and migration with high reliability against random NF-enabled node failures, with a known NF resource pool, we first introduce a new NF service evaluation metric to quantify the minimum reliability among all requested NFs for all end-to-end demands – a tight lower bound on individual NF’s service reliability among all requests. We then study the robust virtual network function (VNF) provisioning problem where only a limited number of VNF instances may be instantiated while maximizing the proposed evaluation metric. We present exact solution approach which guarantees the minimum reliability of all NF service to be in the range [76%, 94%] even when physical nodes may fail with a very high (50%) probability.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116435504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/rndm.2018.8489820
{"title":"RNDM 2018 Index","authors":"","doi":"10.1109/rndm.2018.8489820","DOIUrl":"https://doi.org/10.1109/rndm.2018.8489820","url":null,"abstract":"","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489828
Alija Pašić, Rita Girão-Silva, Bálazs Vass, Teresa Gomes, P. Babarczi
In this paper we present a novel framework for disaster resilience, called FRADIR, which incorporates reliable network design, disaster failure modeling and protection routing in order to improve the availability of mission-critical applications. To the best of our knowledge, this is the first comprehensive framework which utilizes tools from all these fields in a joint design of disaster resilient connections. In particular, we introduce a new probabilistic regional failure model, which does not only take into account the distance from the epicenter of the failure, but includes the (improved) availability values of the network components into the model, too. Based on the failure list generated as the result of the availability-aware disaster failure model, dedicated protection approaches are used to route the connection requests. We demonstrate the concept and benefits of FRADIR through experimental results in two real-like network topologies. Our proof-of-concept implementation shows that with the interplay between protection routing, failure modeling and network update procedure the network performance in terms of blocking probability and average resource consumption can be significantly improved, which makes FRADIR a possible competitor to provide disaster resiliency in critical infrastructures.
{"title":"FRADIR: A Novel Framework for Disaster Resilience","authors":"Alija Pašić, Rita Girão-Silva, Bálazs Vass, Teresa Gomes, P. Babarczi","doi":"10.1109/RNDM.2018.8489828","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489828","url":null,"abstract":"In this paper we present a novel framework for disaster resilience, called FRADIR, which incorporates reliable network design, disaster failure modeling and protection routing in order to improve the availability of mission-critical applications. To the best of our knowledge, this is the first comprehensive framework which utilizes tools from all these fields in a joint design of disaster resilient connections. In particular, we introduce a new probabilistic regional failure model, which does not only take into account the distance from the epicenter of the failure, but includes the (improved) availability values of the network components into the model, too. Based on the failure list generated as the result of the availability-aware disaster failure model, dedicated protection approaches are used to route the connection requests. We demonstrate the concept and benefits of FRADIR through experimental results in two real-like network topologies. Our proof-of-concept implementation shows that with the interplay between protection routing, failure modeling and network update procedure the network performance in terms of blocking probability and average resource consumption can be significantly improved, which makes FRADIR a possible competitor to provide disaster resiliency in critical infrastructures.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131836886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489808
Boro Nedic, M. Gunkel, Teresa Gomes, Rita Girão-Silva
The problem of disaster resilience is of paramount importance in today’s telecommunication networks. Here, this problem is tackled by considering 1+1 optical lightpath protection with maximally SRLG-disjoint paths and geodiversity in a transparent backbone network. Geodiversity was added to make the network more resilient to geographically correlated disasters. The aim is to estimate the increase of the path lengths (fibre lengths) and the increase in cost of the required transponders, with respect to simple link disjointness (no-SRLG nor geodiversity constraints) in a fully transparent optical network. The results obtained in a realistic test network show that SRLG-disjointness already ensures an acceptable geodiversity for the considered network.
{"title":"SRLG-disjointness and geodiverse routing – a practical network study and operational conclusions","authors":"Boro Nedic, M. Gunkel, Teresa Gomes, Rita Girão-Silva","doi":"10.1109/RNDM.2018.8489808","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489808","url":null,"abstract":"The problem of disaster resilience is of paramount importance in today’s telecommunication networks. Here, this problem is tackled by considering 1+1 optical lightpath protection with maximally SRLG-disjoint paths and geodiversity in a transparent backbone network. Geodiversity was added to make the network more resilient to geographically correlated disasters. The aim is to estimate the increase of the path lengths (fibre lengths) and the increase in cost of the required transponders, with respect to simple link disjointness (no-SRLG nor geodiversity constraints) in a fully transparent optical network. The results obtained in a realistic test network show that SRLG-disjointness already ensures an acceptable geodiversity for the considered network.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115524107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489844
J. Konorski
A realistic and systematic network evaluation should subsume an availability model and a failure model. We combine a "hard availability" model we call threshold attendance, whereby a certain minimum number of network elements must be present at any time, with a soft-crash failure model, whereby after experiencing a failure, a network element is still able to function correctly for a while in an emergency mode at a risk of a major crash. A Threshold Attendance Guarantee (TAG) protocol, earlier studied from a security viewpoint, is deployed to ensure threshold attendance while controlling the duration of the emergency mode. We study the network under TAG using an "isolated" node-type Markovian analysis, offering insights into the tradeoffs between some relevant availability and reliability characteristics, and showing a simple model-free way to account for a positive correlation between the network elements’ behavior that can reflect mass disasters.
{"title":"Threshold Attendance under Soft-Crash Model: TAG Protocol and Markovian Analysis","authors":"J. Konorski","doi":"10.1109/RNDM.2018.8489844","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489844","url":null,"abstract":"A realistic and systematic network evaluation should subsume an availability model and a failure model. We combine a \"hard availability\" model we call threshold attendance, whereby a certain minimum number of network elements must be present at any time, with a soft-crash failure model, whereby after experiencing a failure, a network element is still able to function correctly for a while in an emergency mode at a risk of a major crash. A Threshold Attendance Guarantee (TAG) protocol, earlier studied from a security viewpoint, is deployed to ensure threshold attendance while controlling the duration of the emergency mode. We study the network under TAG using an \"isolated\" node-type Markovian analysis, offering insights into the tradeoffs between some relevant availability and reliability characteristics, and showing a simple model-free way to account for a positive correlation between the network elements’ behavior that can reflect mass disasters.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：