Stability of a Server with Greedy Strategy on the Circle

Details Stability of a Server with Greedy Strategy on the Circle Stability of a Server with Greedy Strategy on the Circle

2011-12-11

arxiv.org/abs/1112.2389v1

Mathematics

Probability

Scientific paper

We consider a single-server system with stations in each point of the circle.
Customers arrive after exponential times, at uniformly-distributed locations.
The server moves at finite speed and adopts a greedy routing mechanism. For any
value of the speed, we prove that the system is stable as long as the service
rate exceeds the arrival rate.

Affiliated with

Also associated with

No associations

Rating

Stability of a Server with Greedy Strategy on the Circle 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 Server with Greedy Strategy on the Circle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of a Server with Greedy Strategy on the Circle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708093