Analysis of discrete-time queueing systems with priority jumps

Analysis of discrete-time queueing systems with priority jumps

0.00 Avg rating0 Votes
Article ID: iaor20108858
Volume: 8
Issue: 4
Start Page Number: 433
End Page Number: 436
Publication Date: Dec 2010
Journal: 4OR
Authors:
Keywords: queues: theory
Abstract:

This text is a summary of the author’s PhD thesis supervised by Herwig Bruneel and Joris Walraevens, and defended on 5 March 2009 at Ghent University. The thesis is written in English and is available from the author upon request. The work deals with several priority scheduling disciplines with so-called priority jumps. An efficient priority scheduling discipline is of great importance in modern telecommunication devices. Static priority scheduling achieves maximum service differentiation between different types of traffic, but may have a too severe impact on the performance of lower-priority traffic. Introducing priority jumps aims for a more gradual service differentiation. In the thesis, we propose several (types of) jumping mechanisms, and we analyse their effect on the performance of a discrete-time queueing system.

Reviews

Required fields are marked *. Your email address will not be published.