Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Mean field and propagation of chaos in multi-class heterogeneous loss models

Tools
- Tools
+ Tools

Mukhopadhyay, Arpan, Karthik, A., Mazumdar, Ravi R. and Guillemin, Fabrice (2015) Mean field and propagation of chaos in multi-class heterogeneous loss models. Performance Evaluation, 91 . pp. 117-131. doi:10.1016/j.peva.2015.06.008 ISSN 0166-5316.

[img]
Preview
PDF
WRAP-mean-field-propagation-chaos-multi-class-heterogeneous-loss-models-Mukhopadhyay-2015.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (668Kb) | Preview
Official URL: https://doi.org/10.1016/j.peva.2015.06.008

Request Changes to record.

Abstract

We consider a system consisting of parallel servers, where jobs with different resource requirements arrive and are assigned to the servers for processing. Each server has a finite resource capacity and therefore can serve only a finite number of jobs at a time. We assume that different servers have different resource capacities. A job is accepted for processing only if the resource requested by the job is available at the server to which it is assigned. Otherwise, the job is discarded or blocked. We consider randomized schemes to assign jobs to servers with the aim of reducing the average blocking probability of jobs in the system. In particular, we consider a scheme that assigns an incoming job to the server having maximum available vacancy or unused resource among randomly sampled servers. We consider the system in the limit where both the number of servers and the arrival rates of jobs are scaled by a large factor. This gives rise to a mean field analysis. We show that in the limiting system the servers behave independently—a property termed as propagation of chaos. Stationary tail probabilities of server occupancies are obtained from the stationary solution of the mean field which is shown to be unique and globally attractive. We further characterize the rate of decay of the stationary tail probabilities. Numerical results suggest that the proposed scheme significantly reduces the average blocking probability of jobs as compared to static schemes that probabilistically route jobs to servers independently of their states.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: Performance Evaluation
Publisher: Elsevier Science BV
ISSN: 0166-5316
Official Date: September 2015
Dates:
DateEvent
September 2015Published
4 July 2015Available
10 June 2015Accepted
Volume: 91
Page Range: pp. 117-131
DOI: 10.1016/j.peva.2015.06.008
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 6 August 2019
Date of first compliant Open Access: 6 August 2019
Title of Event: IFIP Performance 2015
Type of Event: Conference
Related URLs:
  • Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us