𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strategies and Algorithms for Routing both Unicast and Multicast Paths in WDM Networks

✍ Scribed by Listanti, Marco ;Cervelli, Andrea ;Sabella, Roberto


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
993 KB
Volume
11
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

This paper introduces the concept of the multicast optical path in WDM networks, and treats the strategies and the algorithms, which allow the routing of plural multicast paths together with unicast paths. This analysis was motivated by the possibility of exploit the optical layer facilities in the transport network, to carry distributive services, such as video channels (e.g. CATV), without the need of dedicated transmission networks. The strategies and algorithms reported in this paper arise from a generalisation of those ones, which have been previously reported in literature. They are wavelength path (WP: which does not make use of wavelength conversion), virtual wavelength path (VWP: which make full use of wavelength conversion), and partial virtual wavelength path (PVWP: making a parsimonious use of wavelength conversion). The analysis shows the characteristics and performance of those strategies and algorithms considering, as a figure of merit, either the number of wavelengths or the system scale (dimensions of the optical nodes), and compare one to each other in order to point out advantages and disadvantages. The main result is that multicast optical paths can favourably be accommodated in a WDM network, and the strategy we propose, making a parsimonious use of wavelength conversion, allows the lowest system scale to be obtained with a very low number of wavelength converters.


πŸ“œ SIMILAR VOLUMES


Survivable routing in IP-over-WDM networ
✍ Frederick Ducatelle; Luca M. Gambardella πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 995 KB

In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge here is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in the case of a failure in the physical network. I

A Distributed Control Protocol for Wavel
✍ Mohan, Curusamy ;Murthy, Chebiyyam Siva Ram πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 816 KB

## Abstract This paper considers the problem of distributed routing with fairness improvement in wavelength‐routed wavelength‐division multiplexed (WDM) networks with dynamic traffic conditions. The wavelength continuity constraint imposed by WDM networks causes increased blocking of connection req