Aracil Rico, Javier

person.page.identifierURI

https://academica-e.unavarra.es/handle/2454/48552

Last Name

Aracil Rico

First Name

Javier

person.page.departamento

Automática y Computación

person.page.observainves

1175081

person.page.upna

1977

Full item page

Search Results

Now showing 1 - 10 of 17

Open Access
A-priori flow bandwidth estimates for dynamic bandwidth allocation in ISP access links
(2001) Aracil Rico, Javier; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
In this paper we study a-priori bandwidth estimation algorithms for TCP flows. An RTT-based bandwidth allocator is proposed, which outperforms a broad class of peak-rate and static allocation flow switching solutions. Our findings suggest that a-priori bandwidth estimation (i.e, before the TCP data transfer phase takes place) is indeed feasible and serves to design simple, yet efficient, dynamic bandwidth allocation rules for ISP access links.
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
Internet traffic shaping for IP over WDM links with source output buffering or multiple parallel wavelengths
(Kluwer Academic Publishers, 2001) Aracil Rico, Javier; Izal Azcárate, Mikel; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
Since the number of wavelengths per fiber is growing in an exponential fashion the over- flow traffic can be routed through overflow lightpaths, thus providing an ideal network with near-infinite capacity and almost no-buffering. Such unprecedented bandwidth growth in the network backbone is only limited by the processing speed of the electronic elements. Even though multiple parallel high-speed channels (lightpaths) are provided between IP routers the switching speed of the latter is an order of magnitude below the lightpath transmission speed. As a result, minimizing transfer delay is not only a matter of forwarding traffic as fast as possible but to shape traffic so that the input queues of the destination routers do not over-flow. Even though it is desirable to exploit the WDM capabilities to forward traffic in parallel channels in order to nearly eliminate the router output buffering, it turns out that the extreme burstiness of Internet traffic is even increased by routing part of the traffic through a backup channel. Instead, the use of source output buffering for traffic shaping purposes proves more beneficial. In this paper, we examine the typical scenario of a static WDM network with several wavelengths between IP routers. In a simple configuration of a primary and over flow lightpath the results show that if 3% of the traffic is routed through the over flow lightpath then the packet forwarding speed in the destination router should be increased in 20% in order to obtain the same transfer delay as with the single lightpath configuration with source output buffering.
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
On capacity planning for the GMPLS network control plane
(Springer US, 2008) Morató Osés, Daniel; Aracil Rico, Javier; Fernández Palacios, Juan P.; González de Dios, Óscar; Lobo Poyo, Jesús F.; Automática y Computación; Automatika eta Konputazioa
This paper presents capacity planning rules for the control plane of all-optical networks featuring GMPLS and RSVP-TE as a connection setup protocol. As per RSVP standard, a refresh message mechanism is incorporated to RSVP such that the state is periodically refreshed on a link per link basis. We provide analytical expressions for the bandwidth and buffer sizes to be provided such that no flows are torn down due to lack of refresh messages. Our findings show that small buffers (several KBytes) suffice to sustain the signaling load for as much as 400 RSVP flows per link, with the simplest RSVP refresh mechanism (neither using link bundling nor acknowledgments). On the other hand, we also find the packet drop probability per link for a given network topology for the case that the flow survival probability is larger than a given threshold. We provide numerical examples based on the COST 239 european network topology and real RSVP traffic traces from early-commercial switching equipment.
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
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
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
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.