Optical switch dimensioning and the classical occupancy problem

The service evolution and the rapid increase in traffic levels fuel the interest toward switching paradigms enabling the fast allocation of Wavelength Division Multiplexing WDM channels in an on demand fashion with fine granularities (microsecond scales). For this reason, in the last years, different optical switching paradigms have been proposed: optical-packet switching (OPS), optical-burst switching (OBS), wavelength-routed OBS, etc. Among the various all-optical switching paradigms, OPS attracts increasing attention. Owing to the high switching rate, Semiconductor Optical Amplifier (SOA) is a key technology to realize Optical Packet Switches. We propose some Optical Packet Switch (OPS) architectures and illustrate their realization in SOA technology. The effectiveness of the technology in reducing the power consumption is also analyzed. The chapter is organized in three sections. The main blocks (Switching Fabric, Wavelength Conversion stage, Synchronization stage) of an OPS are illustrated in Section 2 where we also show some examples of realizing wavelength converters and synchronizers in SOA technology. Section 3 introduces SOA-based single-stage and multi-stage switching fabrics. Finally the SOA-based OPS power consumption is investigated in Section 4

show abstract

“…The evaluation of this term has been evaluated in (Eramo et al, 2002;2009c) by solving an urn problem (Eramo et al, 2002 …”

Section: Appendix-a: Evaluation Ofmentioning

confidence: 99%

SOA-Based Optical Packet Switching Architectures

Eramo¹,

Miucci²,

Cianfrani³

et al. 2012

Selected Topics on Optical Amplifiers in Present Scenario

View full text Add to dashboard Cite

show abstract

“…Another recent application for color occupancy problems is the analysis of wavelength conversion in the optical packet switch described in [8]. In each time slot, a random collection of packets (balls) arrive on a set of input fibers and must be routed onto a set of output fibers (urns).…”

Section: Introductionmentioning

confidence: 99%

“…Typical quantities to be computed include the probability of requiring a large number of wavelength converters and the probability of discarding a large number of packets. The problem was approached with single-color large deviations analysis in [8]; the results there give only an upper bound on the true number of converters because packets discarded due to fiber capacity were also considered to require conversion. By contrast, the multi-color analysis contains the information needed to avoid this overestimation by taking fiber capacity into account.…”

Section: Introductionmentioning

confidence: 99%

Large Deviations Principle for Occupancy Problems with Colored Balls

2007

Self Cite

View full text Add to dashboard Cite

A large deviations principle (LDP), demonstrated for occupancy problems with indistinguishable balls, is generalized to the case in which balls are distinguished by a finite number of colors. The colors of the balls are chosen independently from the occupancy process itself. There are r balls thrown into n urns with the probability of a ball entering a given urn being 1/n (i.e. Maxwell-Boltzmann statistics). The LDP applies with the scale parameter, n, tending to infinity and r increasing proportionally. The LDP holds under mild restrictions, the key one being that the coloring process by itself satisfies an LDP. This includes the important special cases of deterministic coloring patterns and colors chosen with fixed probabilities independently for each ball.

show abstract

“…A recent motivating application for colored occupancy problems is the analysis of wavelength conversion in the optical packet switch described in [6]. In each time slot, a random collection of packets (balls) arrive on a set of input fibers and must be routed onto a set of output fibers (urns).…”

Section: Introductionmentioning

confidence: 99%

“…Typical quantities to be computed include the probability of requiring a large number of wavelength converters and the probability of discarding a large number of packets. The problem was approached with single color large deviation analysis in [6]; the results there give only an upper bound on the true number of converters because packets discarded due to fiber capacity were also considered to require conversion. By contrast, the multi-colored analysis contains the information needed to avoid this overestimation by taking fiber capacity into account.…”

Section: Introductionmentioning

confidence: 99%

Large Deviation Principle for Occupancy Problems With Colored Balls

Dupuis¹,

Nuzman²,

Whiting³

2003

Self Cite

View full text Add to dashboard Cite

A Large Deviations Principle (LDP), demonstrated for occupancy problems with indistinguishable balls, is generalized to the case in which balls may be distinguished by a finite number of colors. The colors of the balls are chosen independently from the occupancy process itself. There are r balls thrown into n urns with the probability of a ball entering a given urn being 1/n (Maxwell-Boltzman statistics). The LDP applies with the scale parameter n going to infinity and the number of balls increasing proportionally. It holds under mild restrictions, the key one being that the coloring process by itself satisfies a LDP. Hence the results include the important special cases of deterministic coloring patterns and of colors chosen with fixed probabilities independently for each ball.

show abstract

Optical switch dimensioning and the classical occupancy problem

Cited by 24 publications

References 6 publications

SOA-Based Optical Packet Switching Architectures

SOA-Based Optical Packet Switching Architectures

Large Deviations Principle for Occupancy Problems with Colored Balls

Large Deviation Principle for Occupancy Problems With Colored Balls

Contact Info

Product

Resources

About