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
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
Resolución de alias para el cálculo de topologías
(2007) García-Jiménez, Santiago; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
The network topology is a fundamental parameter for managers and researchers. The traditional methodology for discovering the topology of a network is based on the tool traceroute, used from several vantage points in different subnetworks. The result is a set of sink trees where the nodes are the discovered IP addresses from the routers. However, few tools have faced the problem of identifying the nodes in different sink trees as interfaces in the same router. This paper shows a new methodology for this problem of alias resolution. It has been used in the european research network using the ETOMIC platform. It shows that the traditional methodologies are not effective in today’s networking scenario but can be easily improved at least in a factor of 3 in the number of successes.
Open Access
Video over OBS Networks
(2008) Espina Antolín, Félix; Morató Osés, Daniel; Izal Azcárate, Mikel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
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
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.
Open Access
Arquitectura y diseño de un modelo de red OBS para simulación
(2009) Espina Antolín, Félix; Armendáriz Silva, Javier; Izal Azcárate, Mikel; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
Optical Burst Switching (OBS) es una nueva tecnología de conmutación óptica capaz de soportar una gran demanda de ancho de banda en backbones ópticos con Wavelength Division Multiplexing (WDM). Muchos investigadores están interesados en el estudio de esta propuesta emergente y la búsqueda de sus parámetros y entornos de funcionamiento óptimos. Sin embargo se encuentran con el gran handicap de que no existen muchas testbed para su estudio físico, ni tampoco herramientas de software óptimas para su estudio mediante simulaciones. En este trabajo se presenta un modelo de simulación de OBS para el simulador de eventos discretos OMNeT++. Este modelo permite estudiar tanto los nodos frontera, como los nodos del core, así como enlazar la red OBS con otras redes de datos soportadas en OMNeT++, principalmente IP. Además, el diseño presenta una gran modularidad lo que permite modificar fácilmente el modelo OBS para incluir futuras propuestas que se hagan sobre esta tecnología.
Open Access
Mejoras en la identificación de tráfico de aplicación basado en firmas
(2008) Santolaya Bea, Néstor; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
Traffic identification has been based traditionally on transport protocol ports, associating always the same ports with the same applications. Nowadays that assumption is not true and new methods like signature identification or statistical techniques are applied. This work presents a method based on signature identification with some improvements. The use of regular expressions for typical applications has been studied deeply and its use has been improved in the aspects of percentage identification and resources consumption. On the other hand, a flows-record structure has been applied in order to classify those packets that do not verify any regular expression. Results are compared with the opensource related project L7-filter, and the improvements are presented. Finally, detailed regular expressions for analyzed applications are included in the paper, especially P2P applications.
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.