A generic-traffic optical buffer modeling for asynchronous optical switching networks

Almeida, Raul C.; Pelegrini, Jefferson U.; Waldman, Hélio

doi:10.1109/lcomm.2005.02004

Cited by 46 publications

(39 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Opposed to this, in [12], the combined effect of quantization and impatience was modeled in an exact manner, and a numerical procedure was provided for exact performance evaluation. Further, in [13], this numerical framework provided the starting point to extract exact closed-form performance expressions, for optical buffers in an M/D/1 and an M/M/1 setting, respectively.…”

Section: Quantization Modelmentioning

confidence: 99%

“…However, the solution of [8] (and its extended versions, [10] and [11]) provided an approximate solution that is inaccurate in some cases, as discussed below. An enhanced approach with Markov chains enabled accurate numerical results [12] as well as a solution in closed form [13], but does not allow for intuitive insight in the queueing behavior of the system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic performance model of optical buffers for variable length packets

et al. 2013

View full text Add to dashboard Cite

Optical switching (Optical Packet Switching, Optical Burst Switching, and others) provides alternatives to the current switching in backbone networks. To switch optically, also packet buffering is to be done optically, by means of Fiber Delay Lines (FDLs). Characteristic of the resulting optical buffer is the quantization of possible delays: only delays equal to the length of one of the FDLs can be realized.An important design challenge is the optimization of the delay line lengths for minimal packet loss. To this end, we propose a heuristic based on two existing queueing models: one with quantization and one with impatience. Combined, these models yield an accurate performance modeling heuristic. A key advantage of this heuristic is that it translates the optical buffer problem into two well-known queueing problems, with accurate performance expressions available in the literature. This paper presents the heuristic in detail, together with several figures, comparing the heuristic's output to existing approaches, validating its high accuracy.

show abstract

Section: Quantization Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Heuristic performance model of optical buffers for variable length packets

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Some of these results are illustrated in Section 7.6. Several analytical studies have been proposed to model the behaviour of the resource reservation and contention resolution in OBS/OPS nodes (e.g., [2,9]). Section 7.2.2 studies the accuracy on the use of balking models to analytically estimate the blocking probabilities in OBS nodes that use Fibre Delay Lines (FDLs).…”

Section: Introduction and State-of-the-artmentioning

confidence: 99%

Performance Issues in Optical Burst/Packet Switching

Careglio

Aracil

Azodolmolky

et al. 2009

Towards Digital Optical Networks

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. This chapter summarises the activities on optical packet switching (OPS) and optical burst switching (OBS) carried out by the COST 291 partners in the last 4 years. It consists of an introduction, five sections with contributions on five different specific topics, and a final section dedicated to the conclusions. Each section contains an introductive state-of-the-art description of the specific topic and at least one contribution on that topic. The conclusions give some points on the current situation of the OPS/OBS paradigms.

show abstract

“…While the typical approach is to build an analytic model based on the evolution of the scheduling horizon, a more effective modeling approach was developed in [1] by focusing on the waiting time only. This model is applicable for Bernoulli arrival processes, general burst size distributions and arbitrary sets of FDLs.…”

Section: Introductionmentioning

confidence: 99%

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Lambert

Rogiest

Houdt

et al. 2008

Analytical and Stochastic Modeling Techniques and Applications

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

A generic-traffic optical buffer modeling for asynchronous optical switching networks

Cited by 46 publications

References 5 publications

Heuristic performance model of optical buffers for variable length packets

Heuristic performance model of optical buffers for variable length packets

Performance Issues in Optical Burst/Packet Switching

A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Contact Info

Product

Resources

About