Skip to main content

Questions tagged [queueing-theory]

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

Filter by
Sorted by
Tagged with
1 vote
0 answers
42 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
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
3 votes
0 answers
108 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
57 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
0 votes
1 answer
89 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
0 votes
1 answer
133 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
4 votes
2 answers
164 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
1 vote
0 answers
49 views

I'm working on a queueing network model that incorporates blocking and features two states. After defining the global balance equations, I solved them for my parameters arrival rates (λ), service ...
RookieScientist's user avatar
0 votes
0 answers
87 views

hey everyone, given a system with poissonian process split with probabilities p and q to queues with exponential serving times, notice you can move from being assigned to queue 1 to instead being ...
kal_elk122's user avatar
1 vote
0 answers
20 views

For a M/M/1 queue let $N_q(t) = (Q(t)-1)^{+}$ be the number of customers in the queue except the one being served. We have to show that $N_q(t)$ is not a continuous-time Markov chain. [src: Sidney ...
28ADY0901's user avatar
  • 718
1 vote
0 answers
50 views

Consider a closed queueing network where there are two queueing nodes, each with one server, FCFS queueing disciplines, and independent exponential service times. The server at node $i$ has mean ...
abc's user avatar
  • 429
0 votes
0 answers
69 views

Burke's theorem says that the output process of an $M/M/1$ queue with arrival rate $\lambda$ and service rate $\mu$ follows a Poisson with parameter $\lambda$. Suppose after service completion the ...
stochs's user avatar
  • 476
4 votes
1 answer
196 views

I am trying to apply queuing theory / birth and death process to the following. Suppose customers arrive in a restaurant according to a Poisson process with rate $\lambda = 1$. Suppose there are $2$ ...
MilesToGo's user avatar
  • 137
1 vote
0 answers
49 views

Consider a queue $M/G/\infty$, starting with arrival time of calls as a PPP$(\Lambda)$ and lengths of calls as $iid$ random variables with common distribution $G$. The times when the calls terminate ...
zaira's user avatar
  • 2,396
2 votes
0 answers
113 views

I am trying to understand how to approach a problem involving a Poisson Process queue with a deterministic service time. We have that the mean rate of arrival time is your standard $\lambda$ customers ...
IPreferAlgebra's user avatar
1 vote
1 answer
82 views

A server system with a finite queue is the following Markovian system: the state is defined as the length of the queue. At each time unit with probability $p$ regardless of the system’s state and ...
kal_elk122's user avatar
1 vote
1 answer
75 views

I have a counting process $Y(t)=\sum_{i=1}^{N(t)}X_i$, where $X_1,X_2,\ldots$ are iid, and $N(t)$ is a non-negative integer random variable independent of $X_i$. I want to calculate the Laplace-...
statian's user avatar
  • 465
2 votes
0 answers
120 views

I am trying to model a queuing system, where the arrival process is deterministic and the service process is exponential, thus resulting in a D/M/1 queue. In that case the main factor for the rate at ...
Genwolf's user avatar
  • 21
2 votes
1 answer
206 views

I have created a simulation for an M/M/1 queuing system in Python using Simpy. Simulations The code of the simulation is just one class triggering two processes (in the Simpy sense of process): One ...
Andry's user avatar
  • 1,063
2 votes
1 answer
485 views

The text I am reading says that the infinitesimal generator of the waiting time process in a M/G/1 is given by $$Gf(x)=\lambda \int_0^\infty [f(y+s)-f(y)]dF(s)-f'(y)1(y>0)$$ where $F$ is the ...
abc's user avatar
  • 429
0 votes
1 answer
363 views

Does the expected value of the residual time (the amount of time one has to wait) equal the expected value of the spent time (the amount of time since the last arrival)? I know that the expected value ...
APerson's user avatar
  • 107
0 votes
0 answers
49 views

I have been trying to prove the stability of a queuing system (stochastic), and the state-space I have obtained is uncountable. I am aware of the Foster-Laypunov criterion, but as far as I know, it ...
Siddharth Ambekar's user avatar
1 vote
0 answers
144 views

What we deal with when talking about performance measures of this systems is mostly average values. But how can I get the distributions of this values, i.e. the distribution of the number of customers ...
Alex_DeLarge's user avatar
0 votes
0 answers
117 views

I have an M/M/1 queueing system in which customers arrives at rate $\lambda$ and are served at rate $\mu$, but, upon entry, each customer can be randomly dropped with probability $1-p$ or enter the ...
Alex_DeLarge's user avatar

1
2 3 4 5
14