{"title":"Supporting differentiated resilience classes in multilayer networks","authors":"Abdulaziz S. Alashaikh, D. Tipper, Teresa Gomes","doi":"10.1109/DRCN.2016.7470832","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470832","url":null,"abstract":"The concept of providing differentiated classes of resilient services over communications networks has received a lot of attention in the literature. A number of proposals tried to address the problem by provisioning different classes of services with different protection schemes. However, most of these works are applied to a single layer and lack cross layer coordination in multilayer scenarios. In addition, there is an increasing need for supporting services with very high resilience requirements over future communications networks. This, however, has to be done in a cost efficient manner and without over-engineering the network. In this paper, we introduce a novel approach that simplifies the whole design and achieves both high resilience and differentiation. Our approach, utilizes the spine concept idea of embedding a subnetwork at the physical layer with comparatively high availability link and node values [1]. This lays a foundation for differentiation between multiple classes of flows. Then, cross layer mapping and spine-aware routing are performed in a way that transfers this differentiation capability to the upper layer network and flows. We provide two joint routing-mapping optimization formulations and evaluate their performance in a multilayer scenario.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123823526","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":"Cables network design optimization for the Fiber To The Home","authors":"V. Angilella, Matthieu Chardy, W. Ben-Ameur","doi":"10.1109/DRCN.2016.7470839","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470839","url":null,"abstract":"Optimization of Fiber To The Home networks is a challenging issue for telecommunications operators. This work focuses on the cables network design problem, taking into account cable separation techniques. An integer linear programming model is proposed, along with several enhancements including valid inequalities. Computational experiments are performed on real-life instances considering operator's engineering rules.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124442792","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}
Tomohiro Ishikawa, Y. Mori, H. Hasegawa, Ken-ichi Sato
{"title":"Spectrum utilization maximization in coarse granular optical routing networks that employ fine granular shared protection","authors":"Tomohiro Ishikawa, Y. Mori, H. Hasegawa, Ken-ichi Sato","doi":"10.1109/DRCN.2016.7470838","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470838","url":null,"abstract":"To offset the impairment caused by imperfect optical filtering at ROADMs/OXCs, guard bands must be inserted between optical channels. The resulting degradation in frequency utilization detracts from the benefit of next-generation elastic optical path networks. To overcome this problem and achieve an ICT infrastructure with the required level of resiliency, we add path-granularity-level shared protection to our coarse granular optical routing networks with fine granular add/drop. Optical paths are densely packed in coarse granular optical pipes, but the filtering impairment generated by the routing process is greatly mitigated, which results in enhanced fiber frequency utilization. The impairment caused by path dropping is carefully minimized for all possible backup paths, which is made possible by our newly developed network design algorithm. Numerical experiments show that the number of fibers in a network is substantially reduced over conventional shared protected networks.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114350899","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}
M. T. Gardner, Yufei Cheng, Rebecca May, C. Beard, J. Sterbenz, D. Medhi
{"title":"Creating network resilience against disasters using Service Level Agreements","authors":"M. T. Gardner, Yufei Cheng, Rebecca May, C. Beard, J. Sterbenz, D. Medhi","doi":"10.1109/DRCN.2016.7470836","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470836","url":null,"abstract":"Building networks that are resilient to natural disasters and other geographically correlated events involves both proactive network design and remediation after the event. Network provisioning is one of the steps used to provide redundancy and diversity in networks that are key elements in resilient network design. Once the disaster has occurred, remediation may include rerouting of the most important services affected by the event. Both components involve understanding the quality of service that may be affected, knowing which services are critical, and having an understanding of the geographic events that may impact the network. Furthermore, if resources are limited following the disaster, how do we select which services to reroute? In this work, we propose to use Service Level Agreements (SLA) to provide much of the information necessary to solve the provisioning and rerouting problems. On the provisioning side, the SLAs will provide the required system response time, availability and survivability of a service. On the remediation side, the SLA can provide the priority of a service to restore and reroute. We present mixed-integer linear programming (MILP) models and heuristics to show how the most important services are provisioned and rerouted to be available in the event of a geographic disaster. Our approaches are found to be more efficient than other priority-based approaches.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129180552","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":"On the convex piecewise linear unsplittable multicommodity flow problem","authors":"B. Fortz, L. Gouveia, Martim Joyce-Moniz","doi":"10.1109/DRCN.2016.7470829","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470829","url":null,"abstract":"We consider the problem of finding the cheapest routing for a set of commodities over a directed graph, such that: i) each commodity flows through a single path, ii) the routing cost of each arc is given by a convex piecewise linear function of the load (i.e. the total flow) traversing it. We propose a new mixed-integer programming formulation for this problem. This formulation gives a complete description of the associated polyhedron for the single commodity case, and produces very tight linear programming bounds for the multi-commodity case.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124380392","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}
Pablo Ignacio Serrano Caneleo, Lakshmi J. Mohan, P. Udaya, A. Harwood
{"title":"On improving recovery performance in erasure code based geo-diverse storage clusters","authors":"Pablo Ignacio Serrano Caneleo, Lakshmi J. Mohan, P. Udaya, A. Harwood","doi":"10.1109/DRCN.2016.7470846","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470846","url":null,"abstract":"Erasure code based distributed storage systems are increasingly being used by storage providers for big data storage since they offer the same reliability as replication with significant decrease in the amount of storage required. But, when it comes to a storage system with data nodes spread across a very large geographical area, the code's recovery performance is affected by various factors, both network and computation related. In this paper, we expose an XOR based code supplemented with the ideas of parity duplication and rack awareness that could be adopted in such storage clusters to improve the recovery performance during node failures. We have implemented them on the erasure code module of the XORBAS version of the Hadoop Distributed File System (HDFS). For evaluating the performance of the proposed ideas, we employ a geo-diverse cluster on the NeCTAR research cloud. The experimental results show that the techniques aid in bringing down the data read for repair by a factor of 85% and repair duration by a factor of 57% during node failures, though resulting in an increased storage requirement of 21% as compared to the traditional Reed-Solomon codes used in HDFS. The sum of all these ideas could offer a better solution for a code based storage system spanning a wide geographical area that has storage constraints such that a triple replicated system is not affordable and at the same time has strict requirements on ensuring the minimal recovery time.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217022","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":"Kumori: Steering Cloud traffic at IXPs to improve resiliency","authors":"Antoine Fressancourt, C. Pelsser, M. Gagnaire","doi":"10.1109/DRCN.2016.7470848","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470848","url":null,"abstract":"After a few years of infancy, Cloud services have now gained enough maturity to be used to deliver an increasing number of critical services. To ensure the capacity of those services to survive failure events, major Cloud Services Providers (CSPs) deploy their platform in distant datacenters. The framework used to interconnect those datacenters is most of the time over-provisioned and costly to manage. In this paper, we present “Kumori”, a SDN-based overlay architecture designed to give CSPs back control on their inter-datacenter connectivity. Using the iPlane dataset, we compare our architecture with the Resilient Overlay Network (RON), considered as a seminal project on Internet resiliency for the last ten years. Our results show that, depending on the CSP's size and connectivity strategy, our architecture either gives significantly shorter paths than RON in terms of latency or provides a similar service using a smaller overlay in terms of number of overlay nodes.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"158 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128844841","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":"Protection plan design for cloud tenants with bandwidth guarantees","authors":"H. Alameddine, Sara Ayoubi, C. Assi","doi":"10.1109/DRCN.2016.7470845","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470845","url":null,"abstract":"In cloud data centers, where hosted applications share the underlying network resources, network-bandwidth guarantees have been shown to improve predictability of application performance and cost. However, recent empirical studies have also shown that often data center devices and links are not all that reliable and that failures may cause service outages, rendering significant revenue loss for the affected tenants, as well as the cloud operator. Accordingly, cloud operators are pressed to offer both reliable and predictable performance for the hosted applications. While much work has been done on solving both problems separately, this paper seeks to develop a joint framework by which cloud operators can offer both performance and availability guarantees for the hosted tenants. In particular, this paper considers a simple model to abstract the bandwidth guarantees requirement for the tenant and presents a protection plan design which consists of backup virtual machines placement and bandwidth provisioning to optimize the internal data center traffic. We show through solid motivational examples that finding the optimal protection plan design is highly perplexing, and encompasses several constituent challenges. Owing to its complexity, we decompose it into two subproblems, and solve them separately. First, we invoke a placement subproblem of the minimum number of backup VMs and then we attempt to find the most efficient correspondence between backup and primary VMs (i.e., protection plan) which minimizes the bandwidth redundancy. Our numerical evaluation shows that our two-step method is both scalable and accurate; further, it performs much better than a baseline method where placement of backup VMs is done at random.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428092","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":"Dynamic control for failure recovery and flow reconfiguration in SDN","authors":"Stefano Paris, G. Paschos, Jérémie Leguay","doi":"10.1109/DRCN.2016.7470850","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470850","url":null,"abstract":"By separating control and data planes, Software-Defined Networks (SDN) pave the way to a plethora of online routing mechanisms that react instantaneously to sudden traffic variation and network failures. In this paper, we introduce a dynamic routing system where these online mechanisms strive to solve an optimization instance that constantly evolves due to new arrivals and departures as well as network failures and repairs. We model the optimality gap, which is characteristic to the surcharge cost paid by network operators, of such a system as an auto-regressive stochastic process and we show that its evolving average does not diverge. We further propose a control policy that operates on top of the online routing solver to dynamically decide when to reconfigure the network. The policy minimizes the average surcharge cost and guarantees that the network reconfiguration rate does not exceed a threshold set by the operator. Numerical results show that our policy outperforms periodic schemes and approaches that reconfigure constantly the network after any system changes occur.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"13 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977414","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}
Sifat Ferdousi, F. Dikbiyik, M. Tornatore, B. Mukherjee
{"title":"Progressive datacenter recovery over optical core networks after a large-scale disaster","authors":"Sifat Ferdousi, F. Dikbiyik, M. Tornatore, B. Mukherjee","doi":"10.1109/DRCN.2016.7470834","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470834","url":null,"abstract":"Today's cloud system are composed of geographically distributed datacenter interconnected by high-speed optical networks. Disaster failures can severely affect both the communication network as well as datacenters infrastructure and prevent users from accessing cloud services. After large-scale disasters, recovery efforts on both network and datacenters may take days, and, in some cases, weeks or months. Traditionally, the repair of the communication network has been treated as a separate problem from the repair of datacenters. While past research has mostly focused on network recovery, how to efficiently recover a cloud system jointly considering the limited computing and networking resources has been an important and open research problem. In this work, we investigate the problem of progressive datacenter recovery after a large-scale disaster failure, given that a network-recovery plan is made. An efficient recovery plan is explored to determine which datacenters should be recovered at each recovery stage to maximize cumulative content reachability from any source considering limited available network resources. We devise an Integer Linear Program (ILP) formulation to model the associated optimization problem. Our numerical examples using the ILP show that an efficient progressive datacenter-recovery plan can significantly help to increase reachability of contents during the network recovery phase. We succeeded in increasing the number of important contents in the early stages of recovery compared to a random-recovery strategy with a slight increase in resource consumption.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125641476","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}