A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages

Scientific paper

In this paper, we provide a matrix-analytic solution for randomized load balancing models (also known as \emph{supermarket models}) with phase-type (PH) service times. Generalizing the service times to the phase-type distribution makes the analysis of the supermarket models more difficult and challenging than that of the exponential service time case which has been extensively discussed in the literature. We first describe the supermarket model as a system of differential vector equations, and provide a doubly exponential solution to the fixed point of the system of differential vector equations. Then we analyze the exponential convergence of the current location of the supermarket model to its fixed point. Finally, we present numerical examples to illustrate our approach and show its effectiveness in analyzing the randomized load balancing schemes with non-exponential service requirements.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-643899

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.