2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)最新文献

{"title":"Performance evaluation of resilience using service relocation for GMPLS networks","authors":"H. Wessing, S. Hermann, S. Ruepp","doi":"10.1109/DRCN.2015.7148996","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148996","url":null,"abstract":"Cloud computing today represents an ever increasing part of the data exchanged over the Internet. This influences the core network, where the special properties of cloud based services can be leveraged to increase the network efficiency. This paper explores the concept of relocation for the backup path when providing resiliency to cloud services in the network. The control plane of a GMPLS-enabled optical network is simulated, thus evaluating the proposed Path Computation Element architecture for service relocation. The results show that for increased offered traffic in the network, the overall blocking probability of service requests is lower if relocation is enabled in the protection scheme.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415591","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}

{"title":"Data recovery after geographic correlated attacks","authors":"G. Grebla, A. Efrat, Esther Ezra, R. Pinchasi, Swaminathan Sankararaman","doi":"10.1109/DRCN.2015.7148986","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148986","url":null,"abstract":"In distributed storage networks, ensuring data availability in the presence of hardware faults is an important requirement. Typically, redundancy schemes such as replication and erasure coding are used to ensure this. In case of hardware failures, these networks may be disconnected into multiple components, each of which may require access to the data. In addition, the placement of redundant information must also be optimized as it is ever-changing and requires constant updating. We study the problem of selecting a set of nodes in networks of this kind so that data availability is maintained in the face of geographically correlated failures. We model failure events of arbitrary shapes as the union of disks or line segments in the plane and present approximation algorithms for the problem of selecting a minimum number of redundant information locations (such as replicas or coded file segments) so that data recovery is guaranteed at every node in the face of any failure event. Using tools from computational geometry, our algorithms are efficient and provide good guarantees.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125378315","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}

{"title":"Modelling interdependencies over incomplete join structures of power law networks","authors":"G. Weldehawaryat, S. Wolthusen","doi":"10.1109/DRCN.2015.7149009","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149009","url":null,"abstract":"The interdependence of critical infrastructures, particularly of information and telecommunication networks and systems and electrical power networks has been studied intensively employing a number of different methods ranging from semi-qualitative Leontief models via percolation models and related approaches from statistical physics to agent and graph-theoretical models. In this paper we focus on the latter approach and study the structures arising from incomplete joining of two power-law networks. Both ICT and power networks are artificial networks, but a number of studies demonstrate that such networks generally exhibit scale-free properties and can be described with high accuracy by power-law degree sequence graphs. A well-known result is that the robustness of such networks to random failures and intentional attack differs considerably, with high levels of vulnerability to targeted attacks. However, differences in robustness exist based on the exact degree sequence. Dependencies between two or more such networks can result in both dependency paths, where the length of paths and the existence of vertex-and edge-disjoint paths can inform mitigation mechanisms; more importantly, however, cycles arising indicate the existence of interdependencies that may be more difficult to recover from or mitigate. This has been studied previously for both simple graphs and for flows; however, we argue that particularly for the case of (inter-)dependencies between power and ICT networks in smart grid environments, this relation between the graphs is itself not static. We consider the existence, addition, or removal of dependencies in the form of sparse random graphs resulting in the creation of interdependence cycles. The diameter of such cycles can serve as a strong indicator of the vulnerability of the overall network as it is indicative of the attack surface of the network. The introduction of additional edges in the graph, indicating information flows in the smart grid, can hence reduce vulnerabilities, hence the efficient discovery of such structures for a given graph is of particular interest.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131624877","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}

{"title":"An efficient content search scheme to expand the search range in content-centric networking","authors":"Yurino Sato, T. Kawano, H. Koga","doi":"10.1109/DRCN.2015.7148988","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148988","url":null,"abstract":"Our proposed content search scheme expands the search range so that content can be obtained from caches on routers not on the default path in CCN. Simulations have indicated that this scheme can drastically reduce the number of hops needed to obtain content within a limited search range. In our future work, we will consider effective ways to control the search range according to content popularity.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115721677","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}

{"title":"Multi-failure restoration with minimal flow operations in software defined networks","authors":"S. Astaneh, S. Shah-Heydari","doi":"10.1109/DRCN.2015.7149024","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149024","url":null,"abstract":"We consider dynamic flow restoration in multi-failure scenarios in OpenFlow-based Software-Defined Networks (SDNs). Flexibility of network configuration in these networks makes it possible to dynamically restore flows in case of multilink failures. To re-route the failed flows, network devices such as switches carry out flow operations, i.e., add new flow-entries to the flow-tables. In disaster scenarios where thousands of flows must be restored in a short time, the time required to perform such operations is significant and must be minimized to maintain a carrier-grade network. Shortest-path based techniques do not take into account the number of flow operations (namely, operation cost) and therefore are inefficient for disaster scenarios. We incorporate the operation cost into the flow restoration problem, and formulate the problem of finding a path 1) with the lowest path cost with capped operation cost, 2) with the lowest possible operation cost, and 3) with the minimum operation cost amongst all the paths with a Dijkstra-like path cost. We propose optimal algorithms with Dijkstra-like complexity for the second and third problems. The simulation results with European Reference Network (ERnet) show that our proposed methods on average can reduce the number of required flow operations up to 15% while the path cost rises less than 3%.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123862885","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}

{"title":"Implementation and evaluation of the DFF protocol for advanced metering infrastructure (AMI) networks","authors":"Akshay Kapoor, M. Moh","doi":"10.1109/DRCN.2015.7148993","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148993","url":null,"abstract":"This paper evaluates the Depth First Forwarding (DFF) protocol - a reliable data forwarding mechanism for use in low power, lossy networks. Routing protocols used for lossy networks typically take time to converge if the topology changes, during which data failure may occur. DFF was proposed to help reduce this; it reacts to data delivery failures at a node by trying to successfully deliver the packet while giving time for the routing protocol to converge the network state. This paper discusses different implementation strategies for DFF, and confirms by the experimental results that using DFF significantly increases the delivery ratio at the cost of slightly increased path length and RTT (Round Trip Time).","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122739290","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}

{"title":"Design for reliable and self-sustaining neighborhood area network in smart grid","authors":"Feng Ye, Y. Qian, R. Hu","doi":"10.1109/DRCN.2015.7149021","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149021","url":null,"abstract":"A neighborhood area network (NAN) is part of the advanced metering infrastructure (AMI) in smart grid. A NAN is considered as the last-mile connection in AMI from the metering data management system (MDMS) to the customers, and is widely adopted to apply wireless technologies. In this paper, we propose a NAN design which is powered by green energy and rechargeable batteries for flexible and low-cost deployment. We study the optimal setting for the NAN to be powered by solar energy source for a given operational span. The proposed NAN is a wireless mesh network, however, it has asymmetric transmission characteristics due to the requirements of AMI. Therefore, we propose a routing protocol for uplink and downlink transmissions with local recovery capability to enhance the reliability of the proposed NAN to encounter temporary node failures.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122739716","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}

{"title":"Design of a software-defined resilient virtualized networking environment","authors":"Xuan Liu, Sarah Edwards, N. Riga, D. Medhi","doi":"10.1109/DRCN.2015.7148999","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148999","url":null,"abstract":"Network virtualization enables programmability to the substrate network provider who provisions and manages virtual networks (VNs) for service providers. A mix of software-defined and autonomic technology improves the flexibility of network management, including dynamic reconfiguration in the virtualized networking environment (VNE). Virtual router (VR)s run at a logical level where software failures may be more frequent. Thus, a VR failure is more frequent than a physical router failure on the substrate network. In this paper, we present a software-defined resilient virtualized networking environment where a VN topology can be restored by using a preserved standby virtual router (S-VR) after a VR failure. We illustrate a preliminary autonomic setup of a VNE on the GENI testbed.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190060","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}

{"title":"Modelling robustness of critical infrastructure networks","authors":"Srinath Pinnaka, Rajgopal Yarlagadda, Egemen K. Çetinkaya","doi":"10.1109/DRCN.2015.7148995","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148995","url":null,"abstract":"Critical infrastructure networks are becoming increasingly interdependent. An attack or disaster in a network or on a single node in a network will affect the other networks dependent on it. Therefore, it is important to assess and understand the vulnerability of interdependent networks in the presence of natural disasters and malicious attacks that lead to cascading failures. We develop a framework to analyse the robustness of interdependent networks. Nodes and links in the interdependent networks are attacked based on the graph centrality metrics. We apply our framework on critical infrastructure network data. Our results indicate that the importance of critical infrastructure varies depending on the attack strategy.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128691231","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}

{"title":"Multi-vendor interconnection-based emergency multi-layer networks in disaster recovery","authors":"Sugang Xu, N. Yoshikane, M. Shiraiwa, T. Tsuritani, H. Harai, Y. Awaji, N. Wada","doi":"10.1109/DRCN.2015.7149010","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149010","url":null,"abstract":"For the recovery of multi-layer networks after disaster, in this paper, we introduce two correlated planning problems which are based on the multi-vendor interconnection approach: 1) planning of emergency multi-layer network construction with the IP-over-Optical overlay model, and 2) planning of an operational process for control/management-plane (C&M-Plane) network recovery. We propose two corresponding sub-schemes for individual problems: i) an integer linear programming (ILP)-based network planning scheme which enables the cost-efficient emergency multi-layer network recovery, and ii) an operation planning scheme which computes an operational process for C&M-Plane recovery so that the C&M-Plane itself can be rebuilt as quick as possible. Simulations are conducted for sub-scheme i), showing the efficiency of the multivendor interconnection approach in multi-layer network recovery. Demonstration with a two-vendor test-bed is performed for sub-scheme ii), validating the possibility of the automatic recovery of C&M-Plane networks. These schemes for network design and operation contribute to the cost-reduction in disaster recovery, and result in quick recovery.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137451","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}