Tracing an Optical Buffer’s Performance: An Effective Approach

Rogiest, Wouter; Fiems, Dieter; Laevens, Koenraad; Bruneel, Herwig

doi:10.1007/978-3-540-72709-5_20

Cited by 9 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the reduction procedure proposed in this paper heavily builds on the approach developed in [12], we start with a (brief) discussion of this approach.…”

Section: Discussionmentioning

confidence: 99%

“…Several architectures that make use of an FDL buffer have already been identified [3], [4], [8]. The main performance measure of an FDL buffer is its loss rate and analytic and simulation based results concerning the loss rates have been reported in [2], [5], [6], [9], [10], [12].…”

Section: Introductionmentioning

confidence: 99%

“…This model is applicable for Bernoulli arrival processes, general burst size distributions and arbitrary sets of FDLs. As the waiting time of a burst corresponds to the length of one of the FDLs, the computational complexity in [12] depended solely on the number of FDLs N , which is typically small, whereas with the scheduling-horizon-based analysis the complexity was a function of the length of the longest delay line (in slots).…”

Section: Introductionmentioning

confidence: 99%

“…Eventhough N is typically small, the approach taken in [12] has to be reperformed for each set of FDL lengths, which can be very time-consuming in an FDL length optimization procedure. In this paper we develop a Hessenberg reduction of the model presented in [12], which not only allows us to assess the loss rate more quickly for a single set of FDL lengths, but also enables us to compute the loss rate for various FDL length settings at the same time.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we develop a Hessenberg reduction of the model presented in [12], which not only allows us to assess the loss rate more quickly for a single set of FDL lengths, but also enables us to compute the loss rate for various FDL length settings at the same time. This significantly reduces the time required to perform an FDL length optimization.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Lambert

Rogiest

Houdt

et al. 2008

Analytical and Stochastic Modeling Techniques and Applications

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we present an approach to compute the invariant vector of the N + 1 state Markov chain P presented in (Rogiest et al., Lecture Notes in Computer Science, NET-COOP 2007 Special Issue, pp. 4465:185-194) to determine the loss rate of an FDL buffer consisting of N lines, by solving a related Hessenberg system (i.e., a Markov chain skip-free in one direction). This system is obtained by inserting additional time instants in the sample paths of P and allows us to compute the loss rate for various FDL lengths by solving a single system. This is shown to be especially effective in reducing the computation time of the heuristic LRA algorithm presented in (Lambert et al., Proc. NAEC 2005, pp. 545-555) to optimize the FDL lengths, where improvements of several orders of magnitude can be realized.

show abstract

“…As the reduction procedure proposed in this paper heavily builds on the approach developed in [12], we start with a (brief) discussion of this approach.…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Lambert

Rogiest

Houdt

et al. 2008

Analytical and Stochastic Modeling Techniques and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

Stability of single‐wavelength optical buffers

Rogiest

Morozov

Fiems

et al. 2009

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYOptical burst switching (OBS) provides a future-proof alternative to the current electronic switching in the backbone, but has buffering implemented with a set of fiber delay lines (FDLs). The resulting buffering system fundamentally differs from a classic one, in that the set of possible waiting times is not a continuum (like in the classic case) but rather a denumerable set, each value corresponding to the length of a delay line. As a result, arriving bursts in general have to wait longer than they would in a classic buffer, since their waiting time has to be in that denumerable set. The additional delay results in overall longer waiting times, when compared to a classic infinite buffer system with a continuous waiting room. While previous work already focused on the performance evaluation of finite optical buffers, the stability problem of the infinite system received only little attention. This contribution is the first to present a complete proof of sufficient stability conditions in the case of a general infinite FDL set, general arrival process and general service times. The key elements of analysis is the exploiting of the regenerative property of the waiting-time process and a characterisation of the limiting forward renewal time process. The given bound on the traffic load guarantees stability for a wide class of GI/G/1 optical buffers, and poses no restriction on the FDL lengths.

show abstract

Wavelength allocation in an optical switch with a fiber delay line buffer and limited-range wavelength conversion

Pérez

Houdt

2009

Telecommun Syst

View full text Add to dashboard Cite

This paper presents an approach to evaluate the performance of an optical switch equipped with both limited-range wavelength conversion and Fiber Delay Lines to resolve contention. We propose an analytical model that allows a general behavior for the packet size distribution while the inter-arrival times are assumed to be of PhaseType and can easily be relaxed to be generally distributed if needed. As the set of reachable wavelengths is a major issue in limited-range wavelength conversion, we first focus on a simple wavelength set configuration that allows the comparison of different policies and their effect on the loss rate of the system. In addition, a linear association between the loss rate of the simple and a more complex set configuration is identified. Using this association and the results from the analytical model, we derive an approximation for the more complex case, where the interactions among adjacent wavelengths play an important role. The approximation works well for different parameter instances and is particularly useful for the mid load case, when simulations become computationally prohibitive. This work has been supported by the FWO-Flanders through project "Stochastic modeling of optical buffers and switching systems based on Fiber Delay Lines" (G.0538.07).

show abstract

Tracing an Optical Buffer’s Performance: An Effective Approach

Cited by 9 publications

References 10 publications

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Stability of single‐wavelength optical buffers

Wavelength allocation in an optical switch with a fiber delay line buffer and limited-range wavelength conversion

Contact Info

Product

Resources

About