{"title":"Comprehensive comparison and accuracy of graph metrics in predicting network resilience","authors":"Mohammed J. F. Alenazi, J. Sterbenz","doi":"10.1109/DRCN.2015.7149007","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149007","url":null,"abstract":"Graph robustness metrics have been used largely to study the behavior of communication networks in the presence of targeted attacks and random failures. Several researchers have proposed new graph metrics to better predict network resilience and survivability against such attacks. Most of these metrics have been compared to a few established graph metrics for evaluating the effectiveness of measuring network resilience. In this paper, we perform a comprehensive comparison of the most commonly used graph robustness metrics. First, we show how each metric is determined and calculate its values for baseline graphs. Using several types of random graphs, we study the accuracy of each robustness metric in predicting network resilience against centrality-based attacks. The results show three conclusions. First, our path diversity metric has the highest accuracy in predicting network resilience for structured baseline graphs. Second, the variance of node-betweenness centrality has mostly the best accuracy in predicting network resilience for Waxman random graphs. Third, path diversity, network criticality, and effective graph resistance have high accuracy in measuring network resilience for Gabriel graphs.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"61 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":"114830349","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":"PCA-based network-wide correlated anomaly event detection and diagnosis","authors":"Yuanxun Zhang, P. Calyam, S. Debroy, M. Sridharan","doi":"10.1109/DRCN.2015.7149006","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149006","url":null,"abstract":"High-performance computing environments supporting large-scale distributed computing applications need multi-domain network performance measurements from open frameworks such as perfSONAR. Network-wide correlated anomaly events that can potentially impact data throughput performance need to be quickly and accurately notified for smooth computing environment operations. Since network topology is not always available along with the measurements data, it is challenging to identify and locate network-wide correlated anomaly events that impact data throughput performance. In this paper, we present a novel PCA-based correlated anomaly event detection scheme that can fuse multiple time-series of measurements and transform them using principal component analysis. We demonstrate using actual perfSONAR one-way delay measurement datasets that our scheme can: (a) effectively distinguish between correlated and uncorrelated anomalies, (b) leverage a source-side vantage point to diagnose whether a correlated anomaly event location is local or in an external domain, (c) act as a “black-box” correlation analysis tool for key insights in eventual root-cause identification.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"262 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":"127249895","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":"Cost-efficient multi-layer network design employing traffic re-aggregation and shared protection across layers","authors":"T. Hashiguchi, Y. Takita, K. Tajima, T. Katagiri","doi":"10.1109/DRCN.2015.7148979","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148979","url":null,"abstract":"Shared protection/restoration is a promising solution for reducing protection resources and is supported at each layer of the current multi-layer networks. Software-defined networking is expected to reduce equipment cost as well as operational cost by orchestrating these shared protection functionalities. However, although protection resource sharing improves link utilization, it sometimes increases the required equipment. Meanwhile, traffic re-aggregation at each layer is an important technique for low volume traffic to utilize the underlying link capacity more efficiently, but re-aggregation also makes it difficult to share protection resources with traffic at lower layers. In this paper, we present multi-layer network design strategy and method that reduce equipment cost by means of both traffic re-aggregation at each layer and protection resource sharing among multiple service traffic at different layers. The strategy first prioritizes traffic re-aggregation at each layer, and then maximally delegates shared protection to lower layers as long as it does not increase the required capacity at the lower layer. Evaluation results from the example three-layer networks confirm that the proposed method can effectively reduce equipment cost compared to the conventional design method. Cost reduction is achieved by leveraging shared protection functions at multiple layers.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"24 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":"132554971","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":"Finding geographic vulnerabilities in multilayer networks using reduced network state enumeration","authors":"M. T. Gardner, Rebecca May, C. Beard, D. Medhi","doi":"10.1109/DRCN.2015.7148984","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148984","url":null,"abstract":"Despite advancements in the analysis of networks with respect to geographic vulnerabilities, very few approaches exist that can be applied to large networks with varied applications and network measures. Natural and man-made disasters as well as major political events (like riots) have kept the challenges of geographic failures in networks in the forefront. With the increasing interest in multilayer and virtual networks, methods to analyze these networks for geographic vulnerabilities are important. In this paper, we present a state space analysis method that analyzes multilayer networks for geographic vulnerabilities. It uses either the inability to provision an upper layer service and/or increased costs to provision as the criteria for network failure. Mapping techniques for multilayer network states are presented. Simplifying geographic state mapping techniques to reduce enumeration costs are also presented and tested. Finally, these techniques are tested on small and extremely large networks.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"49 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":"115708851","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":"Robustness analysis of mobile ad hoc networks using human mobility traces","authors":"Dongsheng Zhang, J. Sterbenz","doi":"10.1109/DRCN.2015.7149003","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149003","url":null,"abstract":"With the rapid advancement of wireless technology and the exponential increase of wireless devices in the past decades, there are more consumer applications for MANETs (mobile ad hoc networks) in addition to the traditional military uses. A resilient and robust MANET is essential to high service quality for applications. The dynamically changing topologies of MANETs pose a huge challenge to normal network operations. Furthermore, malicious attacks against critical nodes in the network could result in the deterioration of the network. In this paper, we employ several real-world human mobility traces to analyze network robustness in the time domain. We apply attacks against important nodes of the human topology and compare the impact of attacks based on different centrality measures. Our results confirm that nodes with high betweenness in a well-connected large dynamic network play the most pivotal roles in the communication between all node pairs.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"6 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":"125334203","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}
Velin Kounev, M. Lévesque, D. Tipper, Teresa Gomes
{"title":"On smart grid communications reliability","authors":"Velin Kounev, M. Lévesque, D. Tipper, Teresa Gomes","doi":"10.1109/DRCN.2015.7148982","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148982","url":null,"abstract":"In this paper, we discuss the communications reliability requirements posed by the smart power grid with a focus on communications in support of wide area situational awareness. Implementation of wide area situational awareness relies on both transmission substation networks and wide area optical networks. We study the reliability of a sample communications network of the California Power Grid and find that its reliability falls short of proposed requirements. To overcome this issue, we consider the problem of designing the network to meet the reliability requirements while minimizing the network cost. Therefore, we propose two greedy iterative heuristics and a heuristic integer linear programming (H-ILP) model using minimum cut-sets for network reliability optimization. The greedy iterative algorithms outperform the H-ILP approach in terms of cost, but require a larger amount of computing resources. Both proposed models are in fact complementary and thus provide a framework to optimize the reliability of smart grid communications networks.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"22 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":"121738143","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":"Demand-wise shared protection network design and topology allocation with dual-failure restorability","authors":"B. Todd, J. Doucette","doi":"10.1109/DRCN.2015.7148987","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148987","url":null,"abstract":"As availability requirements for core communication networks increase, network survivability models must progress accordingly. Demand-wise shared protection (DSP) is a survivability model developed to blend the efficiency of shared capacity survivability models with the simplicity of dedicated capacity models. This paper proposes and examines a DSP based survivability model that incorporates topology design and dual-failure restorability in order to increase the efficiency and availability of a network. This model was able to produce network topology and capacity designs that efficiently protected a given percentage of traffic for any dual-failure scenario.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"14 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":"131654316","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":"A selective caching scheme that adapts to content popularity changes in content-centric networking","authors":"T. Kawano, M. Shimamura, H. Koga","doi":"10.1109/DRCN.2015.7148989","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148989","url":null,"abstract":"Content delivery services over the Internet are increasingly attractive to users and widely used. Internet users now can play many kinds of content and new content items are continually created. As users interest has changed to content delivery communication from inter-user communication, Content-Centric Networking (CCN) [1], which is designed for content delivery services, has attracted much attention.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"347 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":"134025354","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}
Hyungbae Park, Haymanot Gebre-Amlak, Baek-Young Choi, Sejun Song, David Wolfinbarger
{"title":"Understanding university campus network reliability characteristics using a big data analytics tool","authors":"Hyungbae Park, Haymanot Gebre-Amlak, Baek-Young Choi, Sejun Song, David Wolfinbarger","doi":"10.1109/DRCN.2015.7148998","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7148998","url":null,"abstract":"Understanding the health of a network via offline outage and failure analysis is important to assess the availability of the network and understand the pattern of failures and the root cause of them for the future network reliability improvement. In this paper, we perform a university campus network outage and failure analysis (UMKC access network) that has not been investigated well due to the lack of effective methodologies. We used Splunk, one of the big data analysis tools, to effectively handle the sheer amount of node outage and link failure log data and topology information. We investigate the network reliability characteristics via SNMP and syslog data, causes of failures, and their impact. Our study shows that the general characteristics of the different layers are very distinct from each other and the wireless network is less reliable compared to the wired network and is affected by the performance of the wired network.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"54 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":"134261191","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}
Alejandro Arbelaez, D. Mehta, B. O’Sullivan, L. Quesada
{"title":"Optimising dual homing for long-reach passive optical networks","authors":"Alejandro Arbelaez, D. Mehta, B. O’Sullivan, L. Quesada","doi":"10.1109/DRCN.2015.7149018","DOIUrl":"https://doi.org/10.1109/DRCN.2015.7149018","url":null,"abstract":"Mass deployment of fibre access networks is without doubt the next short to medium term goal of many network operators around the globe. Long-Reach Passive Optical Network (LR-PON) has been proposed as a solution to help spreading mass deployment of fibre-to-the-home (FTTH), by reducing the cost per customer compared to current commercially available technologies. This paper addresses the issue of reducing protection costs of dual homing for LR-PON deployment by optimally configuring the number of PONs and their sizes. We study two different ways of configuring PONs. The first approach is about designing fibre tree network by trading distance and the split-size of the PONs optimally. Second, we study a ring architecture where some PONs can be connected in a chain and may not be connected to two metro-core nodes directly. The scalability of our approach is demonstrated by performing nation-wide study of Ireland. Our results show that the open ring strategy that can reduced the total distance-based cost by approximately 66% in rural areas where the architecture can be applied.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"13 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":"122256341","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}