M/M/S Queue, probability interpretation
up vote
0
down vote
favorite
In an M/M/s queue, what does this expression mean? :
$sum_{n=0}^{s-1}{(s-n)P_n}$
Furthermore, is it possible that the following equation holds? :
$sum_{n=0}^{s-1}{(s-n)P_n} = (1-rho)s$
If so, how could I demonstrate it?
EDIT: An M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers.
Thanks,
Louis
probability queueing-theory
asked Nov 28 at 19:25
Louis-Philippe Noël
123
add a comment |
up vote
0
down vote
favorite
In an M/M/s queue, what does this expression mean? :
$sum_{n=0}^{s-1}{(s-n)P_n}$
Furthermore, is it possible that the following equation holds? :
$sum_{n=0}^{s-1}{(s-n)P_n} = (1-rho)s$
If so, how could I demonstrate it?
EDIT: An M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers.
Thanks,
Louis
probability queueing-theory
asked Nov 28 at 19:25
Louis-Philippe Noël
123
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
In an M/M/s queue, what does this expression mean? :
$sum_{n=0}^{s-1}{(s-n)P_n}$
Furthermore, is it possible that the following equation holds? :
$sum_{n=0}^{s-1}{(s-n)P_n} = (1-rho)s$
If so, how could I demonstrate it?
EDIT: An M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers.
Thanks,
Louis
probability queueing-theory
asked Nov 28 at 19:25
Louis-Philippe Noël
123
In an M/M/s queue, what does this expression mean? :
$sum_{n=0}^{s-1}{(s-n)P_n}$
Furthermore, is it possible that the following equation holds? :
$sum_{n=0}^{s-1}{(s-n)P_n} = (1-rho)s$
If so, how could I demonstrate it?
EDIT: An M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers.
Thanks,
Louis
probability queueing-theory
probability queueing-theory
asked Nov 28 at 19:25
Louis-Philippe Noël
123
asked Nov 28 at 19:25
Louis-Philippe Noël
123
edited Nov 29 at 22:55
asked Nov 28 at 19:25
Louis-Philippe Noël
123
asked Nov 28 at 19:25
Louis-Philippe Noël
123
asked Nov 28 at 19:25
Louis-Philippe Noël
123
123
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23
add a comment |
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
If $p_n$ is the stationary distribution then the first expression is the expected number of free servers.
The equation is indeed correct and this can be argued using Little’s law: the arrival rate to each server is $frac{lambda}{s}$ and the expected time in service is $frac{1}{mu}$, so the probability each server is free is $1-frac{lambda}{smu}$. The servers are identical so the the sum is just $s$ times the probability of a free server.
answered Dec 2 at 21:15
QQQ
59645
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
If $p_n$ is the stationary distribution then the first expression is the expected number of free servers.
The equation is indeed correct and this can be argued using Little’s law: the arrival rate to each server is $frac{lambda}{s}$ and the expected time in service is $frac{1}{mu}$, so the probability each server is free is $1-frac{lambda}{smu}$. The servers are identical so the the sum is just $s$ times the probability of a free server.
answered Dec 2 at 21:15
QQQ
59645
add a comment |
up vote
0
down vote
accepted
If $p_n$ is the stationary distribution then the first expression is the expected number of free servers.
The equation is indeed correct and this can be argued using Little’s law: the arrival rate to each server is $frac{lambda}{s}$ and the expected time in service is $frac{1}{mu}$, so the probability each server is free is $1-frac{lambda}{smu}$. The servers are identical so the the sum is just $s$ times the probability of a free server.
answered Dec 2 at 21:15
QQQ
59645
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
If $p_n$ is the stationary distribution then the first expression is the expected number of free servers.
The equation is indeed correct and this can be argued using Little’s law: the arrival rate to each server is $frac{lambda}{s}$ and the expected time in service is $frac{1}{mu}$, so the probability each server is free is $1-frac{lambda}{smu}$. The servers are identical so the the sum is just $s$ times the probability of a free server.
answered Dec 2 at 21:15
QQQ
59645
If $p_n$ is the stationary distribution then the first expression is the expected number of free servers.
The equation is indeed correct and this can be argued using Little’s law: the arrival rate to each server is $frac{lambda}{s}$ and the expected time in service is $frac{1}{mu}$, so the probability each server is free is $1-frac{lambda}{smu}$. The servers are identical so the the sum is just $s$ times the probability of a free server.
answered Dec 2 at 21:15
QQQ
59645
answered Dec 2 at 21:15
QQQ
59645
answered Dec 2 at 21:15
QQQ
59645
answered Dec 2 at 21:15
QQQ
59645
59645
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3017576%2fm-m-s-queue-probability-interpretation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
What is an M/M/S queue? What are the variables that you're using?
– Tki Deneb
Nov 29 at 17:56
@TkiDeneb an M/M/S queue is a queue with Markovian (Poisson law) process for arrivals, Markovian (Exponential law) process for departures and $s$ servers. Thanks for your time!
– Louis-Philippe Noël
Nov 29 at 21:08
I'm afraid I can't help you then, I'm not familiar with this subject.
– Tki Deneb
Nov 29 at 22:23