Juan F Perez

Universidad de los Andes (Colombia), Industrial Engineering, Faculty Member

Followers

Following

Co-authors

Public Views

Kjetil Haugen

Molde University College

Ammar Al-Bazi

Aston University

David Seamon

Kansas State University

Ted Ralphs

Lehigh University

Armando Marques-Guedes

UNL - New University of Lisbon

Sandra (A.C.C.) van Wijk

American University of Sharjah

Marcela González-Araya

Universidad De Talca

José Francisco Pessanha

UERJ - Universidade do Estado do Rio de Janeiro / Rio de Janeiro State University

Dejan Dragan, Prof., PhD.

University of Maribor

Jonathan D Maltz

Stanford University

Interests

Uploads

Papers by Juan F Perez

Aproximaciones de Markov para una red informática en cuadrícula con estructura de anillo

Optical grid networks allow many computing sites to share their resources by connecting them thro... more Optical grid networks allow many computing sites to share their resources by connecting them through high-speed links, providing a more efficient use of the resources and a timely response for incoming jobs. These jobs originate from users connected to each of the sites and, in contrast to traditional queueing networks, a particular job does not have to be processed in a predefined site. Furthermore, a job is always processed locally if there is an available local server. In this paper we propose two different methods to approximate the performance of an optical grid network with a ring topology. The first method is based on approximating the inter-overflow time process, while the second separately characterizes the periods where jobs are overflowed and the periods where they are served locally. Both approaches rely on a marked Markovian representation of the overflow process at each station and on reducing this representation by moment-matching methods. The results show that the me...

La cadena de Markov tipo M / G / 1 con transiciones restringidas y su aplicación a colas con llegadas por lotes

We consider M/G/1-type Markov chains where a transition that decreases the value of the level tri... more We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure—referred to as restricted downward transitions—can be exploited to speed up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block size, the G matrix of which is used to find the original chain's G matrix. This approach is then used to analyze the BMAP/PH/1 queue and the BMAP[2]/PH[2]/1 preemptive priority queue, yielding significant reductions in computation time

Dimensioning an OBS Switch with Partial Wavelength Conversion and Fiber Delay Lines via a Mean Field Model

IEEE INFOCOM 2009 - The 28th Conference on Computer Communications, 2009

Nowadays, technologies are providing the mobile terminals with much more powerful computational a... more Nowadays, technologies are providing the mobile terminals with much more powerful computational abilities. Such improvement made it possible to run many complex applications on mobile devices. However, many of these new applications are also resources demanding. Lacking sufficient resources would cause performance failures and impact negatively on the users' quality of experience. In order to improve this, it is important to provide the users with an easy access to specify their requirements. It is also crucial to monitor the system resources and make corresponding adaptation immediately according to the user's specifications. In this paper, we propose adaptation strategies that flexibly combine the process of monitoring and adaptation, and provide an easy way to specify user's requirements. By tuning the quality of service, we reduce the applications' demand on system resources, thus decreases the chances of performance failures and improving the users' quality of experience.

Juan F Perez

Related Authors

Uploads

Papers by Juan F Perez

Log In