2009 7th International Workshop on Design of Reliable Communication Networks最新文献

{"title":"Restoration in carrier networks","authors":"R. Doverspike, B. Cortez","doi":"10.1109/DRCN.2009.5340025","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340025","url":null,"abstract":"Quality of Service (QoS) is an important objective of large telecommunications carriers. Network restoration is the prime capability needed to achieve this objective. While a large body of publications study and propose different restoration methods and network optimization algorithms, very few have actually been implemented. To address this, we present background on how today's large carrier terrestrial networks are constructed and operated. In particular we describe their segmentation, layering, and where, how and why network restoration is selectively implemented. We conclude with some observations where restoration research has the greatest need.","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":"128927115","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":"Designing backbone networks using the generalized steiner problem","authors":"F. Robledo, Eduardo Canale Bentacourt","doi":"10.1109/DRCN.2009.5339990","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339990","url":null,"abstract":"In the design of metropolitan optical fiber networks, a commonly applied requirement is to ensure the existence node-disjoint-paths between pairs of distinguished nodes of the network. In this way, when a failure occurs in some component (link or node), the network will remain connected, a basic requisite for maintaining an operational state. In this work, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) for designing a survivable backbone. The algorithm builds topologies which comply with heterogeneous node-connectivity requirements. The method is applied to a set of problem instances with different connectivity requirements, obtaining results which appear promising.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"29 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":"122372801","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":"Efficient ethernet multi-ring protection system","authors":"D. Lee, J. Rhee, Kyusang Lee, Peter K. Cho","doi":"10.1109/DRCN.2009.5339991","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339991","url":null,"abstract":"Ethernet ring protection (ERP) introduced by ITU-T G.8032 Recommendation is a new class of packet switched network protection technology that can provides ring automatic protection switch for nested multiple Ethernet rings. An ERP system is required to provide network protection against link and node failures within 50ms. Whenever the protection scheme switches the ring to have a new topology, the standard requires all nodes to flush their filtering data base (FDB) resulting in congestion in the access networks. In this paper we evaluate the protection performance of the current G.8032 scheme and introduce additional novel schemes for performance enhancements in nested multi ring networks.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"50 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":"116435324","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":"Improved availability models for p-cycle-based network design","authors":"M. Kiaei, A. Ranjbar, Caroline Rocha, B. Jaumard, C. Assi","doi":"10.1109/DRCN.2009.5340023","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340023","url":null,"abstract":"Dual-failures are considered as the main contributors to service unavailability in p-cycle based mesh networks that are designed to withstand single failures. Methods such as post-failure reconfiguration and pre-failure provisioning of additional protection capacity have been considered to add another level of protection against dual-failures. In this paper, we present availability-aware service provisioning method in networks designed to only withstand single failures. The approach we discuss builds upon previous work and uses the concept of “cutsets method\" to categorize failures that cause overall service outage; we discuss some subtle issues which make existing methods inaccurate. We then develop an improved non-joint optimization ILP model for solving the service provisioning problem under the assumption of fully loaded straddling spans in p-cycles. We also address the scalability issue by introducing several techniques to speed up the run time of the model. We evaluate the resources of inaccuracy in different scenarios. Our results indicate that the ILP solutions of our models outperform the prior work in terms of estimating service path unavailability in all considered network and traffic scenarios.","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":"133614719","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":"Scalable backup configurations creation for IP fast reroute","authors":"Shohei Kamamura, T. Miyamura, Y. Uematsu, K. Shiomoto","doi":"10.1109/DRCN.2009.5339992","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339992","url":null,"abstract":"IP Fast Reroute techniques have been proposed to achieve fast failure recovery in just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time after failure by precomputing backup routes. A multiple routing configurations (MRC) algorithm has been proposed for obtaining IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after failures. However, this current algorithm requires too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm for reducing configurations as much as possible. The basic idea is to construct a spanning tree excluding failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"59 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":"134525373","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":"Autonomous aero-visual and sensor based inspection network for asset monitoring","authors":"Arun Kumar Somani, K. Çelik","doi":"10.1109/DRCN.2009.5340027","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340027","url":null,"abstract":"This article introduces a theoretical and experimental program to develop the inspection and fault detection technology needed to integrate MAVs for persistent intelligence, reconnaissance, maintenance and surveillance for obscured or logistically challenging assets in non-urban environments. The design is explained using a context of heterogeneous deployment of wireless sensors for real-time asset monitoring by anticipating exceptional conditions and building the system to cope with them. The system converges towards an error-free state with self-stabilization, the ability to fall back to a safe mode in a financially feasible manner. This sophisticated mechanism requires a real-time capacity estimation capability to sustain the quality-of-service, which can be achieved by a distributed sensor network. We discuss issues in design and information propagation in such sensor clustered topology, optimization for power-aware networking, and link and node capacity assignment to achieve the desired goals.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"9 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":"129172006","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":"Dependability and security models","authors":"Kishor S. Trivedi, Dong Seong Kim, A. Roy, D. Medhi","doi":"10.1109/DRCN.2009.5340029","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340029","url":null,"abstract":"There is a need to quantify system properties methodically. Dependability and security models have evolved nearly independently. Therefore, it is crucial to develop a classification of dependability and security models which can meet the requirement of professionals in both fault-tolerant computing and security community. In this paper, we present a new classification of dependability and security models. First we present the classification of threats and mitigations in systems and networks. And then we present several individual model types such as availability, confidentiality, integrity, performance, reliability, survivability, safety and maintainability. Finally we show that each model type can be combined and represented by one of the model representation techniques: combinatorial (such as reliability block diagrams (RBD), reliability graphs, fault trees, attack trees), state-space (continuous time Markov chains, stochastic Petri nets, fluid stochastic Petri nets, etc) and hierarchical (e.g., fault trees in the upper level and Markov chains in the lower level). We show case studies for each individual model types as well as composite model types.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"17 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":"116926743","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 robust network planning","authors":"A. Tizghadam, A. Leon-Garcia","doi":"10.1109/DRCN.2009.5340013","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340013","url":null,"abstract":"One of the important properties of a reliable communication network is the robustness to the environmental changes. This paper looks at the design of robust networks from a new perspective. A graph-theoretical metric, betweenness, in combination with network weight matrix is used to define a global quantity, network criticality, to characterize the robustness of a network. We show that network criticality is a monotone decreasing function of weight matrix. Furthermore, it is shown that network criticality is a strictly convex function of network weight matrix. This leads to a well-defined convex optimization problem to find the optimal weight matrix assignment to minimize network criticality.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"5 3 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":"126096232","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":"Optimization of p-cycles for survivable anycasting streaming","authors":"Adam Smutnicki, K. Walkowiak","doi":"10.1109/DRCN.2009.5340001","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340001","url":null,"abstract":"Intensive and extensive development of computer networks generates the problem of providing a suitably high level of network survivability. A lot of research has been done in this area in recent years, including studies associated with the use of a modern tool called p-cycles. p-Cycles not only provide a high level of protection, but also achieve it at a quite low cost. Until now, p-cycles have been widely used in the context of unicast and multicast traffic. In this paper, we apply p-cycles for protecting the anycast traffic. According to our knowledge, this is the first paper in the literature on this topic. To solve the problem stated, we propose an original approach which combines protection on the level of physical links with protection on the flow level. By using special properties of p-cycles, we formulate the solution algorithm dedicated to minimising the total cost of full protection. Comparing the proposed algorithm with several ad hoc (but reasonable) methods we found, in extensive numerical tests, that the proposed methodology outperforms other algorithms.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"27 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":"125227081","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":"Large scale optimization in survivable WDM mesh networks: Tutorial proposal (DRCN 2009)","authors":"B. Jaumard, Caroline Rocha, S. Sebbah","doi":"10.1109/DRCN.2009.5339980","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339980","url":null,"abstract":"Design and planning of survivable WDM networks involve different decision and optimization problems under network, traffic, and cost constraints. The high bandwidth brought by WDM access technology has incited network operators to extensive deployment of WDM in both access and backbone networks. Edges of networks have been pushed and transport capacity significantly increased, making the design and planning tasks harder. Consequently, efficient and scalable tools are, more than ever, needed to help network designers. Most of the design and planning problems arising in survivable optical WDM network are large scale optimization and hard combinatorial ones that cannot be tackled efficiently with the classical Integer Linear Programming (ILP) approaches. The Column Generation (CG) technique is an efficient optimization tool which has been shown to be very effective for solving particular classes of large scale systems. Indeed, combined with classical ILP tools, the CG technique offers a valuable tool for the design of highly efficient global search heuristics with an indication on the distance to the globally optimal solution when exact solution is not possible. However, it requires special care at the mathematical modeling step. The objective of this tutorial is to provide in-depth learning on the use of CG and ILP tools throughout different network design examples arising in survivable WDM networks, showing that such tools are highly efficient and scalable. Nowadays, network connectivity with high bandwidth is stretched to reach places that were isolated some years ago. In order to meet the everincreasing demands for high bandwidth, optical WDM technology has been deployed in different telecommunication networks. The heterogeneity of traffic and the explosive growth of demands for high bandwidth services have shaped several network topologies, and raised several other network planning and design issues such as, e.g., survivability. However, with the expansion of network sizes and transport capacities, operators are increasingly concerned with the issue of how to efficiently perform planning and design for such large scale systems. In this tutorial, we focus on the efficient and scalable design of survivable WDM networks, where recent studies have reported outstanding solution of the optimization problems arising therein. Authors have been successful in adopting large scalable optimization tools based on the Column Generation (CG) technique. The 386 2009 7th International Workshop on the Design of Reliable Communication Networks main objective of the tutorial is to provide an in-depth learning on CG optimization techniques in the context of the design of survivable WDM networks. We will elaborate on the different optimization steps of using CG tools including modeling approaches, effective solution schemes, and performance evaluations. Both classical Integer Linear Programming (ILP) approaches and CG are two techniques that basically use the same o","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":"122666480","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}