K. Walkowiak, Róża Goścień, Wojciech Kmiecik, M. Klinkowski
{"title":"Content distribution in Elastic Optical Networks with Dedicated Path Protection","authors":"K. Walkowiak, Róża Goścień, Wojciech Kmiecik, M. Klinkowski","doi":"10.1109/RNDM.2014.7014940","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014940","url":null,"abstract":"Recently, the Content Oriented Networking (CON) has become a recognized approach that is gaining extensive acceptance and deployment. At the same time, Elastic Optical Networks (EONs) are considered as a very promising approach for effective bandwidth allocation in optical networks. In this paper, we consider various approaches to content distribution in EON protected by the Dedicated Path Protection (DPP) scheme. We evaluate impact of these approaches on the performance of survivable EON with respect to CAPEX cost, power consumption and spectrum usage. We run numerical experiments on two representative network topologies with traffic patterns based on the Cisco predictions. The results show that the additional overhead of using the DPP protection in the EON for the analyzed performance metrics is from 2.1 to 3.5, depending on the metric and considered content delivery scenario. Moreover, the obtained results prove that the content delivery scenario has a large impact on the performance of the EON used in the physical layer and its suitable choice can bring up to 50% savings in all considered metrics.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132583937","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":"Fragmentation-aware survivable Routing and Spectrum Assignment in elastic optical networks","authors":"Christian Thiessen, C. Cavdar","doi":"10.1109/RNDM.2014.7014937","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014937","url":null,"abstract":"Transparent elastic optical networks (EON) allow provisioning connections with different bandwidth requirements in an efficient way. To achieve the high spectrum efficiency under dynamic traffic scenario, fragmentation-aware Routing, Modulation and Spectrum Assignment (RMSA) decisions is essential. Since fiber cuts are common, resiliency against single-link failures is another important topic. This can be provided efficiently through shared-path protection, which in turn complicates the connection provisioning problem. Unlike existing algorithms that decide first the primary and then the backup path, we introduce an algorithm in this paper that considers pairs of primary and backup paths. To select a candidate pair, we use a hybrid cost function that combines three different objectives: (1) the separation of primary and backup connections to different ends of the spectrum; (2) fragmentation-awareness as a pro-active provisioning objective trying to avoid fragmentation especially among primary resources and (3) maximization of shareability of backup resources among primary paths of link-disjoint connections. Using network level simulations in a scaled-down sample US network with load values of 190-240 Erlang, and bandwidth requests corresponding to 1% blocking probability, an average improvement of 79% compared to a recently presented reference algorithm is shown.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121062654","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":"Reliability-aware virtual data center embedding","authors":"Cheng Zuo, Hongfang Yu, V. Anand","doi":"10.1109/RNDM.2014.7014945","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014945","url":null,"abstract":"Virtual data center (VDC) embedding along with designing for fault tolerance is a key problem that needs to be addressed while designing a data center. In this work we propose a new reliability-aware VDC embedding algorithm RAVDC that embeds VDC onto the physical servers while guaranteeing the reliability requirement of the VDC. The basic idea of this algorithm is to restrict the number of VMs which can be embedded onto the same physical server to guarantee the VDC reliability, and then reduce the bandwidth consumption as well as the energy consumption. We simulate our algorithm and compare it with existing VDC embedding solution using the fat tree topology. The simulation results show that compared with current VDC embedding algorithms, the proposed algorithm can satisfy VDC reliability requirement, and effectively reduce bandwidth consumption of data center by up to 30% without consuming extra energy.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133844693","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}
Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz
{"title":"Cost-Efficient network improvement to achieve maximum path diversity","authors":"Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz","doi":"10.1109/RNDM.2014.7014952","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014952","url":null,"abstract":"Communication networks are prone to failures due to targeted attacks or large-scale disasters. Networks can be improved to withstand challenges using mechanisms such as diversity, which can simply be improved by adding links, however achieving maximum resilience is not feasible due to limited budget. Therefore, algorithms that improve the diversity of networks cost-efficiently are necessary. In this paper, we present a heuristic algorithm that adds links to improve the diversity of the graph while minimizing the cost of link addition. We analyze the flow robustness of non- and improved graphs against targeted attacks. Our results indicate that path-diversity-improved graphs are more resilient to attacks than graphs improved by adding links to the lowest degree nodes.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128829223","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 impact of software failures on time division multiplexed Passive Optical Networks dependability","authors":"Alvaro Fernández, N. Stol","doi":"10.1109/RNDM.2014.7014953","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014953","url":null,"abstract":"Passive Optical Networks (PONs) are widely regarded as the best suited technology for deploying broadband access networks. As new services emerge, the dependability of PONs has become critical as end users expect access networks to be highly reliable. Although PONs dependability regarding hardware failures has been extensively studied, very little attention has been drawn to software failures in PONs. Chiefly, this paper aims at performing an exhaustive analysis of the effect of software failures in PONs dependability and failure-related costs. Additionally, hardware failures are also included for the sake of completeness and comparison. By applying Duane's model for reliability growth to current literature results, the PON software dependability is estimated as a function of the testing phase duration. Then, a Markov cost model, accounting for both hardware and software failures is developed and solved by means of Monte Carlo simulations. Hence, the effect of software failures in PONs asymptotic availability, failure impact and dependability-related costs is detailed; revealing to be of utmost importance. Moreover, how the testing process duration affects these three parameters is also pinpointed.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127683109","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":"Risk mitigation in resilient networks","authors":"P. Chołda, Piotr Guzik, Krzysztof Rusek","doi":"10.1109/RNDM.2014.7014927","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014927","url":null,"abstract":"This article proposes shifting the perspective for the design of resilient networks from cost-focused to one suited for business purposes. Risk engineering is used as a basis to enable us to monetarily express not only the cost of recovery, but also the impact of failures affecting connections (expressed with use of penalties imposed on an operator), and then to find the tradeoff between the cost of the assigned recovery methods and the improved level of resilience. During risk assessment, monetary quantification of penalties is applied with compensation policies, and business relevant risk measures are used. Then, risk response selection is based on various risk mitigation strategies (involving profit maximization, total benefit coverage, cost balance, and risk minimization) proposed in the security risk management. Looking for the cost-risk trade-off related to the assumed mitigation strategy is a complex optimization problem that cannot be modeled with deterministic linear programming. Therefore, to be able to choose recovery options, we develop a genetic algorithm. The results show diversity of recovery procedures selected for various selected mitigation strategies.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580743","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}
Ioan Turus, A. M. Fagertun, L. Dittmann, A. Morea, D. Verchère, J. Kleist
{"title":"Power efficient service differentiation based on traffic-aware survivable elastic optical networks","authors":"Ioan Turus, A. M. Fagertun, L. Dittmann, A. Morea, D. Verchère, J. Kleist","doi":"10.1109/RNDM.2014.7014936","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014936","url":null,"abstract":"This study assesses the feasible energy savings when defining different service classes based on protection schemes in core optical networks. We propose a dedicated energy saving strategy for each of the service classes in order to minimize the overall power consumption of the network. Four Classes of Service are considered: platinum, gold, silver and best effort. Platinum connections benefit from a 1+1 protection scheme, gold connections and silver connections are assigned to a 1:1 protection with the difference that in case of gold connections the same pair of transponders is shared by the working and protection sections. Best-effort connections do not have any associated protection. Two scenarios are implemented and compared. The first, the baseline approach, does not take into account any traffic-aware strategies while the second one, the proposed approach, includes energy reduction strategies taking into account the sleep-mode capability of the opto-electronic devices as well as the elastic data-rate adaptation based on symbol-rate and modulation-format reconfigurations. The results show that in the baseline approach the power consumption is strongly dependent on the ratio between the different service classes while for the proposed approach the difference in power consumption is almost negligible. Moreover, in case of the proposed approach, silver service class can benefit for superior quality of service compared to the gold service class, due to the grooming mechanism.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130306875","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}
Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz
{"title":"Cost-constrained and centrality-balanced network design improvement","authors":"Mohammed J. F. Alenazi, Egemen K. Çetinkaya, J. Sterbenz","doi":"10.1109/RNDM.2014.7014951","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014951","url":null,"abstract":"Improving resilience against failures and targeted attacks is an important aspect of network design. The resilience and cost of networks are two opposing objectives in which a designer should consider when building networks. We develop a heuristic algorithm that balances the centrality of networks by adding a set of links that minimizes the variance of graph centrality measures in a least costly fashion. Moreover, our algorithm limits the addition of links by a budget constraint. We apply our algorithm to three different realistic topologies and measure the performance of the improved graphs in terms of flow robustness when subjected to targeted attacks. Our results indicate that degree-balanced networks are more resilient than both betweenness-balanced and closeness-balanced networks.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126935816","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":"Gains of anycast demand relocation in survivable elastic optical networks","authors":"Róża Goścień, K. Walkowiak, M. Klinkowski","doi":"10.1109/RNDM.2014.7014939","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014939","url":null,"abstract":"In this paper, we focus on a survivable elastic optical network (EON) that supports both unicast and anycast traffic demands. The network implements a dedicated path protection scheme (DPP), in which backup lightpaths are assigned to traffic demands so that to protect against single link failures. In a normal network state, each anycast demand is served by a specific data center (DC). However, we consider the possibility to use different DC (i.e., to relocate anycast demand) in case of a failure and, therefore, the backup lightpath does not have to be connected to the same DC. We study three different scenarios in which backup paths are connected to the same DC, different DC and any available DC in the network. The analysis is performed according to two optimization criteria: maximum and average spectrum usage. The results of our investigation show that the relocation process can bring significant spectrum savings, on average up to almost 40%.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127308120","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":"Using genetic algorithms to improve the reliability of dual homed wireless critical services","authors":"E. L. Følstad, B. Helvik","doi":"10.1109/RNDM.2014.7014946","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014946","url":null,"abstract":"The wireless access to any service in different contexts is nowadays taken for granted. However, the dependability requirements are different for various services and contexts. Critical services put high requirement on the service reliability, i.e., the probability of no service interruption should be close to one. Dual homing may be used to increase the service reliability in a multi technology, multi operator wireless environment, where the user's mobility necessitates access point selections and handovers. To allow the user to assess the risk of the service session, a prediction of the service reliability is necessary. This prediction must fulfil the need for the optimal sequence of access point selections and handovers with regard to service reliability and being computation efficient to accomplish the need for the real-time operation. We demonstrate how genetic algorithms (GA) may be used to predict and to improve the (near) optimal service reliability by fast and simple heuristics, far more computationally efficient than an Integer Linear Programming (ILP) optimization.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131220778","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}