Performance comparison of scheduling algorithms for IPTV traffic over polymorphous OBS routers

Abstract

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: ABSTRACTRecent research in Optical Burst Switched networks has proposed solutions to support subwavelength reservation for the periodic transmission of data bursts, which can coexist with conventional asynchronous bursts, bringing the Polymorphous, Agile and Transparent Optical Networks (PATON) [1]. Thus, network operators can distribute IPTV channels to their customers, whereby they can use the spare bandwidth for the transmission of best-effort traffic, making use of the free gaps in between such periodic reservations. This work proposes scheduling algorithms for the transmission of periodic channels using PATON, and studies the blocking probability observed by best-effort traffic, when such scheduling algorithms are used.

Performance Evaluation and Design of Polymorphous OBS Networks With Guaranteed TDM Services

“…This shall be referred to as First-Fit scheduling of best-effort traffic onwards. Different scheduling strategies have been analysed in detail in a previous work by the authors (see [11] for more details), showing the First Fit strategy to outperform over other ones. In addition, such previous study [11] provides an analytical approximation for the blocking probability experienced by asynchronous data bursts in such scenario, given by (1) which was validated with extensive simulations.…”

“…Different scheduling strategies have been analysed in detail in a previous work by the authors (see [11] for more details), showing the First Fit strategy to outperform over other ones. In addition, such previous study [11] provides an analytical approximation for the blocking probability experienced by asynchronous data bursts in such scenario, given by (1) which was validated with extensive simulations. Here, refers to the offered traffic intensity of asynchronous data bursts, in Erlang, denotes the number of wavelengths and the Erlang-B equation is given by (2) Intuitively, (1) takes into account the cases whereby a random burst arrival occurs during either an active or an idle period.…”

“…The reader is referred to [12] for a detailed analysis of the EFP iterative loop above. It is important to remark that (11) has been modified from the original study by Kelly et al to deal with the fact that, when using a one-way reservation algorithm such as JET, the traffic offered to link depends on the blocking probability of all links which preceed within route , as described in [17].…”

“…This leaves the remaining 92% of total capacity for the transmission of asynchronous data bursts. Assuming active periods occur every 2.5 ms, as measured from a Spanish IPTV service provider (see [11] for further details), the and periods are given by ms ms ms ms (15) Finally, data bursts are assumed of 100 KBytes of fixed size, thus the duration is:…”

“…Only the authors in [11] have addressed the performance evaluation of POBS in terms of the blocking probability experienced by best-effort data bursts, generated by a size-based burst assembler [6], when one of such synchronous reservations exist over a single wavelength. However, there is still a need for providing a complete performance evaluation study of generic network topologies with more than one TDM reservation per optical fibre.…”