Browsing by Author "Ayesta, U."
Now showing items 118 of 18

A modeling framework for optimizing the flowlevel scheduling with timevarying channels
Ayesta, U.; Erausquin, M.; Jacko, P. (20101231)We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finitelength jobs where the available service rate is timevarying. The main motivation comes from wireless data networks ... 
A nearlyoptimal index rule for scheduling of users with abandonment
Ayesta, U.; Jacko, P.; Novak, V. (20111231)We analyze a comprehensive model for multiclass job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or timeaverage sum of linear holding costs and abandonment penalties. ... 
Competition yields efficiency in load balancing games
Anselmi, J.; Ayesta, U.; Wierman, A. (20111231)We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this 'load balancing game', each provider has the freedom to set a price, or toll, for ... 
Congestion control of TCP flows in Internet routers by means of index policy
Avrachenkov, K.; Ayesta, U.; Doncel, J.; Jacko, P. (20131231)In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a source using the Transmission Control ... 
Convergence of trajectories and optimal buffer sizing for AIMD congestion control
Avrachenkov, K.; Ayesta, U.; Piunovskiy, A. (20101231)We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multisocket congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic ... 
Convergence of trajectories and optimal buffer sizing for MIMD congestion control
Zhang, Y.; Piunovskiy, A.; Ayesta, U.; Avrachenkov, K. (20101231)We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid ... 
Heavytraffic analysis of a multiplephase network with discriminatory processor sharing
Verloop, I.M.; Ayesta, U.; NúñezQueija, R. (20111231)We analyze a generalization of the discriminatory processorsharing (DPS) queue in a heavytraffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume ... 
Heavytraffic analysis of the M/PH/1 Discriminatory Processor Sharing queue with phasedependent weights
Verloop, I.M.; Ayesta, U.; NúñezQueija, R. (20091231)We analyze a generalization of the Discriminatory Processor Sharing (DPS) queue in a heavytraffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume ... 
Load balancing in processor sharing systems
Altman, E.; Ayesta, U.; Prabhu, B.J. (20111231)We investigate optimal load balancing strategies for a multiclass multiserver processorsharing system with a Poisson input stream, heterogeneous service rates, and a serverdependent holding cost per unit time. Specifically, ... 
Monotonicity properties for multiclass queueing systems
Verloop, I.M.; Ayesta, U.; Borst, S. (20101231)We study multidimensional stochastic processes that arise in queueing models used in the performance evaluation of wired and wireless networks. The evolution of the stochastic process is determined by the scheduling policy ... 
On the Gittins index in the M/G/1 queue
Aalto, S.; Ayesta, U.; Righter, R. (20091231)For an M/G/1 queue with the objective of minimizing the mean number of jobs in the system, the Gittins index rule is known to be optimal among the set of nonanticipating policies. We develop properties of the Gittins ... 
Optimal congestion control of TCP flows for internet routers
Avrachenkov, K.; Ayesta, U.; Doncel, J.; Jacko, P. (20121231)In this work we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with ... 
Optimal policy for multiclass scheduling in a single server queue
Osipova, N.; Ayesta, U.; Avrachenkov, K. (20091231)In this paper we apply the Gittins optimality result to characterize the optimal scheduling discipline in a multiclass M/G/1 queue. We apply the general result to several cases of practical interest where the service time ... 
Price of anarchy in noncooperative load balancing games
Ayesta, U.; Brun, O.; Prabhu, B.J. (20111231)We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processorsharing at ... 
Properties of the gittins index with application to optimal scheduling
Aalto, S.; Ayesta, U.; Righter, R. (20111231)We consider the optimal scheduling problem for a singleserver queue without arrivals. We allow preemptions, and our purpose is to minimize the expected flow time. The optimal nonanticipating discipline is known to be the ... 
A Resource Sharing Game for the Freshness of Status Updates
Miguelez, F.; Doncel, J.; Ayesta, U. (20210901) 
Resourcesharing in a single server with timevarying capacity
Ayesta, U.; Erausquin, M.; Jacko, P. (20111231)We investigate the problem of sharing the resources of a single server with timevarying capacity with the objective of minimizing the mean delay. We formulate the resource allocation problem as a Markov Decision Process. ... 
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
Ayesta, U.; Erausquin, M.; Jonckheere, M.; Verloop, I.M. (20111231)We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service ...