Cart (Loading....) | Create Account
Close category search window
 

Modelling Priority Queueing Systems with Multi-Class Self-Similar Network Traffic

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)
Xiaolong Jin ; Univ. of Bradford, Bradford ; Geyong Min

Traffic self-similarity has been discovered to be a ubiquitous phenomenon in modern communication networks and multimedia systems. Due to its scale-invariant bursty nature, performance modelling of self-similar traffic poses greater challenges and exhibits more complexity than that of traditional non-bursty traffic. As a result, most existing studies on analytical modelling of priority queueing systems with self-similar inputs have been restricted to a simplified scenario where only two traffic flows are taken into account. This study contributes to performance modelling and analysis of priority queueing systems by proposing a novel and efficient queue-decomposition approach to handle multi-class self-similar traffic. Specifically, we extend the well-known method of empty buffer approximation in order to decompose the priority queueing system equivalently into a group of single-server single-queue systems. We further obtain the analytical upper and lower bounds of the queue length distributions for individual traffic flows.

Published in:

Communications, 2007. ICC '07. IEEE International Conference on

Date of Conference:

24-28 June 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.