Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Oscar Martinez Bonastre has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Teaching Programmers A Survival Mindset

    by Oscar Bonastre

    Oscar M. Bonastre looks at trends shaping the teaching of programming.

  • Open Access

    A dynamic game analysis of video platform revenue allocation

    by Francisco López-Navarrete, Joaquín Sánchez-Soriano, Oscar M. Bonastre

    The consumption of online videos is a rapidly expanding market that generates substantial revenue annually. A key challenge within this ecosystem is the equitable distribution of income between platform operators and content creators. This paper addresses this crucial problem by introducing a dynamic model of revenue generation that incorporates two primary income streams: pay-per-view systems and advertising insertion. To determine a fair and reasonable division of earnings, we model the interaction as dynamic cooperative games that reflect each party's contribution to value creation. We derive the structure of the Shapley value for these games and propose several related allocation rules. Furthermore, we provide an algorithmic framework for calculating these values and prove that the computational complexity is polynomial. We conclude with illustrative examples and simulations demonstrating the performance of the proposed allocation rules.

  • Open Access

    Generalized TCP-Red Dynamical Model for Internet Congestion Control

    by José María Amigó, Guillem Duran, Ángel Giménez, Óscar Martínez-Bonastre, José Valero

    Adaptive management of traffic congestion in the Internet is a complex problem that can gain useful insights from a dynamical approach. In this paper we propose and analyze a one-dimensional, discrete-time nonlinear model for Internet congestion control at the routers. Specifically, the states correspond to the average queue sizes of the incoming data packets and the dynamical core consists of a monotone or unimodal mapping with a unique fixed point. This model generalizes a previous one in that additional control parameters are introduced via the data packet drop probability with the objective of enhancing stability. To make the analysis more challenging, the original model was shown to exhibit the usual features of low-dimensional chaos with respect to several system and control parameters, e.g., positive Lyapunov exponents and Feigenbaum-like bifurcation diagrams. We concentrate first on the theoretical aspects that may promote the unique stationary state of the system to a global attractor, which in our case amounts to global stability. In a second step, those theoretical results are translated into stability domains for robust setting of the new control parameters in practical applications. Numerical simulations confirm that the new parameters make it possible to extend the stability domains, in comparison with previous results. Therefore, the present work may lead to an adaptive congestion control algorithm with a more stable performance than other algorithms currently in use.

  • Open Access

    Poster: Modified Dynamic Beta RED -- A New AQM Algorithm for Internet Congestion Control

    by Ángel Giménez, Óscar M. Bonastre, José Valero, José M. Amigó

    In this work we present a performance study of modified Dynamic Beta RED (mDBetaRED), a new Active Queue Management (AQM) RED-type algorithm based on dynamical variants with the ability to adapt to the characteristics of mixed networks. As well, we rely on real campus traffic traces to build a traffic model on which we evaluate our proposal under the NS3 simulator. The parameters of our AQM algorithm are dynamically adjusted so that the queue length remains stable around a predetermined reference value and according to changing network traffic conditions. We present a performance comparison of mDBetaRED with other AQM algorithms and diverse flows of Internet. Of all the AQM algorithms compared, the mDBetaRED algorithm offers the best throughput while effectively controlling delay and stability.


  • Open Access

    Dynamic generation and attribution of revenues in a video platform

    by Francisco Lopez-Navarrete, Joaquin Sanchez-Soriano, Oscar M. Bonastre

    The consumption of online videos on the Internet grows every year, making it a market that increasingly generates a greater volume of income. This paper deals with a problem of great interest in this context: the allocation of the generated revenues in a video website between the website and the video creators. For this, we consider a dynamic model of the revenues generation. We will consider that revenue can come from two sources: through the pay-per-view system and through the insertion of advertisements in the videos. Then to study how to divide the revenues in a reasonable and fair way between the two parties, we consider a dynamic cooperative game that reflects the importance of each part in generating revenue. From this game, we determine how its Shapley value is and introduce other allocation rules derived from it. We provide a structure of algorithm to calculate the Shapley value and its derived rules. We show that the computational complexity of the algorithms is polynomial. Finally, we provide some illustrative examples and simulations to illustrate how the proposed allocation rules perform.

  • Open Access

    New RED-Type TCP-AQM Algorithms Based on Beta Distribution Drop Functions

    by Angel Giménez, Miguel A. Murcia, José M. Amigó, Oscar Martínez-Bonastre, José Valero

    In recent years, Active Queue Management (AQM) mechanisms to improve the performance of TCP/IP networks have acquired a relevant role. In this paper, we present a simple and robust RED-type algorithm together with a couple of dynamical variants with the ability to adapt to the specific characteristics of different network environments, as well as to the user’s needs. We first present a basic version called Beta RED (BetaRED), where the parameters can be tuned according to the specific network conditions. The aim is to introduce control parameters that are easy to interpret and provide a good performance over a wide range of values. Secondly, BetaRED is used as a framework to design two dynamic algorithms, which we will call Adaptive Beta RED (ABetaRED) and Dynamic Beta RED (DBetaRED). In those new algorithms, certain parameters are dynamically adjusted so that the queue length remains stable around a predetermined reference value and according to changing network traffic conditions. Finally, we present a battery of simulations using the Network Simulator 3 (ns-3) software with a two-fold objective: to guide the user on how to adjust the parameters of the BetaRED mechanism, and to show a performance comparison of ABetaRED and DBetaRED with other representative algorithms that pursue a similar objective.


  • Open Access

    New RED-type TCP-AQM algorithms based on beta distribution drop functions

    by Angel Giménez, Miguel A. Murcia, José M. Amigó, Oscar Martínez-Bonastre, José Valero

    In recent years, Active Queue Management (AQM) mechanisms to improve the performance of TCP/IP networks have acquired a relevant role. In this paper we present a simple and robust RED-type algorithm together with a couple of dynamical variants with the ability to adapt to the specific characteristics of different network environments, as well as to the user needs. We first present a basic version called Beta RED (BetaRED), where the user is free to adjust the parameters according to the network conditions. The aim is to make the parameter setting easy and intuitive so that a good performance is obtained over a wide range of parameters. Secondly, BetaRED is used as a framework to design two dynamic algorithms, which we will call Adaptive Beta RED (ABetaRED) and Dynamic Beta RED (DBetaRED). In those new algorithms certain parameters are dynamically adjusted so that the queue length remains stable around a predetermined reference value and according to changing network traffic conditions. Finally, we present a battery of simulations using the Network Simulator 3 (ns-3) software with a two-fold objective: to guide the user on how to adjust the parameters of the BetaRED mechanism, and to show a performance comparison of ABetaRED and DBetaRED with other representative algorithms that pursue a similar objective.


  • Open Access

    Modeling a New AQM Model for Internet Chaotic Behavior Using Petri Nets

    by José M. Amigó, Guillem Duran, Ángel Giménez, José Valero, Oscar Martinez Bonastre

    Formal modeling is considered one of the fundamental phases in the design of network algorithms, including Active Queue Management (AQM) schemes. This article focuses on modeling with Petri nets (PNs) a new scheme of AQM. This innovative AQM is based on a discrete dynamical model of random early detection (RED) for controlling bifurcations and chaos in Internet congestion control. It incorporates new parameters (α,β) that make possible better stability control over oscillations of an average queue length (AQL) at the router. The PN is validated through the matrix equation approach, reachability tree, and invariant analysis. The correctness is validated through the key properties of reachability, boundedness, reversibility, deadlock, and liveness.


  • Generalized TCP-RED dynamical model for Internet congestion control

    by José M. Amigó, Guillem Duran, Angel Giménez, Oscar Martínez-Bonastre, José Valero


  • Open Access

    Internet congestion control: from stochastic to dynamical models

    by José M. Amigó, Angel Giménez, Oscar Martínez-Bonastre, José Valero

    Since its inception, control of data congestion on the Internet has been based on stochastic models. One of the first such models was Random Early Detection. Later, this model was reformulated as a dynamical system, with the average queue sizes at a router's buffer being the states. Recently, the dynamical model has been generalized to improve global stability. In this paper we review the original stochastic model and both nonlinear models of Random Early Detection with a two-fold objective: (i) illustrate how a random model can be "smoothed out" to a deterministic one through data aggregation, and (ii) how this translation can shed light into complex processes such as the Internet data traffic. Furthermore, this paper contains new materials concerning the occurrence of chaos, bifurcation diagrams, Lyapunov exponents and global stability robustness with respect to control parameters. The results reviewed and reported here are expected to help design an active queue management algorithm in real conditions, that is, when system parameters such as the number of users and the round-trip time of the data packets change over time. The topic also illustrates the much-needed synergy of a theoretical approach, practical intuition and numerical simulations in engineering.