Open Access
The European Traffic Observatory Measurement Infraestructure (ETOMIC): a testbed for universal active and passive measurements
(IEEE, 2005) Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Aracil Rico, Javier; Naranjo Abad, Francisco José; Alonso Camaró, Ulisses; Astiz Saldaña, Francisco Javier; Vattay, Gábor; Csabai, István; Hága, Péter; Simon, Gábor; Stéger, József; Automática y Computación; Automatika eta Konputazioa
The European Traffic Observatory is a European Union VI Framework Program sponsored effort, within the Integrated Project EVERGROW, that aims at providing a paneuropean traffic measurement infrastructure with highprecision, GPS-synchronized monitoring nodes. This paper describes the system and node architectures, together with the management system. On the other hand, we also present the testing platform that is currently being used for testing ETOMIC nodes before actual deployment.
Open Access
Multiresolution analysis of optical burst switching traffic
(IEEE, 2003) Aracil Rico, Javier; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Automática y Computación; Automatika eta Konputazioa
In this paper, a Multiresolution Analysis is conducted in order to study the self-similar features of Optical Burst Switching (OBS) traffi c. The scenario consists of an OBS backbone with input traffic from a large number of Internet users, that generate Poisson-arriving heavytailed bursts. The results show that long-range dependence is preserved at timescales longer than the burst assembly timeout value while the traffic variability at short timescales is increased.
Open Access
The ETOMIC active probing infrastructure: demo proposal
(2006) Csabai, István; Hága, Péter; Simon, Gábor; Stéger, József; Vattay, Gábor; Magaña Lizarrondo, Eduardo; Morató Osés, Daniel; Izal Azcárate, Mikel; Aracil Rico, Javier; Automática y Computación; Automatika eta Konputazioa
ETOMIC (www.etomic.org) is a European Union sponsored effort, that aims at providing a Paneuropean traffic measurement infrastructure. This infrastructure contains 15 PC based active probing nodes equipped with high-precision, sending capable DAG cards and GPS receivers to achieve time synchronization. Such cards are specifically designed to transmit packet trains with strict timing, in the range of nanoseconds. Every kind of active probing techniques can be applied on the nodes, from the quite simple ping application to the complex network tomography methods which are based on the synchronized sending capability of the DAG cards. The measurement nodes are centrally managed via a web platform, where the new arbitrary measurement jobs can be uploaded to and handled. The management system schedules the jobs and does the maintenance tasks. Now, the infrastructure is opened to the networking community. This paper describes the node architectures, the management system, and the proposed conference demonstration.
Open Access
Predicción de tráfico de Internet and aplicaciones
(2001) Bernal, I.; Aracil Rico, Javier; Morató Osés, Daniel; Izal Azcárate, Mikel; Magaña Lizarrondo, Eduardo; Díez Marca, L. A.; Automática y Computación; Automatika eta Konputazioa
In this paper we focus on traffic prediction as a means to achieve dynamic bandwidth allocation in a generic Internet link. Our findings show that coarse prediction (bytes per interval) proves advantageous to perform dynamic link dimensioning, even if we consider a part of the top traffic producers in the traffic predictor.
Open Access
Delay-throughput curves for timer-based OBS burstifiers with light load
(IEEE, 2006) Izal Azcárate, Mikel; Aracil Rico, Javier; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
The OBS burstifier delay-throughput curves are analyzed in this paper. The burstifier incorporates a timer-based scheme with minimum burst size, i. e., bursts are subject to padding in light-load scenarios. Precisely, due to this padding effect, the burstifier normalized throughput may not be equal to unity. Conversely, in a high-load scenario, padding will seldom occur. For the interesting light-load scenario, the throughput delay curves are derived and the obtained results are assessed against those obtained by trace-driven simulation. The influence of long-range dependence and instantaneous variability is analyzed to conclude that there is a threshold timeout value that makes the throughput curves flatten out to unity. This result motivates the introduction of adaptive burstification algorithms, that provide a timeout value that minimizes delay, yet keeping the throughput very close to unity. The dependence of such optimum timeout value with traffic long-range dependence and instantaneous burstiness is discussed. Finally, three different adaptive timeout algorithms are proposed, that tradeoff complexity versus accuracy.
Open Access
Approximations for end-to-end delay analysis in OBS networks with light load
(IEEE, 2004) Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Automática y Computación; Automatika eta Konputazioa
In this paper we provide an analysis of end-to-end delay in OBS networks and a large deviations approximation. The analysis is based on an exponential approximation of the OBS router blocking time and on the assumption of Poisson arrivals in routers along the path from source to destination. On the other hand, a lightload assumption is performed, namely, waiting time is mainly due to residual life of the output wavelengths and not to buffering.
Open Access
IP traffic prediction and equivalent bandwidth for DAMA TDMA protocols
(IEEE, 2003) Aracil Rico, Javier; Izal Azcárate, Mikel; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
The use of IP traffic prediction techniques for DAMA TDMA protocols is investigated in this paper. The predicted traffic distribution is derived when the input traffic shows long-range dependence features. Furthermore, an equivalent bandwidth is calculated, which allows the wireless terminal to request a certain amount of bandwidth (slot duration) in terms of a target traffic loss probability. The numerical results indicate very good traffic prediction capabilities, together with moderate bandwidth loss.
Open Access
On linear prediction of Internet traffic for packet and burst switching networks
(IEEE, 2001) Morató Osés, Daniel; Aracil Rico, Javier; Díez Marca, L. A.; Izal Azcárate, Mikel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
In this paper, we show that prediction algorithms in the least mean square error sense prove better in a burst rather than in a packet switching network. For the latter, further information about the packet arrival distribution within the prediction interval is required. Regarding burst switching, we compare Optical Burst Switching networks with and without linear prediction to conclude that linear prediction provides a significant improvement in end-to-end latency with low bandwidth waste.
Open Access
Evaluation of preemption probabilities in OBS networks with burst segmentation
(IEEE, 2005) Magaña Lizarrondo, Eduardo; Morató Osés, Daniel; Izal Azcárate, Mikel; Aracil Rico, Javier; Automática y Computación; Automatika eta Konputazioa
Preemption techniques have been recently proposed for service differentiation in Optical Burst Switching (OBS) networks. According to [1], an incoming burst with the same priority that the burst in service will preempt the wavelength if the residual length of the burst in service is smaller than the incoming burst transmission time. For a network scenario with no wavelength conversion, the preemption probability is evaluated assuming Exponential, Gaussian and Pareto-distributed burst sizes. Knowledge of the preemption dynamics at an OBS switch is a fundamental issue in performance evaluation, since the downstream switches will surely be affected. An analytical upper bound is provided, that shows that the preemption probability depends on the burst size distribution, which in turn depends on the burst assembly technique used at the network edges. On the other hand, not only truncated bursts result from preemption, as reported in other studies, but also the burst size distribution for preempting bursts is shifted to larger values.
Open Access
Blocking time analysis of OBS routers with arbitrary burst size distribution
(IEEE, 2003) Morató Osés, Daniel; Izal Azcárate, Mikel; Aracil Rico, Javier; Magaña Lizarrondo, Eduardo; Miqueleiz Alamos, J.; Automática y Computación; Automatika eta Konputazioa
The blocking time distribution for an OBS router is obtained, under the assumption of Poisson-arriving bursts with Pareto, Gaussian and Exponential burst size distributions. Analytical expressions are provided as a function of number of wavelengths per port. Such expressions can be used to dimension Fiber Delay Lines (FDLs) and to perform end-to-end delay estimation. On the other hand, we show that the blocking time distribution becomes exponential as the number of wavelengths increases, regardless of the burst size distribution. Since the burst size distribution is determined by the burst assembly algorithm at the network edges, we conclude that the burst assembly algorithm will have no influence on both burst blocking probability and burst blocking time in future DWDM networks.