TY - JOUR
T1 - An optical hybrid switch with circuit queueing for burst clearing
AU - Wong, Eric W.M.
AU - Zukerman, Moshe
PY - 2008
Y1 - 2008
N2 - We consider an optical hybrid switch that can function as an optical burst switch and/or optical circuit switch. We propose and describe in detail a new implementation whereby circuits have nonpreemptive priority over bursts. To achieve nonpreemptive priority, during circuit setup time, if there exist bursts that use wavelength channels (also called links) required by the circuit, the circuit is allowed to queue for a relatively short period of time until these bursts are cleared. We present an analysis based on a 3-D Markov chain that provides exact results for the blocking probabilities of bursts and circuits, the proportion of circuits that are delayed and the mean delay of the circuits that are delayed. 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 based on reducing the 3-D state space into a single dimension. These scalable approximations that can produce performance results in few seconds can readily enable switch dimensioning. Extensive numerical results are presented to demonstrate the accuracy and the use of the new approximations. © 2008 IEEE.
AB - We consider an optical hybrid switch that can function as an optical burst switch and/or optical circuit switch. We propose and describe in detail a new implementation whereby circuits have nonpreemptive priority over bursts. To achieve nonpreemptive priority, during circuit setup time, if there exist bursts that use wavelength channels (also called links) required by the circuit, the circuit is allowed to queue for a relatively short period of time until these bursts are cleared. We present an analysis based on a 3-D Markov chain that provides exact results for the blocking probabilities of bursts and circuits, the proportion of circuits that are delayed and the mean delay of the circuits that are delayed. 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 based on reducing the 3-D state space into a single dimension. These scalable approximations that can produce performance results in few seconds can readily enable switch dimensioning. Extensive numerical results are presented to demonstrate the accuracy and the use of the new approximations. © 2008 IEEE.
KW - Blocking probability
KW - Optical burst switching (OBS)
KW - Optical circuit switching (OCS)
KW - Optical hybrid switching (OHS)
KW - Queueing delay
UR - http://www.scopus.com/inward/record.url?scp=60949100865&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-60949100865&origin=recordpage
U2 - 10.1109/JLT.2008.917320
DO - 10.1109/JLT.2008.917320
M3 - RGC 21 - Publication in refereed journal
SN - 0733-8724
VL - 26
SP - 3509
EP - 3527
JO - Journal of Lightwave Technology
JF - Journal of Lightwave Technology
IS - 21
ER -