Download Free Effective Traffic Grooming In Wdm Optical Networks Book in PDF and EPUB Free Download. You can read online Effective Traffic Grooming In Wdm Optical Networks and write the review.

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.
This book presents the practical motivation, theoretical description, and extant techniques for traffic grooming in optical networks. The description of the various topics of research will be authored by leading researchers in this area, and will contain comprehensive description of related literature for each area. This book is intended to be a definitive reference and text for traffic grooming both for the practitioner in industry and the student in academia.
Optical networks based on wavelength-division multiplexing (WDM) tech nology offer the promise to satisfy the bandwidth requirements of the Inter net infrastructure, and provide a scalable solution to support the bandwidth needs of future applications in the local and wide areas. In a waveleng- routed network, an optical channel, referred to as a lightpath, is set up between two network nodes for communication. Using WDM technology, an optical fiber link can support multiple non-overlapping wavelength channels, each of which can be operated at the data rate of 10 Gbps or 40 Gbps today. On the other hand, only a fraction of customers are expected to have a need for such a high bandwidth. Due to the large cost of the optical backbone infrastruc ture and enormous WDM channel capacity, connection requests with diverse low-speed bandwidth requirements need to be efficiently groomed onto hi- capacity wavelength channels. This book investigates the optimized design, provisioning, and performance analysis of traffic-groomable WDM networks, and proposes and evaluates new WDM network architectures. Organization of the Book Significant amount of research effort has been devoted to traffic grooming in SONET/WDM ring networks since the current telecom networks are mainly deployed in the form of ring topologies or interconnected rings. As the long-haul backbone networks are evolving to irregular mesh topologies, traffic grooming in optical WDM mesh networks becomes an extremely important and practical research topic for both industry and academia.
This book presents an in-depth treatment of routing and wavelength assignment for optical networks, and focuses specifically on quality-of-service and fault resiliency issues. It reports on novel approaches for the development of routing and wavelength assignment schemes for fault-resilient optical networks, which improve their performance in terms of signal quality, call blocking, congestion level and reliability, without a substantial increase in network setup cost. The book first presents a solution for reducing the effect of the wavelength continuity constraint during the routing and wavelength assignment phase. Further, it reports on an approach allowing the incorporation of a traffic grooming mechanism with routing and wavelength assignment to enhance the effective channel utilization of a given capacity optical network using fewer electrical-optical-electrical conversions. As a third step, it addresses a quality of service provision scheme for wavelength-division multiplexing (WDM)-based optical networks. Lastly, the book describes the inclusion of a tree-based fault resilience scheme in priority-based dispersion-reduced wavelength assignment schemes for the purpose of improving network reliability, while maintaining a better utilization of network resources. Mainly intended for graduate students and researchers, the book provides them with extensive information on both fundamental and advanced technologies for routing and wavelength assignment in optical networks. The topics covered will also be of interest to network planners and designers.
Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the band-width offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications' bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks.
The exponential growth of the Internet has resulted in an ever increasing demand for bandwidth. Carrier networks which form the backbone of the Internet, have been designed to carry only voice signals with predictable traffic patterns and anticipating slow growth of the network. With the advances in fiber optics and wavelength division multiplexing (WDM) optical networking is the key to satisfy the data-driven bandwidth demand. These technologies enable simultaneous transmission of signals on separate high-speed channels at different wavelengths. While the bandwidth provided by these channels is very high, individual traffic demands are at the sub-wavelength level. This mismatch can be overcome by multiplexing several lower rate connections onto the high-speed channels in a cost-effective manner. This technique is referred to as traffic grooming. Traffic grooming in WDM networks has been a widely addressed problem in recent years. Traffic grooming and its constituent subproblems have been proven to be NP-complete for even the most elemental of network topologies. The ring topology has been the target of a large number of the studies because of its practical relevance. However, most existing studies concentrate on some objective function that is aggregated over all the network nodes, such as the total number of ADMs used or the total amount of opto-electro-optical (OEO) routing performed. From a practical point of view, it is likely that every network node would be provisioned similarly. Hence a min-max objective, seeking to minimize the OEO equipment needed at the node which needs the maximum of such equipment is more appropriate. Such objectives are usually harder to optimize than aggregate objectives which are themselves known to be computationally intractable. In this thesis, we study traffic grooming in a unidirectional ring network under different traffic patterns for the min-max objective. We define two heuristic approaches based on decomposition; one is based.
While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-per-second transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NP-Complete since it is a generalization of the RWA problem which is known to be NP-Complete. We propose an integer linear programming (ILP) model that accurately depicts the GRWA problem. Because it is very hard to find a solution for large networks using ILP, we solve the GRWA problem by proposing two novel heuristics. The strength of the proposed heuristics stems from their simplicity, efficiency and applicability to large-scale networks. Our simulation results demonstrate that deploying traffic grooming resources on the edge of optical networks is more cost effective and results in a similar blocking performance to that obtained when distributing the grooming resources throughout the optical network domain.