Two Unordered Queues

Details Two Unordered Queues Two Unordered Queues

2011-08-04

arxiv.org/abs/1108.1179v1

Mathematics

Probability

Presented at AMMCS 2011 Conference, July 25, 2011

Scientific paper

A special customer must complete service from two servers in series, in either order, each with an M/M/1 queueing system. It is assumed that the two queueing system lengths are independent with initial numbers of customers a and b at the instant when the special customer arrives. We find the expected total time (ETT) for the special customer to complete service. We show that even if the interarrival and service time parameters of two queues are identical, there exist examples (specific values of the parameters and initial lengths) for which the special customer surprisingly has a lower expected total time to completion by joining the longer queue first rather than the shorter one.

Affiliated with

Also associated with

No associations

Rating

Two Unordered Queues 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 Two Unordered Queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Unordered Queues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15145