Zerrendatu Heuristic Optimization honen arabera: argitalpen data
48tik 120 emaitza erakusten

On the Gittins index in the M/G/1 queue
(Queueing Systems, 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 policy for multiclass scheduling in a single server queue
(21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future  Final Programme, 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 ... 
Heavytraffic analysis of the M/PH/1 Discriminatory Processor Sharing queue with phasedependent weights
(Performance Evaluation Review, 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 ... 
Convergence of trajectories and optimal buffer sizing for AIMD congestion control
(Performance Evaluation, 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
(Computer Communications, 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 ... 
A modeling framework for optimizing the flowlevel scheduling with timevarying channels
(Performance Evaluation, 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 ... 
Monotonicity properties for multiclass queueing systems
(Discrete Event Dynamic Systems: Theory and Applications, 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 ... 
Asymptotically optimal parallel resource assignment with interference
(Queueing Systems, 20101231)Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous service requirement distributions. The aggregate ... 
Optimal routing in parallel, nonobservable queues and the price of anarchy revisited
(2010 22nd International Teletraffic Congress  Proceedings, ITC 22, 20101231)We consider a network of parallel, nonobservable queues and analyze the "price of anarchy", an index measuring the worstcase performance loss of a decentralized system with respect to its centralized counterpart in ... 
Price of anarchy in noncooperative load balancing games
(Performance Evaluation, 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 ... 
Competition yields efficiency in load balancing games
(Performance Evaluation, 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 ... 
Properties of the gittins index with application to optimal scheduling
(Probability in the Engineering and Informational Sciences, 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 ... 
The price of forgetting in parallel and nonobservable queues
(Performance Evaluation, 20111231)We consider a brokerbased network of nonobservable parallel queues and analyze the minimum expected response time and the optimal routing policy when the broker has the memory of its previous routing decisions. We provide ... 
Heavytraffic analysis of a multiplephase network with discriminatory processor sharing
(Operations Research, 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 ... 
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
(VALUETOOLS 2011  5th International ICST Conference on Performance Evaluation Methodologies and Tools, 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 ... 
Load balancing in processor sharing systems
(Telecommunication Systems, 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, ... 
Energyaware capacity scaling in virtualized environments with performance guarantees
(Performance Evaluation, 20111231)We investigate the tradeoff between performance and power consumption in servers hosting virtual machines running IT services. The performance behavior of such servers is modeled through Generalized Processor Sharing (GPS) ... 
A nearlyoptimal index rule for scheduling of users with abandonment
(Proceedings  IEEE INFOCOM, 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. ... 
Resourcesharing in a single server with timevarying capacity
(2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 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. ... 
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
(Final Program  2012 24th International Teletraffic Congress, ITC 24, 20121231)In this paper we study three opportunistic schedulers for the problem of optimal multiclass flowlevel scheduling in wireless downlink and uplink systems. For user channels we employ the GilbertElliot model of good and ...