Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward

A Gandhi, S Doroudi, M Harchol-Balter… - Proceedings of the …, 2013 - dl.acm.org
The M/M/k/setup model, where there is a penalty for turning servers on, is common in data
centers, call centers and manufacturing systems. Setup costs take the form of a time delay …

Exact solutions for M/M/c/setup queues

T Phung-Duc - Telecommunication Systems, 2017 - Springer
Recently multiserver queues with setup times have been extensively studied because they
have applications in power-saving data centers. A challenging model is the M/M/c/Setup …

Modeling load and overwork effects in queueing systems with adaptive service rates

M Delasay, A Ingolfsson, B Kolfal - Operations Research, 2016 - pubsonline.informs.org
Servers in many real queueing systems do not work at a constant speed. They adapt to the
system state by speeding up when the system is highly loaded or slowing down when load …

Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward

A Gandhi, S Doroudi, M Harchol-Balter… - Queueing Systems, 2014 - Springer
The M/M/k/setup model, where there is a penalty for turning servers on, is common in data
centers, call centers, and manufacturing systems. Setup costs take the form of a time delay …

[책][B] Dynamic server provisioning for data center power management

A Gandhi - 2013 - search.proquest.com
Data centers play an important role in today's IT infrastructure. However, their enormous
power consumption makes them very expensive to operate. Sadly, much of the power used …

Fitting correlated arrival and service times and related queueing performance

P Buchholz, J Kriege - Queueing Systems, 2017 - Springer
In this paper, we consider a queue where the inter-arrival times are correlated and,
additionally, service times are also correlated with inter-arrival times. We show that the …

Explicit solutions for continuous-time QBD processes by using relations between matrix geometric analysis and the probability generating functions method

G Hanukov, U Yechiali - Probability in the Engineering and …, 2021 - cambridge.org
Two main methods are used to solve continuous-time quasi birth-and-death processes:
matrix geometric (MG) and probability generating functions (PGFs). MG requires a numerical …

Clearing analysis on phases: Exact limiting probabilities for skip-free, unidirectional, quasi-birth-death processes

S Doroudi, B Fralix, M Harchol-Balter - Stochastic Systems, 2017 - pubsonline.informs.org
A variety of problems in computing, service, and manufacturing systems can be modeled via
infinite repeating Markov chains with an infinite number of levels and a finite number of …

A polling system with 'Join the shortest-serve the longest'policy

E Perel, N Perel, U Yechiali - Computers & Operations Research, 2020 - Elsevier
This paper studies a Markovian single-server non-symmetric two-queue polling system,
operating simultaneously under a combination of two well-known queueing regimes:(i)'Join …

Modeling and analysis of performance under interference in the cloud

S Votke, SA Javadi, A Gandhi - 2017 IEEE 25th International …, 2017 - ieeexplore.ieee.org
One of the key performance challenges in cloud computing is the problem of interference, or
resource contention, among colocated VMs. While prior work has empirically analyzed …