%0 Journal Article %1 gandhi14 %A Gandhi, Anshul %A Doroudi, Sherwin %A Harchol-Balter, Mor %A Scheller-Wolf, Alan %D 2014 %I Springer US %J Queueing Systems %K markov queueing.theory %N 2 %P 177-209 %R 10.1007/s11134-014-9409-7 %T Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward %V 77 %X 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, and sometimes there is additionally a power penalty, as in the case of data centers. While the M/M/1/setup was exactly analyzed in 1964, no exact analysis exists to date for the M/M/k/setup with

@article{gandhi14, abstract = {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, and sometimes there is additionally a power penalty, as in the case of data centers. While the M/M/1/setup was exactly analyzed in 1964, no exact analysis exists to date for the M/M/k/setup with }, added-at = {2014-07-14T02:20:30.000+0200}, author = {Gandhi, Anshul and Doroudi, Sherwin and Harchol-Balter, Mor and Scheller-Wolf, Alan}, biburl = {https://www.bibsonomy.org/bibtex/2199cbab45583b43fc479765798d44cd5/ytyoun}, doi = {10.1007/s11134-014-9409-7}, interhash = {e26d7e9c52b5556137fbbc8bacc8a5ab}, intrahash = {199cbab45583b43fc479765798d44cd5}, issn = {0257-0130}, journal = {Queueing Systems}, keywords = {markov queueing.theory}, language = {English}, number = 2, pages = {177-209}, publisher = {Springer US}, timestamp = {2014-07-14T02:20:30.000+0200}, title = {Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward}, volume = 77, year = 2014 }