Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution

Details Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution

2009-10-05

arxiv.org/abs/0910.0702v1

Mathematics

Probability

Scientific paper

10.4108/ICST.VALUETOOLS2008.4378

In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains. Finally, we will show that our tool works also in the case of a tandem queueing network with a single server that can serve one queue at a time.

Affiliated with

Also associated with

No associations

Rating

Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution 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 Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9496