Graph theory and traffic grooming in WDM rings
نویسنده
چکیده
This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results, but to give a flavor of how graph theory can help research in optical networks. The second part of this paper is a detailed example of the usage of graph theory, but it is also a complete survey of recent results in minimization of the number of add–drop multiplexers (ADMs) required in a WDM ring with traffic grooming.
منابع مشابه
Dynamic traffic grooming in WDM mesh networks using a novel graph model
As our fiber-optic backbone networks migrate from interconnected SONET rings to arbitrary mesh topology, traffic grooming on WDM mesh networks becomes an extremely important research problem. (Traffic grooming refers to the problem of efficiently packing a set of low-speed connection requests onto high-capacity channels.) To address this problem, we employ a new, generic graph model for dynamic...
متن کاملEffective traffic grooming in WDM rings
Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing number of ADMs, minimizing number of wavelengths, single hub and multiple hub architectures, switching capabilities etc. In this work, we derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of swit...
متن کاملTraffic grooming in unidirectional WDM ring networks using design theory
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges (where C is the grooming ratio) and where the total number of vertices ...
متن کاملIgnasi SAU VALLS Optimization in Graphs under Degree Constraints Application to Telecommunication Networks
The first part of this thesis is devoted to traffic grooming, which is a central problem in optical networks. It refers to packing low-rate signals into higher-speed streams, in order to improve bandwidth utilization and reduce the network cost. The objective is to minimize the number of Add-Drop Multiplexers (ADMs), which are devices that insert/extract low-rate traffic to/from a high-speed st...
متن کاملApproximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses at most 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) need two SONET add-drop multiplexers (ADMs) at each end node ; using grooming different requests can share the...
متن کامل