2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)最新文献_第2页

Different strategies for dynamic multicast traffic protection in elastic optical networks 弹性光网络中动态组播流量保护的不同策略

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608284

Michal Aibin, K. Walkowiak

{"title":"Different strategies for dynamic multicast traffic protection in elastic optical networks","authors":"Michal Aibin, K. Walkowiak","doi":"10.1109/RNDM.2016.7608284","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608284","url":null,"abstract":"Growing popularity of content-oriented services is a significant trend observed recently in communication networks. Due to large volumes of traffic related to these services, the network operators search for new solutions that allow to deliver content to end users in a cost-effective manner. Elastic optical network (EON) is a relatively novel solution for optical networks. The main advantages of EONs compared to traditional wavelength division multiplexing (WDM) optical networks are more efficient use of spectrum resources and support of flexible modulation format conversion. Moreover, there is a strong focus on multicasting, which is perceived as a much better approach for content delivery compared to unicast transmissions. In this paper we concentrate on dynamic multicast routing in survivable EONs. We compare various protection methods that may be applied to protect multicast sessions in EONs. For this purpose, we adapt two dynamic routing algorithms with additional survivability constraints and the possibility to change the modulation format at the regeneration nodes. Using realistic assumptions on EONs and representative network topologies, a wide range of simulations is run. First, we show the results to indicate advantages and disadvantages of various protection methods. In addition, we show gain of enabling partial protection of receivers in multicast trees. The results clearly show that various QoS levels for multicast protection allow to save optical network resources, thus, accept more incoming traffic in the network.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115946051","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}

引用次数: 12

Earthquake preparedness strategies for telecom backbone with integration of early warning systems and optical WDM networks 基于预警系统与光波分复用网络集成的电信骨干防震策略

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608285

Melike Oguz, F. Dikbiyik, H. S. Kuyuk

{"title":"Earthquake preparedness strategies for telecom backbone with integration of early warning systems and optical WDM networks","authors":"Melike Oguz, F. Dikbiyik, H. S. Kuyuk","doi":"10.1109/RNDM.2016.7608285","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608285","url":null,"abstract":"Earthquakes cause huge data loss when a major ground motion strikes backbone telecom infrastructure. However, necessary actions can be taken if an earthquake early warning system is integrated to optical WDM networks, which is the typical architecture of backbone telecom networks. While earthquake early warning systems are used to provide warnings to railway transportation, nuclear power plants, or semiconductor factories, they have been not used to provide warnings to telecom networks. However, many connections can be reprovisioned to avoid data loss in case of a disaster if a warning is provided seconds before a major earthquake. In this study, we explore three different strategies for such situation; 1) Extreme approach that reprovisions all connections in danger with full or degraded bandwidth, 2) relax approach that reprovisions only critical connections, and 3) careful approach that reprovisions some or all connections based on the alarm level. We compare these strategies for a case study, an earthquake on San Andreas Fault Line. We conduct numerical examples over a 24-node US-wide topology where the connections have heterogeneous bandwidth and availability requirements. The numerical examples show that careful approach provides a better solution than extreme and relax approaches, especially for heavy network loads in terms of expected penalty in case of an earthquake.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133525581","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}

引用次数: 5

Analysis and complexity of pandemics 流行病的分析和复杂性

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608291

J. Piccini, F. Robledo, P. Romero

引用次数: 3

Switching link group Failure Localization via monitoring trails in all-optical networks 全光网络中基于监控轨迹的交换链路组故障定位

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608273

Alija Pašić, P. Babarczi

引用次数: 1

Controller placement strategies for a resilient SDN control plane 弹性SDN控制平面的控制器放置策略

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608295

P. Vizarreta, C. M. Machuca, W. Kellerer

{"title":"Controller placement strategies for a resilient SDN control plane","authors":"P. Vizarreta, C. M. Machuca, W. Kellerer","doi":"10.1109/RNDM.2016.7608295","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608295","url":null,"abstract":"Software Defined Networking (SDN) provides efficient network control and management by introducing a logically centralized control plane. However, outsourcing of the control plane intelligence to an SDN controller requires reliable switch-to-controller connection. This paper presents two strategies to address the Reliable Controller Placement (RCP) problem, which protect the control plane against single link and node failures and provide seamless failover by exploiting the principles of resilient routing. The first approach considers that switches have to be connected to a controller over two Disjoint Control Paths (RCP-DCP). The second approach considers that switches have to be connected to two Different Controller Replicas (RCP-DCR) over two disjoint paths. Both approaches are finding working and protection control paths of minimum length to enable fast and efficient failover. The two models have been compared with respect to the unprotected scenario, in terms of control path length, expected control path loss in different failure scenarios and average control path availability. The results show that both models RCP-DCP and RCP-DCR improve significantly the resilience of the control plane, while adding very limited penalty to the average control path length. If link failures are the dominating failures, both RCP-DCP and RCP-DCR offer similar performance and the best strategy depends on the topological characteristics and the number of the controllers in the network. RCP-DCR provides additional protection against controller failures and it shows better performance when node failures are dominating or are comparable to link failures.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285222","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}

引用次数: 76

Virtual Network Function placement for resilient Service Chain provisioning 用于弹性服务链配置的虚拟网络功能放置

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608294

Ali Hmaity, Marco Savi, F. Musumeci, M. Tornatore, A. Pattavina

{"title":"Virtual Network Function placement for resilient Service Chain provisioning","authors":"Ali Hmaity, Marco Savi, F. Musumeci, M. Tornatore, A. Pattavina","doi":"10.1109/RNDM.2016.7608294","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608294","url":null,"abstract":"Virtualization technologies are changing the way network operators deploy and manage Internet services. In particular in this study we focus on the new Network Function Virtualization (NFV) paradigm, which consists in instantiating Virtual Network Function (VNFs) in Commercial-Off-The-Shelf (COSTS) hardware. Adopting NFV network operators can dynamically instantiate Network Functions (NFs) based on current demands and network conditions, allowing to save capital and operational costs. Typically, VNFs are concatenated together in a sequential order to form Service Chains (SCs) that provide specific Internet Services to the users. In this paper we study different approaches to provide the resiliency of SCs against single-link and single-node failures. We propose three Integer Linear Programming (ILP) models to solve the VNF placement problem with the VNF service chaining while guaranteeing resiliency against single-node/link, single-link and single-node failures. Moreover we evaluate the impact of latency of SCs on the VNFs distribution. We show that providing resiliency against both single-link and single-node failures necessitates the activation of twice the amount of resources in terms of nodes, and that for latency critical services providing resiliency against single-node failures comes at the same cost with respect to resiliency against single-link and single-nodes failures.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914056","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}

引用次数: 79

Resilient availability and bandwidth-aware multipath provisioning for media transfer over the Internet 通过Internet进行媒体传输的弹性可用性和带宽感知多路径配置

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608279

Sahel Sahhaf, W. Tavernier, D. Colle, M. Pickavet

{"title":"Resilient availability and bandwidth-aware multipath provisioning for media transfer over the Internet","authors":"Sahel Sahhaf, W. Tavernier, D. Colle, M. Pickavet","doi":"10.1109/RNDM.2016.7608279","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608279","url":null,"abstract":"Traditional routing in the Internet is best-effort. Path differentiation including multipath routing is a promising technique to be used for meeting QoS requirements of media-intensive applications. Since different paths have different characteristics in terms of latency, availability and bandwidth, they offer flexibility in QoS and congestion control. Additionally protection techniques can be used to enhance the reliability of the network. This paper studies the problem of how to optimally find paths ensuring maximal bandwidth and resiliency of media transfer over the network. In particular, we propose two algorithms to reserve network paths with minimal new resources while increasing the availability of the paths and enabling congestion control. The first algorithm is based on Integer Linear Programming which minimizes the cost of the paths and the used resources. The second one is a heuristic-based algorithm which solves the scalability limitations of the ILP approach. The algorithms ensure resiliency against any single link failure in the network. The experimental results indicate that using the proposed schemes the connections availability improve significantly and a more balanced load is achieved in the network compared to the shortest path-based approaches.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126034168","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}

引用次数: 4

Network utility problem and easy reliability polynomials 网络效用问题与易可靠性多项式

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608271

E. Canale, P. Romero, G. Rubino, Xavier S. Warnes

{"title":"Network utility problem and easy reliability polynomials","authors":"E. Canale, P. Romero, G. Rubino, Xavier S. Warnes","doi":"10.1109/RNDM.2016.7608271","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608271","url":null,"abstract":"We model a communication system by a network, were the terminals are perfect but links may fail randomly, with identical probability q = 1 - p. This defines a partial random network. The all-terminal reliability R(p) is the probability that this random graph is connected, and it is a polynomial in p. Finding the reliability polynomial can be reduced to a hard counting problem. The contributions of this paper are two-fold. First, we fully determine all subgraphs that accept an easy counting technique, and as a consequence, the reliability polynomial is directly retrieved. More specifically, we define the “level of difficulty” of a graph, and find the reliability polynomials of all graphs with non-positive level of difficulty. The second contribution is to propose a fundamental problem from survivable network design, called the Network Utility Problem. The goal is to maximize the network utility, under a minimum edge-connectivity requirement. The network utility is defined as the opposite of the level of difficulty minus one, and it is never greater than unity. The upper-bound is achieved only in trees and cycles. We prove that Harary graphs achieve the optimal value for the Network Utility Problem. Finally, we present open problems that provide hints for future work.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"402 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132475862","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}

引用次数: 4

Introducing database communication technologies for TED replication in multi-domain networks 介绍了多域网络中TED复制的数据库通信技术

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608288

G. Cecchetti, F. Cugini, F. Paolucci, P. Castoldi, A. Giorgetti

{"title":"Introducing database communication technologies for TED replication in multi-domain networks","authors":"G. Cecchetti, F. Cugini, F. Paolucci, P. Castoldi, A. Giorgetti","doi":"10.1109/RNDM.2016.7608288","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608288","url":null,"abstract":"In multi-domain transport networks, exchange of Traffic Engineering information is required to enable effective end-to-end service provisioning and restoration by efficiently utilizing network resources. So far, several solutions have been proposed by the communication community such as the Hierarchical Path Computation Element (H-PCE) architecture. Using the H-PCE architecture a parent PCE is responsible for inter-domain path computation, while a dedicated child PCE performs intra-domain path computation within each domain. However, this approach can introduce scalability concerns especially under dynamic traffic condition such as during restoration because all path computation procedures are coordinated by the parent PCE and may require the exchange of many control messages. This paper proposes a standard communication among database systems located at the child PCEs, to exchange and share YANG-based Traffic Engineering information in multi-domain networks. By exploiting currently available database technologies, scalable and predictable performance is demonstrated for both replication mechanisms among child PCEs and information retrieval from the stored databases. Thus, this proposal enables the sharing of intra-domain information at each cPCE that can be locally used, upon failure, to speed-up the recovery procedure.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598946","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}

引用次数: 0

Graph resilience improvement of backbone networks via node additions 通过节点增加提高骨干网弹性的图

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608292

Mohammed J. F. Alenazi

{"title":"Graph resilience improvement of backbone networks via node additions","authors":"Mohammed J. F. Alenazi","doi":"10.1109/RNDM.2016.7608292","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608292","url":null,"abstract":"Backbone networks are critical infrastructure that interconnect networks across cities, countries, and continents. Maintaining and expanding such networks is a progressive task as the number of network users increases. High capacity and availability are amongst the main objectives of backbone networks planning because they serve critical services in healthcare, business, and education. Disrupting these services can have catastrophic effects on people's daily activities. Targeted attacks are among several challenges that can disconnect backbone networks. Designing resilient networks against such attacks can save money and lives. Improving the resilience of existing networks can be obtained by adding more nodes and links. In this paper, we propose a heuristic algorithm to improve the resilience of a given graph by adding a set of nodes and links to meet given objective functions such as maximizing algebraic connectivity, minimizing network criticality, and weighted spectral distribution. Moreover, we apply our algorithm to several US-based backbone networks and evaluate their improved network resilience against centrality-based attacks. Our results show that adding links to maximizing algebraic connectivity yields better network resilience than minimizing network criticality and weighted spectral distribution.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121340423","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}

引用次数: 3