Fig 1 - uploaded by Carmo R Medeiros
Content may be subject to copyright.
Source publication
In this paper we present a distributed algorithm to study the benefits of using sparse grooming in IP-over-WDM networks. The algorithm implements a grooming approach that allows the efficient use of resources while alleviating the management of large and complex topologies.
Context in source publication
Context 1
... connections. The WDM layer is the serving entity while the IP layer acts as the client. A lightpath is an optical communication point-to-point connection that may traverse one or more OXCs. For the client IP layer the set of lightpaths (also called virtual links) form a virtual topology through which traffic must flow. This is illustrated in Fig. 1. In an IP/MPLS-over- WDM network, the IP layer communicates using label- switched path (LSP) connection, which are established via the virtual topology. Such LSPs are established by label-switching routers ...
Similar publications
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 se...
Due to the rapid growth of various applications, the network devices scale and complexity are significantly increased. Meanwhile, to deal with the burst IP traffic, the network devices need to provide continuous services, which will result in the excessive power consumption. Meanwhile, with the development of IP network and intelligent optical swit...
We study the minimization of ADMs (add-drop multiplexers) in optical WDM networks with bidirectional ring topology considering symmetric shortest path routing and all-to-all unitary requests. We insist on the statement of the problem, which had not been clearly stated before in the bidirectional case. Optimal solutions had not been found up to date...
We propose a novel approach of traffic grooming in Spectrum-Elastic Optical Path Networks. Higher spectrum efficiency is achieved by our approach comparing with non-traffic-grooming scenario.
This paper considers the problem of grooming multicast traffic in WDM networks, with arbitrary mesh topologies. The problem is different from grooming of unicast traffic, since traffic can be delivered to destinations through other destinations in the same set, or through branching points. The paper presents an optimal Integer Linear Programming (I...
Citations
The bandwidth of a wavelength channel in WDM optical networks is very high compared to the user’s requirements for various
applications. Therefore, there is a scope for better utilization of channel bandwidth by traffic grooming, in which several
user’s channels are multiplexed for transmission over a single channel. Several research works have been reported on traffic
grooming routing and wavelength assignment (GRWA) for static and dynamic traffic pattern under centralized environment. Distributed
dynamic grooming routing and wavelength assignment (DDGRWA) is a new and quite unexplored area in WDM optical mesh networks.
This article introduces the concept of distributed traffic grooming in WDM mesh networks which also includes virtual topology
construction, reconfiguration, routing and wavelength assignment in the distributed environment assuming incoming traffic
to be dynamic in nature. We have also presented simulation results of our algorithm on dynamically generated traffic under
various network topologies.
KeywordsWDM–Lightpath–Dynamic traffic–Distributed algorithm–Grooming
