z-logo
open-access-imgOpen Access
Performance evaluation for an optical hybrid switch with circuit queued reservations
Author(s) -
E.W.M. Wong,
Moshe Zukerman
Publication year - 2005
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/opex.13.009446
Subject(s) - computer science , blocking (statistics) , optical switch , circuit switching , scalability , electronic circuit , markov chain , optical burst switching , electronic engineering , dimensioning , wavelength , topology (electrical circuits) , wavelength division multiplexing , telecommunications , computer network , optical performance monitoring , optics , physics , electrical engineering , quantum mechanics , database , machine learning , engineering , aerospace engineering
We provide here a new loss model for an optical hybrid switch that can function as an optical burst switch or optical circuit switch or both simultaneously. We introduce the feature of circuit queued reservation. That is, if a circuit request arrives and cannot find a free wavelength, and if there are not too many requests queued for reservations, it may join a queue and wait until such wavelength becomes available. We first present an analysis based on a 3-dimension state-space Markov chain that provides exact results for the blocking probabilities of bursts and circuits. We also provide results for the proportion of circuits that are delayed and the mean delay of the circuits that are delay. Because it is difficult to exactly compute the blocking probability in realistic scenarios with a large number of wavelengths, we derive computationally scalable and accurate approximations which are based on reducing the 3-dimension state space into a single dimension. These scalable approximations that can produce performance results in a fraction of a second can readily enable switch dimensioning.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here