We consider single-hop all-optical networks in which wavelength-routed connections (lightpaths) between source-destination pairs are dynamically established and torn down in response to a random pattern of arriving connection requests and connection holding times. A connection request may be blocked if no wavelength is available on a suitable path from source to destination. For these networks ...

This paper focuses on two aspects of photonic network traffic performance investigation. Two different modelling approaches for the evaluation of network nodes under dynamic traffic conditions are described. This allows to evaluate how suitable different node architectures are for networks carrying dynamic traffic. Furthermore, routing strategies are becoming more important with increasing dyna...

In this paper, we consider the traffic grooming routing, and wavelength assignment (GRWA) problem for optical mesh networks. In most previous studies on optical mesh networks, traffic demands are usually assumed to be wavelength demands, in which case no traffic grooming is needed. In practice, optical networks are typically required to carry a large number of lower rate (sub-wavelength) traffi...

In this paper, we consider the traÆc grooming, routing, and wavelength assignment (GRWA) problem for optical mesh networks. In most previous studies on optical mesh networks, traÆc demands are usually assumed to be wavelength demands, in which case no traÆc grooming is needed. In practice, optical networks are typically required to carry a large number of lower rate (sub-wavelength) traÆc deman...

In this paper, we consider the traffic grooming, routing, and wavelength assignment (GRWA) problem for optical mesh networks. In most previous studies on optical mesh networks, traffic demands are usually assumed to be wavelength demands, in which case no traffic grooming is needed. In practice, optical networks are typically required to carry a large number of lower rate (sub-wavelength) traff...

The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph G. An all-to-all routing R in G is a set of paths connecting all pairs of vertices of G. The undirected optical index of G is the minimu...

Wavelength assignment algorithm is one of the important components of routing and wavelength assignments problem in WDM networks. This problem helps in the minimization of the blocking probability of the network. In this paper we have reviewed the wavelength assignment problem and discussed the history of this problem with a good literature review. Depending upon the literature and history of t...

Photonic networks using Optical Burst Switching (OBS) emerged as an attractive choice for building the next generation Photonic Internet. In burst switched photonic networks, contentions caused by multiple bursts intending to use the same wavelength of the same link at the same time, remarkably increase burst dropping probability and degrade network throughput. As efficient contention resolutio...

With wavelength division multiplexing (WDM) several optical signals can be transferred in a single optical fiber [6][7]. This technology allows more efficient use of the huge capacity of an optical fiber but also poses new network design and management problems, especially when wavelength conversion is not possible in the nodes. In this paper we consider the routing and wavelength assignment pr...

With wavelength division multiplexing (WDM) several optical signals can be transferred in a single optical ber [6][7]. This technology allows more e cient use of the huge capacity of an optical ber but also poses new network design and management problems, especially when wavelength conversion is not possible in the nodes. In this paper we consider the routing and wavelength assignment problem ...