Javier Aracil

Javier Aracil

Auto-generated profile, based on publicly available information

Javier Aracil

Universidad Autónoma de Madrid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2017 in Computer Networks
Verified
Journal Article
Open access
CVCarlos Vega
Carlos Vega
PRPaula Roquero
Paula Roquero
JAJavier Aracil
Javier Aracil
In this paper we propose and implement novel techniques for performance evaluation of web traffic (response time, response code, etc.), with no reassembly of the underlying TCP connection, which severely restricts the traffic analysis throughput. Furthermore, our proposed software for HTTP traffic analysis runs in standard hardware, which is very cost-effective. Besides, we present sub TCP connection load balancing techniques that significantly increase throughput at the expense of losing very few HTTP transactions. Such techniques provide performance evaluation statistics which are indistinguishable from the single threaded alternative with full TCP connection reassembly. (C) 2017 Elsevier B.V. All rights reserved.

1 July 2007
Verified
Conference Paper
Closed access
CACarlos Garcia Argos
Carlos Garcia Argos
ODOscar Gonzalez de Dios
Oscar Gonzalez de Dios
JAJavier Aracil
Javier Aracil
In this paper we present a novel adaptive routing strategy for OBS networks aimed at balancing global network load, in order to reduce overall burst loss probability. This strategy dynamically balances load in the output links of core nodes according to local congestion information. The results provided show a significant reduction in the load imbalancement of the links in the network, as well as a lower burst loss probability.

6 March 2017 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
CVCarlos Vega
Carlos Vega
PRPaula Roquero
Paula Roquero
RLRafael Leira
Rafael Leira
IGIvan Gonzalez
Ivan Gonzalez
JAJavier Aracil
Javier Aracil
Nowadays, most systems and applications produce log records that are useful for security and monitoring purposes such as debugging programming errors, checking system status, and detecting configuration problems or even attacks. To this end, a log repository becomes necessary whereby logs can be accessed and visualized in a timely manner. This paper presents Loginson, a high-performance log centralization system for large-scale log collection and processing in large IT infrastructures. Besides log collection, Loginson provides high-level analytics through a visual interface for the purpose of troubleshooting critical incidents. We note that Loginson outperforms all of the other log centralization solutions by taking full advantage of the vertical scalability, and therefore decreasing Capital Expenditure (CAPEX) and Operating Expense (OPEX) costs for deployment scenarios with a huge volume of log data.

5 January 2021 in IEEE Access
Verified
Journal Article
Open access
PRPaula Roquero
Paula Roquero
JAJavier Aracil
Javier Aracil
As networks grow larger in size and complexity, their monitoring is becoming an increasing challenge because of the required polling performance and also due to heterogeneity of devices. As it turns out, SNMP (Simple Network Management Protocol) is by far the most popular monitoring protocol. However, due to the increase in the number of network devices, it becomes necessary to employ multiple SNMP managers, which is not cost-effective due to the hardware requirements. Additionally, the different proprietary SNMP implementations require custom configuration very often, as new devices are being incorporated into the network. Therefore, current SNMP managers not only require capabilities for large-scale monitoring but also a high degree of flexibility and programmability. In response, we propose an SNMP manager architecture with a flexible multi-threaded architecture, which effectively reduces the hardware resources necessary to poll the increasing number of SNMP agents. In addition, it features a scripting component to deal with the different data representations caused by proprietary implementations. Our experience has shown that SNMP agents can have high variability in their response times. Actually, our findings show a strong correlation between high response times and CPU load. As a solution, we propose and analyze novel adaptive polling algorithms that decrease the load on agents' CPUs while keeping the desired polling rate for fast agents. Finally, we present several real-world use cases where we show the benefits of the polling algorithms and the scripting component, by means of extensive measurement campaigns.

30 June 2009 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
JHJosé Alberto Hernandez
José Alberto Hernandez
Pedro ReviriegoPedro Reviriego
Pedro Reviriego
José Luis Garcia-DoradoJosé Luis Garcia-Dorado
José Luis Garcia-Dorado
VLVíctor Lopez
Víctor Lopez
DLDavid Larrabeiti
David Larrabeiti
JAJavier Aracil
Javier Aracil
In polymorphous optical burst-switched (POBS) networks, the burst control packets (BCPs) of conventional just-enough-time based signalling OBS networks are given extended properties which enable them not only to reserve fixed time-slots for asynchronous data bursts, but also to allocate TDM reservations for periodic streams of data, and even a complete wavelength for high-bandwidth demanding services. This allows POBS to provide a flexible, yet transparent, approach for supporting the idiosyncrasies of today's most popular services over the same underlying network architecture. In POBS, the spare gaps in between synchronous TDM reservations can be used for the allocation of best-effort data bursts, leading to a more efficient utilisation of the optical capacity. This work shows how to extend the well-known Erlang fixed point procedure to evaluate the performance behavior of POBS networks, whereby asynchronous data bursts coexist with high-priority periodic TDM reservations. The performance evaluation algorithm is applied to a number of case scenarios, showing the benefits arisen due to the flexibility of POBS networks.

8 March 2025 in Expert Systems with Applications
Verified
Journal Article
Open access
ALAlejandro León
Alejandro León
DPDaniel Perdices
Daniel Perdices
José Luis Garcia-DoradoJosé Luis Garcia-Dorado
José Luis Garcia-Dorado
JRJavier Ramos
Javier Ramos
JAJavier Aracil
Javier Aracil