D.A. Dunn

Bio: D.A. Dunn is an academic researcher. The author has contributed to research in topics: Maximum flow problem & Network topology. The author has an hindex of 1, co-authored 1 publications receiving 198 citations.

Comparison of k-shortest paths and maximum flow routing for network facility restoration

Abstract: In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k-successively shortest link disjoint paths (KSP) may be faster, easier, and, in distributed implementation, more robust than a distributed counterpart for Max Flow. The issue is, therefore, what the restoration capacity penalty is if KSP is used instead of Max Flow. To explore this tradeoff, the authors present a comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration. The comparison applies to both centrally controlled and distributed restoration systems. Study methods include exhaustive span failure experiments on a range of network models, and parametric and analytical investigations for insight into the factors resulting in KSP versus Max Flow differences. The main finding is that KSP restoration capacity is more than 99.9% of that from Max Flow in typical network models. The hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences. The hypothesis is tested experimentally and used to develop analytical bounds which agree well with observed results. These findings and data are relevant to standards makers and equipment developers in specifying and engineering future restorable networks. >

High-Performance Communication Networks

Abstract: Communication Networks--The center of the information revolution High performance networks are revolutionizing our lives in ways we cannot yet fully perceive. Meet your evolving needs with this in-depth presentation of emerging technologies used to build high speed, high performance communication networks. Authoritatively written, it explains how the converging telephone, data, and CATV technologies are combined into high performance networks, and how to plan, manage, and control these networks. An essential guide for networking professionals This book is well suited for a variety of networking needs. It enables network specialists and system administrators to make informed decisions for implementing and maintaining their companies' networks. It supplies network hardware and software developers with the tools to develop networking solutions, and it provides students in electrical engineering, computer science, operations research, and industry courses with a substantial introduction to networking principles. Features Explains the principles of network design and operation, and their implementation in state-of-the-art technologies such as Internet, high speed LANs and WANs, ISDN, ATM, BISDN, and SONET. Combines the perspectives of the communications engineer, the computer scientist and the economist to provide a system-level understanding of the core networking principles and technologies. Presents essential tools for analyzing, designing, and managing high performance networks. Provides unique coverage of economic issues including cost recovery and pricing schemes. Includes up-to-date coverage of delays, losses, admission control, routing, flow control, switching, networkplanning, pricing, and billing.

Availability analysis of span-restorable mesh networks

Abstract: The most common aim in designing a survivable network is to achieve restorability against all single span failures, with a minimal investment in spare capacity. This leaves dual-failure situations as the main factor to consider in quantifying how the availability of services benefit from the investment in restorability. We approach the question in part with a theoretical framework and in part with a series of computational routing trials. The computational part of the analysis includes all details of graph topology, capacity distribution, and the details of the restoration process, effects that were generally subject to significant approximations in prior work. The main finding is that a span-restorable mesh network can be extremely robust under dual-failure events against which they are not specifically designed. In a modular-capacity environment, an adaptive restoration process was found to restore as much as 95% of failed capacity on average over all dual-failure scenarios, even though the network was designed with minimal spare capacity to assure only single-failure restorability. The results also imply that for a priority service class, mesh networks could provide even higher availability than dedicated 1+1 APS. This is because there are almost no dual-failure scenarios for which some partial restoration level is not possible, whereas with 1+1 APS (or rings) there are an assured number of dual-failure scenarios for which the path restorability is zero. Results suggest conservatively that 20% or more of the paths in a mesh network could enjoy this ultra-high availability service by assigning fractional recovery capacity preferentially to those paths upon a dual failure scenario.

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

Abstract: The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.

Restoration strategies and spare capacity requirements in self-healing ATM networks

Abstract: This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies quantitatively in terms of spare cost, notably: global versus failure-oriented reconfiguration, path versus link restoration, and state-dependent versus state-independent restoration. The advantages and disadvantages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration. Numerical results illustrate that the heuristic algorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment for tested examples.

New and improved approaches for shared-path protection in WDM mesh networks

Abstract: This paper investigates the problem of dynamic survivable lightpath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). In particular, we focus on shared-path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Our main contributions are as follows. 1) First, we prove that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete. 2) Then, we develop a heuristic, called CAFES, to compute a feasible solution with high probability. 3) Finally, we design another heuristic, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-path protection and approach to optimal solutions without enumerating paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.