Stability of a spatial polling system with greedy myopic service

Details Stability of a spatial polling system with greedy myopic service Stability of a spatial polling system with greedy myopic service

2009-08-31

arxiv.org/abs/0908.4585v4

Mathematics

Probability

Revised content

Scientific paper

This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operates according to a greedy policy, always serving the nearest customer in its neighborhood, and leaving the system unchanged at polling instants where the neighborhood is empty. This system is modeled as a measure-valued random process, which is shown to be positive recurrent under a natural stability condition that does not depend on the server's scan range. When the interpolling times are light-tailed, the stable system is shown to be geometrically ergodic. The steady-state behavior of the system is briefly discussed using numerical simulations and a heuristic light-traffic approximation.

Affiliated with

Also associated with

No associations

Rating

Stability of a spatial polling system with greedy myopic 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 Stability of a spatial polling system with greedy myopic service, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of a spatial polling system with greedy myopic service will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221206