Now showing items 1-17 of 17

    • A modeling framework for optimizing the flow-level scheduling with time-varying channels 

      Ayesta, U.; Erausquin, M.; Jacko, P. (2010-12-31)
      We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks ...
    • A nearly-optimal index rule for scheduling of users with abandonment 

      Ayesta, U.; Jacko, P.; Novak, V. (2011-12-31)
      We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of linear holding costs and abandonment penalties. ...
    • Competition yields efficiency in load balancing games 

      Anselmi, J.; Ayesta, U.; Wierman, A. (2011-12-31)
      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. (2013-12-31)
      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. (2010-12-31)
      We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multi-socket 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. (2010-12-31)
      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 ...
    • Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing 

      Verloop, I.M.; Ayesta, U.; Núñez-Queija, R. (2011-12-31)
      We analyze a generalization of the discriminatory processor-sharing (DPS) queue in a heavy-traffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume ...
    • Heavy-traffic analysis of the M/PH/1 Discriminatory Processor Sharing queue with phase-dependent weights 

      Verloop, I.M.; Ayesta, U.; Núñez-Queija, R. (2009-12-31)
      We analyze a generalization of the Discriminatory Processor Sharing (DPS) queue in a heavy-traffic 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. (2011-12-31)
      We investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit time. Specifically, ...
    • Monotonicity properties for multi-class queueing systems 

      Verloop, I.M.; Ayesta, U.; Borst, S. (2010-12-31)
      We study multi-dimensional 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. (2009-12-31)
      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 non-anticipating policies. We develop properties of the Gittins ...
    • Optimal congestion control of TCP flows for internet routers 

      Avrachenkov, K.; Ayesta, U.; Doncel, J.; Jacko, P. (2012-12-31)
      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 multi-class scheduling in a single server queue 

      Osipova, N.; Ayesta, U.; Avrachenkov, K. (2009-12-31)
      In this paper we apply the Gittins optimality result to characterize the optimal scheduling discipline in a multi-class M/G/1 queue. We apply the general result to several cases of practical interest where the service time ...
    • Price of anarchy in non-cooperative load balancing games 

      Ayesta, U.; Brun, O.; Prabhu, B.J. (2011-12-31)
      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 processor-sharing at ...
    • Properties of the gittins index with application to optimal scheduling 

      Aalto, S.; Ayesta, U.; Righter, R. (2011-12-31)
      We consider the optimal scheduling problem for a single-server 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 ...
    • Resource-sharing in a single server with time-varying capacity 

      Ayesta, U.; Erausquin, M.; Jacko, P. (2011-12-31)
      We investigate the problem of sharing the resources of a single server with time-varying 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. (2011-12-31)
      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 ...