Abstract
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.
Highlights
The major growth of personalised video streaming services and the paradigm shift toward big data all add to the bandwidth requirements of Internet users, urging network providers to provision them with more capacity
Current end-to-end communication suffers capacity loss from inflexible switching in intermediary nodes, urging for a more flexible approach to optical switching. Addressing this need, both optical burst switching (OBS) and optical packet switching (OPS) provide alternatives, but require contention resolution in intermediate nodes, which can be done by means of buffering
We show that by discretising time, the fibre-loop buffer can be exactly modelled by an exhaustive polling system
Summary
The major growth of personalised video streaming services and the paradigm shift toward big data all add to the bandwidth requirements of Internet users, urging network providers to provision them with more capacity. As can be intuitively understood, there is no benefit in reserving the outgoing channel earlier in time, since this prohibits rescheduling of packets present in the buffer as new packets arrive This is confirmed in [19], where the specific case of a single fibre loop is considered. Packets are delayed for the smallest multiple of the loop duration S larger than the time needed for all previously arrived packets to have left the buffer, the so-called scheduling horizon This approach corresponds to the prereservation scenario considered in [19], as well as to horizon scheduling (with pre-reservation required by the hardware) in [17].
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
