Download Design And Analysis Of P Cycle Based Survivable Optical Networks full books in PDF, epub, and Kindle. Read online free Design And Analysis Of P Cycle Based Survivable Optical Networks ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Zhen Rong Zhang |
| Publisher | : |
| Total Pages | : 147 |
| Release | : 2006 |
| Genre | : Wavelength division multiplexing |
| ISBN | : |
| Author | : Caroline Thennecy de Medeiros Rocha |
| Publisher | : |
| Total Pages | : |
| Release | : 2009 |
| Genre | : |
| ISBN | : |
Network survivability is a very interesting area of technical study and a critical concern in network design. As more and more data are carried over communication networks, a single outage can disrupt millions of users and result in millions of dollars of lost revenue. Survivability techniques involve providing some redundant capacity within the network and automatically rerouting traffic around the failure using this redundant capacity. This thesis concerns the design of survivable optical networks using p-cycle based schemes, more particularly, path-protecting p-cycles, in link failure scenarios. Our study focuses on the placement of p-cycle protection structures assuming that the working routes for the set of connection requests are defined a priori. Most existing work carried out on p-cycles concerns heuristic algorithms or methods suffering from critical lack of scalability. Thus, the objective of this thesis is twofold: on the one hand, to propose scalable models and solution methods enabling to approach larger problem instances and on the other hand, to produce optimal or near optimal solutions with mathematically proven optimality gaps. For this, we rely on the column generation technique which is suitable to solve large scale linear programming problems. Here, column generation is used as an intelligent way of implicitly enumerating promising cycles to be part of p-cycle designs. At first, we propose mathematical formulations for the master and the pricing problems as well as the first column generation algorithm for the design of survivable networks based on path-protecting p-cycles. The resulting algorithm obtains better solutions within reasonable running time in comparison with existing methods. Then, a much more compact formulation of the pricing problem is obtained. In addition, we also propose a new hierarchical decomposition method which greatly improves the efficiency of the whole algorithm and allows us to solve larger problem instances. As for integer solutions, two heuristic approaches are proposed to obtain good solutions. Next, we dedicate our attention to a systematic comparison of p-cycles and classical shared protection schemes. We perform an accurate comparison by using a unified column generation framework to find provably good results. Afterwards, our study concerns an empirical evaluation of directed and undirected link- and path-protecting p-cycles under asymmetric traffic scenarios. We show how much additional protection cost results from employing bidirectional systems in such scenarios. Finally, we investigate a column generation formulation for the design of p-cycle networks under availability requirements and obtain the first lower bounds for the problem.
| Author | : |
| Publisher | : |
| Total Pages | : |
| Release | : 2005 |
| Genre | : |
| ISBN | : |
Network survivability is a very interesting area of technical study and a critical concern in network design. As more and more data are carried over communication networks, a single outage can disrupt millions of users and result in millions of dollars of lost revenue. Survivability techniques involve providing some redundant capacity within the network and automatically rerouting traffic around the failure using this redundant capacity. This thesis concerns the design of survivable optical networks using p-cycle based schemes, more particularly, path-protecting p-cycles, in link failure scenarios. Our study focuses on the placement of p-cycle protection structures assuming that the working routes for the set of connection requests are defined a priori. Most existing work carried out on p-cycles concerns heuristic algorithms or methods suffering from critical lack of scalability. Thus, the objective of this thesis is twofold: on the one hand, to propose scalable models and solution methods enabling to approach larger problem instances and on the other hand, to produce optimal or near optimal solutions with mathematically proven optimality gaps. For this, we rely on the column generation technique which is suitable to solve large scale linear programming problems. Here, column generation is used as an intelligent way of implicitly enumerating promising cycles to be part of p-cycle designs. At first, we propose mathematical formulations for the master and the pricing problems as well as the first column generation algorithm for the design of survivable networks based on path-protecting p-cycles. The resulting algorithm obtains better solutions within reasonable running time in comparison with existing methods. Then, a much more compact formulation of the pricing problem is obtained. In addition, we also propose a new hierarchical decomposition method which greatly improves the efficiency of the whole algorithm and allows us to solve larger problem instances. As for in.
| Author | : Canhui (Sam) Ou |
| Publisher | : |
| Total Pages | : 360 |
| Release | : 2004 |
| Genre | : |
| ISBN | : |
| Author | : Adrian Zymolka |
| Publisher | : Cuvillier Verlag |
| Total Pages | : 298 |
| Release | : 2007-06-14 |
| Genre | : Mathematics |
| ISBN | : 3736922531 |
The cost-efficient design of survivable optical telecommunication networks is the topic of this thesis. In cooperation with network operators, we have developed suitable concepts and mathematical optimization methods to solve this comprehensive planningtask in practice. Optical technology is more and more employed in modern telecommunication net-works.Digital information is therebytransmittedas short light pulses through glass fibers. Moreover, the optical medium allows for simultaneous transmissions on a single fiber by use of different wavelengths. Recent optical switches enable a direct forwarding of optical channels in the network nodes without the previously required signalretransformation to electronics. Their integration creates ongoingopticalconnections, which are called lightpaths. We study the problem of finding cost-efficient configurations of optical networks which meet specified communication requirements. A configuration comprises the determination of all lightpaths to establish as well as the detailed allocation of all required devices and systems. We use a flexible modeling framework for a realistic representation of the networks and their composition.For differentnetworkarchitectures, we formulate integer linear programs which model the design task in detail. Moreover, network survivability is an important issue due to the immense bandwidths offered by optical technology. Operators therefore request for designs which perpetuate protected connections and guarantee for a defined minimum throughput in case of malfunctions. In order to achieve an effective realization of scalable protection, we present a novel survivability concept tailored to optical networks and integrate several variants into the models. Our solution approach is based on a suitable model decomposition into two subtasks which separates two individually hard subproblems and enables this way to compute cost-efficient designs with approved quality guarantee. The first subtask consists of routing the connections with corresponding dimensioning of capacities and constitutes a common core task in the area of network planning. Sophisticated methods for such problems have already been developed and are deployed by appropriate integration. The second subtask is characteristic for optical networks and seeks for a conflict-free assignment of available wavelengths to the lightpaths using a minimum number of involved wavelength converters. For this coloring-like task, we derive particular models and study methods to estimate the number of unavoidable conversions. As constructive approach, we develop heuristics and an exact branch-and-price algorithm. Finally, we carry out an extensive computational study on realistic data, provided by our industrial partners. As twofold purpose, we demonstrate the potential of our approach for computing good solutions with quality guarantee, and we exemplify its flexibility for application to network design and analysis.
| Author | : Hussein T. Mouftah |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 308 |
| Release | : 2012-12-06 |
| Genre | : Computers |
| ISBN | : 1461511690 |
Optical Networks - Architecture and Survivability, is a state-of-the-art work on survivable and cost-effective design of control and management for networks with IP directly over Wavelength Division Multiplexing (WDM) technology (or called Optical Internet). The authors address issues of signaling mechanisms, resource reservation, and survivable routing and wavelength assignment. Special emphasis has been given to the design of meshed, middle-sized, and wavelength-routed networks with dynamic traffic in the optical domain, such as the next-generation Metropolitan Area Network. Research and development engineers, graduate students studying wavelength-routed WDM networks, and senior undergraduate students with a background in algorithms and networking will find this book interesting and useful. This work may also be used as supplemental readings for graduate courses on internetworking, routing, survivability, and network planning algorithms.
| Author | : Eric Bouillet |
| Publisher | : John Wiley & Sons |
| Total Pages | : 298 |
| Release | : 2007-11-12 |
| Genre | : Technology & Engineering |
| ISBN | : 0470015659 |
Transport networks evolved from DCS (Digital Cross-connect Systems)-based mesh architectures, to SONET/SDH (Synchronous Optical Networking/Synchronous Digital Hierarchy) ring architectures in the 1990’s. In the past few years, technological advancements in optical transport switches have allowed service providers to support the same fast recovery in mesh networks previously available in ring networks while achieving better capacity efficiency and resulting in lower capital cost. Optical transport networks today not only provide trunking capacity to higher-layer networks, such as inter-router connectivity in an IP-centric infrastructure, but also support efficient routing and fast failure recovery of high-bandwidth services. This is possible due to the emergence of optical network elements that have the intelligence required to efficiently control the network. Optical mesh networks will enable a variety of dynamic services such as bandwidth-on-demand, Just-In-Time bandwidth, bandwidth scheduling, bandwidth brokering, and optical virtual private networks that open up new opportunities for service providers and their customers alike. Path Routing in Mesh Optical Networks combines both theoretical as well as practical aspects of routing and dimensioning for mesh optical networks. All authors have worked as technical leaders for the equipment vendor Tellium who implemented such capabilities in its product, and whose product was deployed in service provider networks. Path Routing in Mesh Optical Networks Presents an in-depth treatment of a specific class of optical networks, i.e. path-oriented mesh optical networks. Focuses on routing and recovery, dimensioning, performance analysis and availability in mesh optical networks. Explains and analyses routing specifically associated with Dedicated Backup Path Protection (DBPP) and Shared Backup Path Protection (SBPP) recovery architectures. As most of the core backbone networks evolve to mesh topologies utilizing intelligent network elements for provisioning and recovery of services, Path Routing in Mesh Optical Networks will be an invaluable tool for both researchers and engineers in the industry who are responsible for designing, developing, deploying and maintaining mesh optical networks. It will also be a useful reference book for graduate students and university professors who are interested in optical networks or telecommunications networking. With a foreword by Professor Wayne D. Grover, author of the book Mesh-Based Survivable Networks.
| Author | : Arun Somani |
| Publisher | : Cambridge University Press |
| Total Pages | : 468 |
| Release | : 2006-01-19 |
| Genre | : Technology & Engineering |
| ISBN | : 9781139448482 |
The advent of fiber optic transmission systems and wavelength division multiplexing (WDM) have led to a dramatic increase in the usable bandwidth of single fiber systems. This book provides detailed coverage of survivability (dealing with the risk of losing large volumes of traffic data due to a failure of a node or a single fiber span) and traffic grooming (managing the increased complexity of smaller user requests over high capacity data pipes), both of which are key issues in modern optical networks. A framework is developed to deal with these problems in wide-area networks, where the topology used to service various high-bandwidth (but still small in relation to the capacity of the fiber) systems evolves toward making use of a general mesh. Effective solutions, exploiting complex optimization techniques, and heuristic methods are presented to keep network problems tractable. Newer networking technologies and efficient design methodologies are also described.
| Author | : Minjing Mao |
| Publisher | : Open Dissertation Press |
| Total Pages | : |
| Release | : 2017-01-26 |
| Genre | : |
| ISBN | : 9781361291603 |
This dissertation, "Design and Analysis of Survivable WDM Optical Network" by Minjing, Mao, 毛忞婧, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Optical networks with Wavelength Division Multiplexing (WDM) technology provide huge bandwidth to meet the ever-increasing traffic demand of the next generation Internet. But the high-speed nature of WDM networks also makes the network more vulnerable to failures. Even a single network failure for a very short duration can result in enormous loss of data. In this thesis, we concentrate on designing a survivable WDM network. In essence, survivability concerns two important aspects, fast fault detection and localization, and fast fault recovery. We first study fast fault detection and localization in WDM optical networks. Our work is based on the notion of monitoring cycle (m-cycle). Compared with other fault detection schemes, an m-cycle based fault detection scheme provides fast fault detection and requires less number of expensive monitors. Aiming at further cutting down the implementation cost, we propose the notion of super monitor. Instead of having a dedicated monitor for each m-cycle, a single super monitor can be placed at the junction of a set of overlapped m-cycles. In this thesis, we formulate and solve the monitor placement problem. We then focus on enhancing the capacity efficiency of fast fault recovery schemes. Shared backup path protection (SBPP) schemes can provide 100% protection against any single link failure. This is achieved by establishing a pair of link-disjoint active and backup paths upon each call arrival. The bandwidth on different backup paths can be shared for protecting different calls. In this thesis, a new SBPP scheme is designed based on a two-step routing approach, where the active and backup paths are sequentially optimized with different objectives in mind. We then shift our focus to design fast protection scheme for multicast/broadcast communications. To this end, we refine the existing concept of blue/red tree. Blue/red tree is a pair of spanning trees where the connectivity between the root and any destination node is ensured upon a network failure. In particular, two efficient integer linear programs (ILPs) are formulated for finding the optimal blue/red trees. Last but not the least, we investigate the survivability in IP networks. We notice that existing efforts on IP fast reroute (IPFRR) are effective in enhancing the IP resilience. But the impact of IPFRR on the end-to-end TCP performance is ignored. Notably, path rerouting can interfere with the TCP congestion control mechanism and thus cause severe throughput degradation. To address this problem, we propose a duplicate acknowledgement (ACK) suppression scheme. The key idea is to detect whether an out-of-order packet arrival event is due to IPFRR or not. If it is due to IPFRR, duplicate ACKs triggered will be suppressed by the TCP receiver so as not to cause unnecessary slow down at the TCP sender. DOI: 10.5353/th_b4784968 Subjects: Wavelength division multiplexing Optical communications - Design and construction
| Author | : Bin Wu |
| Publisher | : Open Dissertation Press |
| Total Pages | : |
| Release | : 2017-01-27 |
| Genre | : |
| ISBN | : 9781361468494 |
This dissertation, "Algorithm Design in Optical Networking" by Bin, Wu, 吳斌, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: ABSTRACT Optical networks based on WDM technology provide cost-effective solutions for high-speed data transmission. Technological progress in optical networking has enabled WDM networks to evolve from traditional circuit-switched ring networks to a new generation of packet-switched mesh networks with high reliability. Nevertheless, WDM networks still face several challenges. First, it is impractical to implement OPS (Optical Packet Switching) as optical buffer technology has not yet reached maturity. Though a hybrid electrical/optical switch architecture can be designed by replacing optical buffers using their electrical counterparts, the reconfiguration overhead of optical fabrics generally leads to a large speedup requirement. OBS (Optical Burst Switching) removes the need for optical buffers and speedup, but it suffers from severe burst contention. Besides, burst delay due to offset time is quite large because of the O-E-O conversions of control packets at each intermediate node. Challenges also exist in optical network survivability design. Although monitoring cycle (m-cycle) has been introduced as an interesting technique for fast link failure detection in all-optical networks, we still lack an efficient algorithm for m-cycle design with minimum network resource consumption. Similarly, although the classical p-cycle (Preconfigured Protection Cycle) concept allows fast optical protection with high capacity efficiency, constructing a set of optimal p-cycles for 100% protection is still very time-consuming. In this thesis, efficient algorithms are designed to address these challenges. For optical packet switching, we aim at achieving 100% throughput with bounded packet delay in a hybrid switch architecture combining electrical buffers with an optical switch fabric. Four original traffic scheduling algorithms, ADAPT, SRF (Scheduling Residue First), α-SCALE and QLEF (Quasi Largest-Entry-First), are proposed. ADAPT and SRF can automatically adapt themselves to switches with II different parameters to minimize the required speedup. α-SCALE and QLEF are minimum-delay scheduling algorithms. They always produce a schedule with the minimum number of switch configurations equal to the switch size. Based on the observation that OBS performance is significantly affected by the hop-count of the connections, LWMD (Least Weight Minimum Diameter) algorithm is designed to generate a virtual topology for an OBS network. This allows the control packets to be transmitted in a smaller number of hops, and thus reduces both the burst contention probability and the delay caused by offset time. For static routing in WDM networks, we propose an MET (Most-Even-Traffic distribution) algorithm to minimize both network wavelength requirement and network bandwidth requirement. We also propose a heuristic LTA (Light-Trail Assignment) for light-trail design. LTA can generate close-to-optimal solutions and is more scalable than the existing Integer Linear Programming (ILP) approach. We then focus on network survivability. For fast link failure detection in all-optical networks, an M -CYCLE (minimum-length m-cycle) algorithm and an ILP-based approach are designed to construct m-cycles to minimize the network cost. The ILP-based approach allows non-simple m-cycles in the solution, and an efficient tradeoff between monitor cost and bandwidth cost. For p-cycle design, we formulate ILPs without candidate cycle enumeration. Four ILPs are
