Analysis of fibre-loop optical buffers with a void-avoiding schedule
In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a sing...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
European Alliance for Innovation (EAI)
2015-11-01
|
Series: | EAI Endorsed Transactions on Internet of Things |
Subjects: | |
Online Access: | https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258180 |
id |
doaj-d4ebacc84508422280bdddb26d3fd371 |
---|---|
record_format |
Article |
spelling |
doaj-d4ebacc84508422280bdddb26d3fd3712020-11-25T01:00:58ZengEuropean Alliance for Innovation (EAI)EAI Endorsed Transactions on Internet of Things2414-13992015-11-011310.4108/icst.valuetools.2014.258180Analysis of fibre-loop optical buffers with a void-avoiding scheduleWouter Rogiest0Jan-Pieter Dorsman1Dieter Fiems2Ghent UniversityEindhoven University of Technology / Centrum Wiskunde & InformaticaGhent UniversityIn optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a single-stage buffer. In this contribution, we investigate the performance of such a buffer in an asynchronous network setting, assuming batch-Poisson arrivals and assuming a so-called void-avoiding schedule. We show that by time-discretisation, the fibre-loop dynamics can be captured by a particular type of exhaustive polling model. We obtain performance measures such as the moments of the optical queue content and packet delay for the discretised model as well as for the asynchronous optical buffer. We illustrate our approach by various numerical examples.https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258180optical buffer fiber loop queueing polling discrete continuous |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wouter Rogiest Jan-Pieter Dorsman Dieter Fiems |
spellingShingle |
Wouter Rogiest Jan-Pieter Dorsman Dieter Fiems Analysis of fibre-loop optical buffers with a void-avoiding schedule EAI Endorsed Transactions on Internet of Things optical buffer fiber loop queueing polling discrete continuous |
author_facet |
Wouter Rogiest Jan-Pieter Dorsman Dieter Fiems |
author_sort |
Wouter Rogiest |
title |
Analysis of fibre-loop optical buffers with a void-avoiding schedule |
title_short |
Analysis of fibre-loop optical buffers with a void-avoiding schedule |
title_full |
Analysis of fibre-loop optical buffers with a void-avoiding schedule |
title_fullStr |
Analysis of fibre-loop optical buffers with a void-avoiding schedule |
title_full_unstemmed |
Analysis of fibre-loop optical buffers with a void-avoiding schedule |
title_sort |
analysis of fibre-loop optical buffers with a void-avoiding schedule |
publisher |
European Alliance for Innovation (EAI) |
series |
EAI Endorsed Transactions on Internet of Things |
issn |
2414-1399 |
publishDate |
2015-11-01 |
description |
In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a single-stage buffer. In this contribution, we investigate the performance of such a buffer in an asynchronous network setting, assuming batch-Poisson arrivals and assuming a so-called void-avoiding schedule. We show that by time-discretisation, the fibre-loop dynamics can be captured by a particular type of exhaustive polling model. We obtain performance measures such as the moments of the optical queue content and packet delay for the discretised model as well as for the asynchronous optical buffer. We illustrate our approach by various numerical examples. |
topic |
optical buffer fiber loop queueing polling discrete continuous |
url |
https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258180 |
work_keys_str_mv |
AT wouterrogiest analysisoffibreloopopticalbufferswithavoidavoidingschedule AT janpieterdorsman analysisoffibreloopopticalbufferswithavoidavoidingschedule AT dieterfiems analysisoffibreloopopticalbufferswithavoidavoidingschedule |
_version_ |
1725211624163246080 |