Author: 謝旻劭Publisher:
ISBN:
Category :
Languages : en
Pages : 69
Book Description
Design and Analysis of P-Cycles Based Protection and Reconfiguration Mechanism for All-Optical WDM Networks
Author: 謝旻劭Domain/Multi-Domain Protection and Provisioning in Optical Networks
Author: Kien Do TrungOptimization of P-cycle Protection Schemes in Optical Networks
Author: Caroline Thennecy de Medeiros RochaPublisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
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.
Optimization of P-cycle Protection Schemes in Optical Networks
Author: Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
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.
Conference Proceedings
Author: Differential Capacity p-Cycles
Author: Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Survivability has become a central part of modern optical network design as the hundreds of wavelengths get multiplexed on fibers carrying data at Tbps speeds in DWDM networks. Provisioning for 100% restoration on failure using minimum amount of resources has become an important design problem. p-Cycles have emerged as a useful fault tolerance mechanism that operate at the speed of SONET rings, but also have low mesh-like spare capacity requirement. In this thesis, a modified version of p-cycle, called differential capacity p-cycle, is proposed that improve spare capacity efficiency beyond what is provided by a set of traditional p-cycles. Different variants of differential capacity p-cycles are proposed, analogous to some of the traditional p-cycle variants. The designs of the various types of differential capacity p-cycles are formulated using integer linear programs, and the spare capacity usage of these new structures are compared with that of traditional p-cycles and their variants.
WDM Mesh Networks
Author: Hui ZangPublisher: Springer Science & Business Media
ISBN: 1461503418
Category : Computers
Languages : en
Pages : 195
Book Description
In recent years, with the rapid growth of the Internet, the bandwidth demand for data traffic is exploding. Optical networks based on wavelength-division multiplexing (WDM) technology offer the promise to satisfy the bandwidth requirements of the Internet infrastructure. With WDM technology, signals are carried simultaneously on mUltiple wavelengths on a single fiber. WDM provides a practical approach of resolving the mismatch between the fiber ca pacity and the peak electronic processing speed. Mesh-based WDM networks have recently attracted much research and development interest since the In ternet topology is meshed in nature, and more importantly, mesh-based WDM networks are flexible with respect to routing and survivability. This book exam ines the management and survivability issues of mesh-based WDM networks and proposes new WDM network protocols and algorithms that could make telecommunication networks more efficient. Wavelength-routing has been one of the most important technologies to em ploy WDM in backbone networks. In wavelength-routed WDM networks, optical channels, which are referred to as lightpaths, are set up between WDM terminals. Most chapters of this bock are focused on various issues related to wavelength-routed networks, namely, routing and wavelength-assignment, con trol and management, fault management, and wavelength-converter placement. This book also presents an all-optical packet-switched network architecture based on the concept of photonic slot routing. The audience for this book are network designers and planners, research and development engineers active in the field of telecommunications, and students of optical networking at the graduate or senior undergraduate levels.
Reconfigurable Optical Networks
Author: Reza Roshani-TabriziPublisher:
ISBN:
Category : Multiplexing
Languages : en
Pages : 206
Book Description
Finally, a numerical method is presented to obtain a lower bound on the lightpath capacity of the network which guarantees the non-disruptive reconfiguration of the network.
Simulator for Implementation and Analysis of Protection Algorithms in WDM Optical Networks
Author: Prithvi MaddiPublisher:
ISBN:
Category : Graphical user interfaces (Computer systems)
Languages : en
Pages : 148
Book Description
Design and Performance Analysis of Pure and Hybrid WDM Optical Networks
Author: Edward MutafungwaPublisher:
ISBN: 9789512271757
Category :
Languages : en
Pages : 55
Book Description