HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

An Explicit Control Algorithm for Optical FIFO Queues

Anne Bouillard 1 Cheng-Shang Chang 2
1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : With the recent advances in optical technologies, it has become a challenge to build optical queues with minimal complexity. In [ChangCL06], it was shown that an optical FIFO queue can be constructed recursively by a concatenation of scaled optical memory cells, which in turn are made by 2 x 2 switches and fiber delay lines. However, as the construction is recursive, there is no explicit control algorithm for the 2 x2 switches in [ChangCL06]. The main contribution of this paper is to provide an explicit control algorithm for the 2 x2 switches in that construction. We show that our algorithm has O((log B)^2) space complexity and time complexity for an optical FIFO queue with buffer B.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00123901
Contributor : Anne Bouillard Connect in order to contact the contributor
Submitted on : Friday, January 12, 2007 - 1:14:33 PM
Last modification on : Friday, February 4, 2022 - 3:22:01 AM
Long-term archiving on: : Friday, November 25, 2016 - 1:22:09 PM

File

RRopt.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00123901, version 2

Citation

Anne Bouillard, Cheng-Shang Chang. An Explicit Control Algorithm for Optical FIFO Queues. [Research Report] RR-6097, INRIA. 2007, pp.11. ⟨inria-00123901v2⟩

Share

Metrics

Record views

119

Files downloads

153