We propose a novel dynamic hierarchical optical path network architecture that achieves efficient optical fast circuit switching. In order to complete wavelength path setup/teardown efficiently, the proposed network adaptively manages waveband paths and bundles of optical paths, which provide virtual mesh connectivity between node pairs for wavelength paths. Numerical experiments show that oper...

A survey of recent literature on all optical networking is presented. Starting from multiplexing techniques and topological features, network design and performance issues are reviewed. Particular attention is devoted to Wavelength Division Multiplexing (WDM) networks. Static and dynamic solutions of the routing and wavelength assignment (RWA) problem are considered. Issues of current research ...

a Seconda Università degli Studi di Napoli, Dipartimento di Ingegneria dell’Informazione, Via Roma 29, 81031 Aversa (CE), Italy Università degli Studi di Napoli Federico II, CSI, Complesso Universitario Monte S. Angelo, Via Cinthia, 80126 Napoli, Italy Universitat Politècnica de Catalunya (UPC), Departament d’Arquitectura de Computadors (DAC), Carrer Jordi Girona 1–3, 08034 Barcelona, Catalunya...

In transparent optical networks as the signal propagates through a transparent network it experiences the impact of a variety of quality degrading phenomena that are introduced by different types of signal distortions. In this chapter we present a new optical networking paradigm for mesh topology, in which the impact of physical layer impairments are considered in lightpath routing (routing and...

In this paper, we propose and demonstrate a new adaptive routing algorithm based on lexicographical optimization applicable to all-optical multi-wavelength networks. Such an algorithm appeared in [1] for IP packet routing. But because of its time complexity and the peculiarities of all-optical networks, we can’t apply it directly in all-optical networks. Here we develop a new approach that addr...

We present an Integer Linear Program based algorithm and a K shortest path based heuristic algorithm for solving the Routing and Wavelength Assignment problem in All Optical Networks with Limited Wavelength Conversion. These algortihms are executed on a random mesh National Science Foundation Network(NSFNET). Their performances are compared.