I am studying about Jackson Open Network that consist of M/M/S/K queues. Based on what i had read, using stopping protocol (that all arrival are blocked and all queues stop doing service except the congested queue, until the congested resolve) product form solution for this network of queue still holds. In my understanding, if the product form solution still hold it implies that the queues in the network behave like independent M/M/S/K queues. If that case happened, does the total average people in the network is just the summation of average people in each queue composer? and how about the total average waiting time in the network, can i using Little's Law for this case?
2026-03-27 07:46:55.1774597615
Jackson Open Queuing Network with Finite Capacity Using Stopping Protocol
179 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in STOCHASTIC-PROCESSES
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
- Probability being in the same state
- Random variables coincide
- Reference request for a lemma on the expected value of Hermitian polynomials of Gaussian random variables.
- Why does there exists a random variable $x^n(t,\omega')$ such that $x_{k_r}^n$ converges to it
- Compute the covariance of $W_t$ and $B_t=\int_0^t\mathrm{sgn}(W)dW$, for a Brownian motion $W$
- Why has $\sup_{s \in (0,t)} B_s$ the same distribution as $\sup_{s \in (0,t)} B_s-B_t$ for a Brownian motion $(B_t)_{t \geq 0}$?
- What is the name of the operation where a sequence of RV's form the parameters for the subsequent one?
- Markov property vs. transition function
- Variance of the integral of a stochastic process multiplied by a weighting function
Related Questions in QUEUEING-THEORY
- How to determine queue distribution?
- Reasonable/unreasonable exponentially distributed interarrival (service) times
- Fixed-sized length/ M/ 1 queuing model
- Time to be serviced in a queue
- Effect on wait time of combining queues
- Discrete time queue markov chain
- M/M/1/K Queue vs M/D/1/K Queue
- How can I find the probability of $n$ customers waiting in a queue?
- Understanding M/M/1 queue simulation
- M/M/1 with balking
Related Questions in NETWORK
- On the Hex/Nash connection game theorem
- minimal number of edges for a graph of size N so that there are two paths between any pair of nodes
- what is mean "Number of connected Triplets of vertices" in global clustering
- What is this "logarithmic golden ratio of scale-free networks" really called?
- Are there textbooks or resources on the mathematics of networks?
- Proving an inequality when a graph is not connected
- Probability of at least two bits
- Probability in terms of slots wasted during network contention
- Network Science: Terminology for graphs with different kinds of edges
- Number of Spanning Trees With A Relation to Contraction of Graph
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Based on my verification in simple case like tandem queues that consist of two M/M/1/K queues. I observed that using stopping protocol the balance equation is satisfied by product form solution. From that we can see the network as independent queue one to another. It is means that average number of costumers in the network is the sum of average number of costumer in each M/M/S/K queues. But, for calculating the average waiting time in network we must consider about effective arrival rate to the network. Considering the stopping protocol will block all arrival. for the arrival that comes from the other queue will be hold in the previous queue while the arrival from outside the network will get rejected. By seeing those facts we can conclude that effective arrival rate to the network is equal to the arrival rate times $(1-(P_{N1}+P_{N2}))$, where $P_{Ni}$ is the probability rejecting costumer arrival from outside network to queue-i. This case later can be expanded to Jackson network.