Time-limited and k-limited polling systems: a matrix analytic solution


Share/Save/Bookmark

Al Hanbali, A.M. and Haan, R. de and Boucherie, R.J. and Ommeren, J.C.W. van (2008) Time-limited and k-limited polling systems: a matrix analytic solution. In: The 3rd International Workshop on Tools for Solving Structured Markov Chains (SMCTools), 20 Oct 2008, Athens, Greece.

[img]
Preview
PDF
472kB
Abstract: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.
Item Type:Conference or Workshop Item
Faculty:
Management and Governance (SMG)
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/65239
Official URL:http://proceedings-online.org/index.php?id=4378
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 255032