On customer flows in Jackson queuing networks

Details On customer flows in Jackson queuing networks On customer flows in Jackson queuing networks

2010-06-29

arxiv.org/abs/1006.5545v1

Mathematics

Probability

13 pages

Scientific paper

Melamed's theorem states that for a Jackson queuing network, the equilibrium flow along a link follows Poisson distribution if and only if no customers can travel along the link more than once. Barbour \& Brown~(1996) considered the Poisson approximate version of Melamed's theorem by allowing the customers a small probability $p$ of travelling along the link more than once. In this paper, we prove that the customer flow process is a Poisson cluster process and then establish a general approximate version of Melamed's theorem accommodating all possible cases of $0\le p<1$.

Affiliated with

Also associated with

No associations

Rating

On customer flows in Jackson queuing networks 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 On customer flows in Jackson queuing networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On customer flows in Jackson queuing networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314358