By Topic

Performance of a polling system with finite queues using Markov chain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sohail, A. ; Inst. of Broadband Commun., Vienna Univ. of Technol., Vienna, Austria ; Yasin, A.

Polling systems have an important role in performance studies of polling mechanisms in communication and computer networks, where several terminals or users compete for access to a shared resource. In this study we present a polling system with finite queues and investigate its performance. We use the state of the art Markov chain technique to reveal the performance measures of the considered polling system, e.g. mean number of customers in the queue, probabilities that the queue is idle, blocking or loss probabilities for customers in the queue of the polling system.

Published in:

Computer Applications and Industrial Electronics (ICCAIE), 2010 International Conference on

Date of Conference:

5-8 Dec. 2010