Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service

Details Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service

2011-08-26

arxiv.org/abs/1108.5356v1

Mathematics

Probability

i+9 pp

Scientific paper

We analyze an M/M/1 queue with a service discipline in which customers, upon arriving when the server is busy, search a sequence of stations for a vacant station at which to wait, and in which the server, upon becoming free when one or more customers are waiting, searches the stations in the same order for a station occupied by a customer to serve. We show how to find complete asymptotic expansions for all the moments of the waiting time in the heavy traffic limit. We show in particular that the variance of the waiting time for this discipline is more similar to that of last-come-first-served (which has a pole of order three as the arrival rate approaches the service rate) than that of first-come-first-served (which has pole of order two).

Affiliated with

Also associated with

No associations

Rating

Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service 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 Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502840