Key parameters for contention resolution in multi-fiber Optical Burst/Packet Switching nodes

Callegati, Franco; Cerroni, Walter; Pavani, Gustavo Sousa

doi:10.1109/broadnets.2007.4550428

Cited by 19 publications

(17 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, wavelength conversion and optical buffering can (and should) be integrated consistently in a single contention resolution strategy. This integration has been referred to earlier as wavelength allocation in optical buffers [3,26,28], later as the channel and delay selection (CDS) problem [5], and is also the topic of the current paper.…”

Section: 1mentioning

confidence: 98%

“…Secondly, optical buffering consists in delaying packets/bursts that find a resource unavailable by sending it through a piece of fiber of sufficient length, so that the resource is available again when the packet/burst leaves the delay line [1,2,9,10,20,21,24]. Thirdly, in a multi-fiber setting, deflection or alternate routing consists in routing packets/bursts that find a resource unavailable to another node through an different, available output fiber [5,12]; this is done preferably topology-and congestion-aware [30]. The interplay of these dimensions is discussed extensively also in [5].…”

Section: 1mentioning

confidence: 99%

“…Thirdly, in a multi-fiber setting, deflection or alternate routing consists in routing packets/bursts that find a resource unavailable to another node through an different, available output fiber [5,12]; this is done preferably topology-and congestion-aware [30]. The interplay of these dimensions is discussed extensively also in [5].…”

Section: 1mentioning

confidence: 99%

See 2 more Smart Citations

On the optimality of packet-oriented scheduling in photonic switches with delay lines

Rogiest¹,

Turck²,

Laevens³

et al. 2011

Numerical Algebra, Control &Amp; Optimization

View full text Add to dashboard Cite

Abstract. Addressing the bandwidth inefficiency problem of current IP over DWDM backbone switching, Optical Packet/Burst Switching (OPS/OBS) provide viable solutions, capitalizing on statistical multiplexing gain, through packet-oriented scheduling. To resolve packet/burst contention, the involved photonic switches contain wavelength converters and fiber delay lines, controlled through a channel and delay selection (CDS) algorithm. Recently proposed CDS algorithms all rely on heuristics, of which the optimality is unexamined to date.This paper presents an in-depth analysis of the optimality of CDS algorithms. Methodologically, we rely on Markov chain analysis for performance evaluation, combined with a discrete Markov Decision Process formulation of the optimization problem, optimized for fast calculation, allowing to determine the exact optimum of a specific given setting of the switch, through numerical algebra solution techniques. Results point out that, for the basic switch setting assumed, of all known CDS algorithms, an algorithm called MING (MINimal Gap) is close to optimal, but never strictly optimal. Various graphs support this, showing that an algorithm optimal for any traffic load cannot (in general) be devised. Results for several other switch settings further confirm this, showing how known CDS algorithms might be modified, to attain improved control robustness.

show abstract

Section: 1mentioning

confidence: 98%

Section: 1mentioning

confidence: 99%

See 1 more Smart Citation

On the optimality of packet-oriented scheduling in photonic switches with delay lines

Rogiest¹,

Turck²,

Laevens³

et al. 2011

Numerical Algebra, Control &Amp; Optimization

View full text Add to dashboard Cite

show abstract

“…Many scheduling algorithms have been proposed so far in the literature, where the optimal target is to provide efficient resource utilization and minimum burst loss [6].…”

Section: Related Workmentioning

confidence: 99%

PI-OBS: a parallel iterative optical burst scheduler for OBS networks

Pavón‐Mariño

Veiga-Gontán

Ortuno-Manzanera

et al. 2009

2009 International Conference on High Performance Switching and Routing

Self Cite

View full text Add to dashboard Cite

show abstract

“…There, we were able to validate the usefulness of a cost-based approach and achieved an increased performance (decreased LP). Although these algorithms can improve the performance significantly, their structure is very similar to existing algorithms [7]. Indeed, they can also be split up in two big categories: void-filling and non-void-filling algorithms.…”

Section: Introductionmentioning

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

Key parameters for contention resolution in multi-fiber Optical Burst/Packet Switching nodes

Cited by 19 publications

References 13 publications

On the optimality of packet-oriented scheduling in photonic switches with delay lines

On the optimality of packet-oriented scheduling in photonic switches with delay lines

PI-OBS: a parallel iterative optical burst scheduler for OBS networks

Fill the Void: Improved Scheduling for Optical Switching

Contact Info

Product

Resources

About