Paper
10 October 1997 Allocation of wavelength-convertible nodes and routing in all-optical networks
Author Affiliations +
Abstract
It is true that in all-optical networks, network performance can be improved by wavelength conversion. However, the switching node with wavelength conversion capability is still costly, and the number of such nodes should be limited in the network. In this paper, a performance optimization problem is treated in all-optical networks. We propose a heuristic algorithm to minimize an overall blocking probability by properly allocating a limited number of nodes with wavelength conversion capability. The routing strategy is also considered suitable to the case where the number of wavelength convertible nodes are limited. We validate the minimization level of our heuristic algorithm through numerical examples, and show that our algorithm can properly allocate nodes with conversion for performance optimization.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hiroaki Harai, Masayuki Murata, and Hideo Miyahara "Allocation of wavelength-convertible nodes and routing in all-optical networks", Proc. SPIE 3230, All-Optical Communication Systems: Architecture, Control, and Network Issues III, (10 October 1997); https://doi.org/10.1117/12.290387
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Lanthanum

Algorithm development

Switching

Optimization (mathematics)

Optical networks

Radium

Barium

RELATED CONTENT

Time-space label switched optical networks
Proceedings of SPIE (November 19 2007)
Multi-granularity optical switching networks test-bed
Proceedings of SPIE (December 05 2005)
The planning algorithms of ASTN architectures
Proceedings of SPIE (April 15 2004)
Design of a novel multistage OXC for large scale optical...
Proceedings of SPIE (September 09 2002)

Back to Top