IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v85y2017i1d10.1007_s11134-016-9488-8.html
   My bibliography  Save this article

Choosing among heterogeneous server clouds

Author

Listed:
  • A. Karthik

    (University of Waterloo)

  • Arpan Mukhopadhyay

    (University of Waterloo)

  • Ravi R. Mazumdar

    (University of Waterloo)

Abstract

This paper considers a model of interest in cloud computing applications. We consider a multiserver system consisting of N heterogeneous servers. The servers are categorized into M( $$\ll N$$ ≪ N ) different types according to their service capabilities. Jobs having specific resource requirements arrive at the system according to a Poisson process with rate $$N \lambda $$ N λ . Upon each arrival, a small number of servers are sampled uniformly at random from each server type. The job is then routed to the sampled server with maximum vacancy per server capacity. If a job cannot obtain the required amount of resources from the server to which it is assigned, then the job is discarded. We analyze the system in the limit as $$N \rightarrow \infty $$ N → ∞ . This gives rise to a mean field, which we show has a unique fixed point and is globally attractive. Furthermore, as $$N\rightarrow \infty $$ N → ∞ , the servers behave independently. The stationary tail probabilities of server occupancies are obtained from the stationary solution of the mean field. Numerical results suggest that the proposed scheme significantly reduces the average blocking probability compared to static schemes that probabilistically route jobs to servers in proportion to the number of servers of each type. Moreover, the reduction in blocking holds even for systems at high load. For the limiting system in statistical equilibrium, our simulation results indicate that the occupancy distribution is insensitive to the holding time distribution and only depends on its mean.

Suggested Citation

  • A. Karthik & Arpan Mukhopadhyay & Ravi R. Mazumdar, 2017. "Choosing among heterogeneous server clouds," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 1-29, February.
  • Handle: RePEc:spr:queues:v:85:y:2017:i:1:d:10.1007_s11134-016-9488-8
    DOI: 10.1007/s11134-016-9488-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-016-9488-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-016-9488-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Graham, Carl & Méléard, Sylvie, 1993. "Propagation of chaos for a fully connected loss network with alternate routing," Stochastic Processes and their Applications, Elsevier, vol. 44(1), pages 159-180, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Barbour, A.D. & Brightwell, Graham & Luczak, Malwina, 2022. "Long-term concentration of measure and cut-off," Stochastic Processes and their Applications, Elsevier, vol. 152(C), pages 378-423.
    2. Weina Wang & Mor Harchol-Balter & Haotian Jiang & Alan Scheller-Wolf & R. Srikant, 2019. "Delay asymptotics and bounds for multitask parallel jobs," Queueing Systems: Theory and Applications, Springer, vol. 91(3), pages 207-239, April.
    3. Tanabe, Yasuo, 2006. "The propagation of chaos for interacting individuals in a large population," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 125-152, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:85:y:2017:i:1:d:10.1007_s11134-016-9488-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.