The Library
Choosing among heterogeneous server clouds
Tools
Tools
Tools
Karthik, A., Mukhopadhyay, Arpan and Mazumdar, Ravi R. (2017) Choosing among heterogeneous server clouds. Queueing Systems, 85 (1-2). pp. 1-29. doi:10.1007/s11134-016-9488-8 ISSN 0257-0130.
|
PDF
WRAP-choosing-heterogeneous-server-clouds-Mukhophyay-2016.pdf - Accepted Version - Requires a PDF viewer. Download (590Kb) | Preview |
Official URL: https://doi.org/10.1007/s11134-016-9488-8
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( ≪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λ . 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→∞ . This gives rise to a mean field, which we show has a unique fixed point and is globally attractive. Furthermore, as 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.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||||||
| Journal or Publication Title: | Queueing Systems | ||||||||
| Publisher: | Spring New York LLC | ||||||||
| ISSN: | 0257-0130 | ||||||||
| Official Date: | February 2017 | ||||||||
| Dates: |
|
||||||||
| Volume: | 85 | ||||||||
| Number: | 1-2 | ||||||||
| Page Range: | pp. 1-29 | ||||||||
| DOI: | 10.1007/s11134-016-9488-8 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Reuse Statement (publisher, data, author rights): | This is a post-peer-review, pre-copyedit version of an article published in Queueing Systems. The final authenticated version is available online at: https://doi.org/10.1007/s11134-016-9488-8 | ||||||||
| Access rights to Published version: | Restricted or Subscription Access | ||||||||
| Date of first compliant deposit: | 12 April 2019 | ||||||||
| Date of first compliant Open Access: | 15 August 2019 |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
