Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks

Benes networks are rearrangeable nonblocking networks and are among the most efficient switching architectures in terms of the number of switching elements (SEs) used. In optical Benes networks, if two I/O connecting paths with the same (close) wavelength(s) share a common SE, crosstalk occurs. In o...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel, emergent and distributed systems Vol. 22; no. 1; pp. 39 - 58
Main Authors: Lu, Enyue, Zheng, S. Q.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.02.2007
Subjects:
05C15 Coloring of graphs and hypergraphs
05C85 Graph algorithms
68W10 Parallel algorithms
94C10 Switching theory
Benes network
Crosstalk
Graph coloring
Optical switching
Parallel algorithm
Wavelength assignment
ISSN:1744-5760, 1744-5779
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Benes networks are rearrangeable nonblocking networks and are among the most efficient switching architectures in terms of the number of switching elements (SEs) used. In optical Benes networks, if two I/O connecting paths with the same (close) wavelength(s) share a common SE, crosstalk occurs. In order to reduce the crosstalk effect, three approaches, time, space and wavelength dilations have been proposed. In this paper, we present polylogarithmic-time reconfiguration algorithms for realizing any (partial) permutation in time, space and wavelength dilated optical Benes networks using a linear number of processors. Our algorithms are based on a logarithmic-time permutation decomposition algorithm and apply graph coloring techniques such as edge coloring, equitable coloring and vertex coloring.
ISSN:1744-5760
1744-5779
DOI:10.1080/17445760601029453