On routing of wavebands for all-to-all communications in all-optical paths and cycles

We discuss a model of the all-optical communication technology and an implementation of a simple task, all-to-all, in simple topologies like paths and cycles. The model assumes a single interval (variant of band-pass) filter extracting signal wavelengths for processing and forwarding in intermediate...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2005-03, Vol.333 (3), p.401-413
Main Authors: Flammini, Michele, Navarra, Alfredo, Proskurowski, Andrzej
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
All optical circuits
All-optical networks
Applied sciences
Circuit properties
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Cycles
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Graph theory
Mathematical logic, foundations, set theory
Mathematics
Optical and optoelectronic circuits
Paths
Routing
Sciences and techniques of general use
Set theory
Theoretical computing
Wavebands filtering
WDM
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We discuss a model of the all-optical communication technology and an implementation of a simple task, all-to-all, in simple topologies like paths and cycles. The model assumes a single interval (variant of band-pass) filter extracting signal wavelengths for processing and forwarding in intermediate communication nodes. In an attempt to use a minimum number of wavelengths, we give lower and upper bounds on the cardinality of the spectrum used in four cases arising from different assumptions on the topology and the filters. In particular, we propose efficient schedules of directed paths between all pairs of nodes in graphs of maximum node degree two, under the assumption of either a “linear” or “wrapped-around” wavelength spectrum.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.05.025