Analysis of discrete-time queueing systems with priority jumps |
| |
Authors: | Tom Maertens |
| |
Institution: | (1) School of Mathematical and Geospatial Sciences, Royal Melbourne Institute of Technology University, GPO Box 2467V, 3000 Melbourne, Victoria, Australia;(2) School of Mathematical and Geospatial Sciences, Royal Melbourne Institute of Technology University, Bundoora East Campus, Plenty Rd, 3083 Bundoora, Victoria, Australia;(3) School of Computer Science & Information Technology, Royal Melbourne Institute of Technology University, GPO Box 2476V, 3001 Melbourne, Victoria, Australia;(4) Computer Science and IT, Royal Melbourne Institute of Technology University, 376-392 Swanston Street, 3001 Melbourne, Australia;(5) School of Computer Science and Information Technology, Royal Melbourne Institute of Technology University, GPO Box 2476V, 3001 Melbourne, Victoria, Australia |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|