A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution

Rogiest, Wouter; Lambert, J.; Fiems, Dieter; Houdt, Benny Van; Bruneel, Herwig; Blondia, Chris

doi:10.1016/j.peva.2009.01.002

Cited by 24 publications

(31 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A possible explanation is that when the load is 'low' (60 %), the probability of finding a horizon index n = 8 is smaller than for higher load (80 %), thus reducing the number of instances fillable voids can be created and the LP is reduced. The load for which this inversion is observed may be linked to the critical load of 69.3 % for which the infinite system without void creation becomes unstable (ρ = ln(2), see [4]). …”

Section: Performance Resultsmentioning

confidence: 99%

Void-creating algorithm in OPS/OBS: Mind the gap

Hautegem¹,

Rogiest²,

Bruneel

2015

AIP Conference Proceedings

View full text Add to dashboard Cite

Abstract. In optical packet/burst switching, packet contention on a single wavelength is resolved effectively by means of Fiber Delay Lines. The involved scheduling algorithm is typically designed to minimize packet loss, by filling so-called voids, and trying to keep the so-called gaps small. We propose a new type of algorithm that selectively creates voids that are larger than strictly needed, only when these will likely be filled. Results obtained by Monte Carlo simulation show that selective void creation can significantly reduce packet loss.

show abstract

Section: Performance Resultsmentioning

confidence: 99%

Void-creating algorithm in OPS/OBS: Mind the gap

Hautegem¹,

Rogiest²,

Bruneel

2015

AIP Conference Proceedings

View full text Add to dashboard Cite

show abstract

“…The length of the arriving packets is assumed a fixed length B equal to the granularity, B = D. While matching the granularity and the packet size is a natural choice in view of performance (see [9]), it also enables to devise an intuitive void-creating scheduling algorithm, as argued below. Algorithms with a similar scheduling strategy for other values of D of course can be thought of, but are considered out of the scope of this paper.…”

Section: A Assumptionsmentioning

confidence: 99%

Fill the Void: Improved Scheduling for Optical Switching

Hautegem

Rogiest

Bruneel

2015

2015 27th International Teletraffic Congress

View full text Add to dashboard Cite

Abstract-With ever-increasing demand for bandwidth, optical packet/burst switching is proposed to utilize more of the available capacity of optical networks in the future. In these packet-based switching techniques, packet contention on a single wavelength is resolved effectively by means of Fiber Delay Lines. The involved scheduling algorithms are typically designed to minimize packet loss and/or packet delay. By filling so-called voids, void-filling algorithms are known to outperform their non-void-filling counterparts. This however comes at a large computational cost as the void-filling algorithms have to keep track of beginnings and endings of all voids. This is opposed to the non-void-filling algorithms which only have to keep track of a single system state variable. We therefore propose a new type of algorithm that selectively creates voids that are larger than strictly needed, only when these will likely be filled. Results obtained by Monte Carlo simulation show that selective void creation can jointly reduce packet loss by 50% and packet delay by 18%, without imposing a high computational cost.

show abstract

“…, N . Since this setting is known to be optimal in many (but not all) cases (for discussion, see [9]), it is also assumed in this work.…”

Section: Quantization Modelmentioning

confidence: 99%

“…This assumption allows to derive a simple characterization of the equivalent load that is independent of the actual number of delay lines. As discussed in [9], the most efficient way to tackle the analysis is by focusing on the evolution of assigned waiting times. In the infinite FDL buffer system, we associate waiting time W k with the kth packet, and define it as the time between the acceptance of packet k, and the start of its transmission.…”

Section: Quantizationmentioning

confidence: 99%

“…The lengths in a feed-forward setup are usually assumed multiples of a basic delay unit called granularity [8]. In a network with fixedlength packets, a natural choice is to let the granularity match the packet length, although this is not necessarily the optimal choice [9]. Of particular interest to this work is the case of asynchronous variable length packets, where such a "natural choice" is not readily available, and the line length optimization problem involves both the buffer size and traffic load.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic performance model of optical buffers for variable length packets

et al. 2013

Self Cite

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

A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution

Cited by 24 publications

References 11 publications

Void-creating algorithm in OPS/OBS: Mind the gap

Void-creating algorithm in OPS/OBS: Mind the gap

Fill the Void: Improved Scheduling for Optical Switching

Heuristic performance model of optical buffers for variable length packets

Contact Info

Product

Resources

About