{"title":"Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods","authors":"Diane Prisca Onguetou, D. Baloukov, W. Grover","doi":"10.1109/DRCN.2009.5339999","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339999","url":null,"abstract":"Recent work on failure independent path-protecting p-cycles (FIPP) has revealed some new, relatively simple and possibly cost-effective approaches for FIPP p-cycle network design. The first step of the proposed strategy consists of solving a more general path-protecting p-cycle (GPP) problem in which the constraint of failure independence is relaxed. The second step consists of imposing the failure independence constraint onto the GPP solution and identifying the working paths that become unprotected as a result. A FIPP p-cycle solution is extracted by capacitating additional cycles to protect these paths, the number of which the results revealed to never exceed three. Another contribution of this work is the adaptation of the novel combination of genetic algorithms with integer linear programming (GA-ILP) to the GPP concept, which allowed us to solve large GPP problem instances. GA-ILP solutions were typically within 1% of optimality for smaller networks for which the exact solutions were known. The GPP and FIPP solutions obtained with the assistance of GA-ILP were considerably better (by as much as 23%) than those obtained by the FIPP disjoint route set (DRS) method. Furthermore, the results obtained in this paper also showed that relaxing the disjoint route set constraint in FIPP p-cycle networks can result in as much as 9% decrease in spare capacity cost. Also in this paper, we ventured to provide a true comparison of span-protecting p-cycles with FIPP p-cycles, from the capacity efficiency perspective.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127255444","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":"Differentiated reliability in traffic engineered MPLS and DiffServ-aware next generation networks","authors":"Christian Awad, B. Sansò, A. Girard","doi":"10.1109/DRCN.2009.5339998","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339998","url":null,"abstract":"Positioned between the IP service and optical transport planes, DiffServ-aware MPLS-TE (MPLS-DS-TE) combines the advantages of MultiProtocol Label Switching (MPLS), Differentiated Services (DiffServ) and Traffic Engineering (TE) to provide high performance and quality of service guarantees in next generation multimedia networks. However, there is no clear indication on how to ensure QoS control and provide differentiated reliability in case of failures. In previous work, we proposed the DiffServ* and the DiffProtect models to provide differentiated protection for IP services for which more reliability is needed. In this article, we review the key features of MPLS-DS-TE and explain how DiffServ* can be easily implemented using the new MPLS-DS-TE framework and discuss, with the support of simulation results, how DiffServ* improves MPLS-DS-TE's bandwidth management and QoS control capabilities in the event of failures.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125958876","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":"Static lightpath establishment with transmission impairments consideration in WDM all-optical networks","authors":"Maroua Bakri, M. Koubàa, M. Menif, Imen Ouerda","doi":"10.1109/DRCN.2009.5340000","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340000","url":null,"abstract":"Providing ultra high-speed end-to-end connectivity in core optical networks while satisfying the requirements for quality of service is a topic of intense research. In an optical network, a connection is set up to carry a data signal via an all-optical channel (lightpath) from its source to destination nodes. The analog nature of the signal transmission through the network links and nodes leads to signal quality degradation due to impairments accumulation. Such degradation should be taken into account when considering the Routing and Wavelength Assignment (RWA) problem. Most of preceding studies carried out on RWA neglect the impact of the physical layer impairments. In this paper, three physical layer impairment aware RWA algorithms are developed. We explicitly consider the effect of four physical layer impairments namely Chromatic Dispersion (CD), Polarization Mode Dispersion (PMD), Optical Signal to Noise Ratio (OSNR) and Nonlinear Phase Shift (φΝι). Taking into account physical impairments when solving the RWA problem intuitively should affect the computed solution: the selection of a suitable path and suitable wavelength may fail to meet the minimum transmission requirement. To the best of our knowledge, this is the first attempt to include, simultaneously, the four aforementioned transmission impairments when dealing with the RWA problem. We here propose a function that computes the Q-factor based on Eye-Opening Penalties (EOP) instead of using variances. This should lead to a better Bit Error Rate (BER) estimation. Few studies considered EOP in the last years when dealing with such a problem. The performance of the proposed algorithms is demonstrated to be promising through illustrative numerical examples.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117148913","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":"Survivable IP link topology design in an IP-over-WDM architecture","authors":"G. Choudhury, J. G. Klincewicz","doi":"10.1109/DRCN.2009.5340014","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340014","url":null,"abstract":"The design of an IP link topology (i.e., deciding which set of router-to-router communication links to establish) is an important factor in determining both the cost and performance of an IP network. In an IP-over-WDM architecture, these router-to-router links consist of wavelengths carried over an optical network. Each physical link in the optical network can carry multiple router-to-router wavelengths. The IP network must be designed for survivability in the event of an optical network failure (i.e., the loss of any given physical link or optical switch). Therefore, if there are particular physical links that carry an inordinate number of router-to-router wavelengths, a substantial amount of capacity may be required elsewhere in the IP network in order to assure survivability. In this paper, we describe a heuristic for designing an IP link topology in an IP-over-WDM architecture. In choosing which IP links to establish, the heuristic explicitly considers which router-to-router wavelengths that would be carried over each physical link and the various failure scenarios that could result. It is particularly targeted toward large, sparse networks. Some computational comparisons are included.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130796699","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":"Lightpath routing and capacity assignment for survivable IP-over-WDM networks","authors":"Daniel Dao-Jun Kan, A. Narula-Tam, E. Modiano","doi":"10.1109/DRCN.2009.5340028","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340028","url":null,"abstract":"In IP-over-WDM networks the logical topology consists of a set of lightpaths that are routed on top of the physical fiber topology. Hence a single fiber cut can lead to multiple logical link failures. We study the impact of lightpath routing on network survivability and spare capacity requirements. We show that poor routings can lead to significant increase in spare capacity requirements and develop new metrics for assessing the survivability of different lightpath routings. Finally, we use these metrics to develop joint lightpath routing and capacity assignment algorithms that significantly reduce the spare capacity requirements of IP-over-WDM networks.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129846760","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":"DSP network design with availability considerations","authors":"B. Todd, J. Doucette","doi":"10.1109/DRCN.2009.5340004","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340004","url":null,"abstract":"This paper expands on the demand-wise shared protection model in order to capacitate a network that achieves pre-defined minimum availability requirements. By enabling DSP to take into consideration minimum availability, a network can be capacitated to meet user's requirements of the network. This provides a way to customize the level of protection throughout the network that matches the needs of those using the network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130987841","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":"Providing survivability against jamming attack via joint dynamic routing and channel assignment","authors":"Shanshan Jiang, Yuan Xue","doi":"10.1109/DRCN.2009.5340005","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340005","url":null,"abstract":"Built upon a shared wireless medium, wireless network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of service degradation is a crucial aspect in the design of a wireless network. To address this issue, this paper investigates the network restoration solutions via the joint design of traffic rerouting, channel re-assignment, and scheduling. Efficient routing and channel assignment schemes can relieve the interference caused by both the normal network nodes and the jamming nodes. Therefore, based on the necessary conditions of schedulability, we first formulate the optimal network restoration problem as linear programming problem, which gives an upper bound on the achievable network throughput. After we solve the LP problems, we have a set of flows assigned to edges that have been assigned to different channels. And based on the LP solutions, we provide a greedy scheduling algorithm using dynamic channel assignment, which schedules both the network traffic and the jamming traffic. In particular, we consider two strategies, namely global restoration and local restoration, which can support a range of tradeoffs between the restoration latency and network throughput after restoration. To quantitatively evaluate the impact of jamming attacks during and after restoration, we define two performance degradation indices, transient disruption index (TDI) and throughput degradation index (THI). Finally, extensive performance evaluations are performed to study the impact of various jamming scenarios in a multi-hop multi-channel wireless network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415964","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}
Matthias Hartmann, D. Hock, M. Menth, Christian Schwartz
{"title":"Objective functions for optimization of resilient and non-resilient IP routing","authors":"Matthias Hartmann, D. Hock, M. Menth, Christian Schwartz","doi":"10.1109/DRCN.2009.5339993","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339993","url":null,"abstract":"Intradomain routing in IP networks follows least-cost paths according to administrative link costs. Routing optimization modifies these values to minimize an objective function for a network with given link capacities and traffic matrix. An example for an objective function is the maximum utilization of all links under failure-free conditions or also after rerouting in case of network failures. Many papers have provided heuristic algorithms for routing optimization using different objective functions, but the investigation and comparison of various objective functions has not attracted much attention so far. In this work we present several objective functions for resilient IP routing. We also propose a new combined optimization approach which can simultaneously optimize different objective functions with almost no additional computation effort and describe new techniques to minimize overall computation time. The different objective functions and combinations thereof are then analyzed and compared experimentally.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311715","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":"Service overlay network design with reliability constraints","authors":"N. Lam, L. Mason, Z. Dziong","doi":"10.1109/DRCN.2009.5340010","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340010","url":null,"abstract":"We studied a class of Service Overlay Network (SON) design problem with reliability constraints. It is assumed that a SON network could enter an inadmissible status for two reasons; first when there is insufficient resource to accommodate new connections, second when some hardware devices malfunction. The design problem is usually formulated as either a Maximum Profit (MP) constrained optimization problem or a Minimum Cost (MC) constrained optimization problem. In this article we investigate the relationship between the two formulations in the context of ensuring system operability. By using the set of Lagrange multipliers from the MC formulation as a tool, we show the general condition that MP and MC give exactly the same network designs. The key contribution of this paper is the provision of insight into the solution nature of the MP and the MC formulations in designing a reliable overlay network, thereby giving guidelines to the proper formulation the network designers may consider in designing a reliable yet economically optimal SON network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772677","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":"CAPEX and availability tradeoffs of homing architectures in multi-layer networks","authors":"E. Palkopoulou, D. Schupke, T. Bauschert","doi":"10.1109/DRCN.2009.5340024","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340024","url":null,"abstract":"A generic multi-layer model and a linear programming (LP) formulation are developed enabling the calculation of the optimal solution in terms of network equipment capital expenditures (CAPEX) in multi-homing design. Alternative homing architectures to traditional dual homing are studied not only with respect to network equipment costs but also regarding the achieved availability gain. Case study results show that significant CAPEX savings can be obtained by deploying a shared router strategy, which are independent from the traffic demand and deployed equipment.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133657679","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}