Skip to main content

Questions tagged [queueing-theory]

Queueing theory is the mathematical study of waiting lines, or queues.

-1 votes
0 answers
38 views

I’m studying basic queueing theory, in particular a single–server queue with one arrival stream and one server (a G/G/1 type setup). Let A be the interarrival time with mean 𝔼(A), B be the service ...
AngelP's user avatar
  • 1
1 vote
0 answers
43 views

I want to determine on how many moments of the service distribution does the moments of waiting time distribution depend on in a M/G/1 queue depend. I believe the $n^{th}$ Moment of Waiting Time ...
stochs's user avatar
  • 476
3 votes
1 answer
145 views

Assume that the starting point continuously and stably transmits information to the end point, and the time intervals between any two adjacent messages from the starting point are independent and ...
L'enfer's user avatar
  • 129
1 vote
0 answers
44 views

If I have an M/M/1 queue, then I have rates $$q_{i,i+1} = \lambda, \quad q_{i,i-1} = \mu$$ Since it is guaranteed that I never have the transition $i\to i$, I can comfortably let $q_{i,i} = -\sum_{j\...
idk31909310's user avatar
0 votes
1 answer
50 views

I have an IT scenario at work where we have a single server that is dividing its time against all queries that arrive. Therefore, no queue forms as this single server divides its time against all ...
dsmalenb's user avatar
  • 149
1 vote
0 answers
50 views

Consider an $M/M/k/0$ queueing system (we have $k$ servers and if our system is already full, any clients will immediately leave). The arrival rate is $\lambda$ and the work rate is $\mu$. Now, let's ...
MitchCL's user avatar
  • 41
3 votes
0 answers
109 views

I have an M/M/s queue with arrival rate $\lambda$ and service rate $\mu$, then the expected number of customers in the system with s servers is equal to $E[N_s] = \frac{\rho_s}{1-\rho_s}C(s,\rho) + \...
David's user avatar
  • 51
1 vote
1 answer
116 views

Consider a queue with one server and infinitely many customers already, and a time-varying service rate $\mu(t)$. I want to get a closed expression for the expected time it takes to finish serving $n$ ...
Tom's user avatar
  • 446
1 vote
1 answer
58 views

I have a single server queue with arrival rate $\lambda$. I have calculated that the steady state waiting time of a customer is $W$. Suppose it is given that the per unit time cost of having a ...
stochs's user avatar
  • 476
10 votes
2 answers
213 views

This is another math puzzle I heard today. Consider a M/M/K queue (https://en.wikipedia.org/wiki/M/M/c_queue) in a cafe. Lets say the cafe has a rule that each queue is FIFO (first in first out), each ...
konofoso's user avatar
0 votes
1 answer
92 views

Looking in Wikipedia and other sources, I've found that the stationary distribution of an M/M/$\infty$ queue is given by $$ \pi(x) = \left(\frac{\lambda}{\mu}\right)^x \frac{e^{-\lambda/\mu}}{x!} \...
Dada's user avatar
  • 177
3 votes
1 answer
136 views

If there are $n$ people in a queue, and a new line opens, each person can choose either to stay in the original line or to switch to the new line. Each person should decide at the same time. If a ...
maplemaple's user avatar
  • 1,393
0 votes
1 answer
134 views

Here are some simple twists on a queuing question that I cannot seem to get my head around. a) Suppose that a server $S$ receives packets at rate $\lambda$. Call this arrival process $A$. The time ...
Virdizop's user avatar
0 votes
1 answer
43 views

I am new to Queuing systems. There is an independent assumption made for the interarrival time. Can someone please explain to me why this assumption is true, can you provide me with an example? "...
romesh prasad's user avatar
4 votes
2 answers
165 views

Considering $n$ people line up at $q$ queues. Let's say all people choose which queue to line up randomly, so each people has probability $1/q$ to choose a particular queue. Then the length of any ...
athos's user avatar
  • 5,639

15 30 50 per page
1
2 3 4 5
47