Advanced

Multiclass G/M/1 Queueing System with Self-Similar Input and Non- Preemptive Priority

Iftikhar, Mohsin; Singh, Tejeshwar; Landfeldt, Björn LU and Caglar, Mine (2008) In Computer Communications 31(5). p.1012-1027
Abstract
In order to deliver innovative and cost-effective IP multimedia applications over mobile devices, there is a need to develop a unified service platform for the future mobile Internet referred as the Next Generation (NG) all-IP network. It is convincingly demonstrated by numerous recent studies that modern multimedia network traffic exhibits long-range dependence (LRD) and self-similarity. These characteristics pose many novel and challenging problems in traffic engineering and network planning. One of the major concerns is how to allocate network resources efficiently to diverse traffic classes with heterogeneous QoS constraints. However, much of the current understanding of wireless traffic modeling is based on classical Poisson... (More)
In order to deliver innovative and cost-effective IP multimedia applications over mobile devices, there is a need to develop a unified service platform for the future mobile Internet referred as the Next Generation (NG) all-IP network. It is convincingly demonstrated by numerous recent studies that modern multimedia network traffic exhibits long-range dependence (LRD) and self-similarity. These characteristics pose many novel and challenging problems in traffic engineering and network planning. One of the major concerns is how to allocate network resources efficiently to diverse traffic classes with heterogeneous QoS constraints. However, much of the current understanding of wireless traffic modeling is based on classical Poisson distributed traffic, which can yield misleading results and hence poor network planning. Unlike most existing studies that primarily focus on the analysis of single-queue systems based on the simplest First-Come-First-Serve (FCFS) scheduling policy, in this paper we introduce the first of its kind analytical performance model for multiple-queue systems with self-similar traffic scheduled by priority queueing to support differentiated QoS classes. The proposed model is based on a G/M/1 queueing system that takes into account multiple classes of traffic that exhibit long-range dependence and self-similarity. We analyze the model on the basis of non-preemptive priority and find exact packet delay and packet loss rate of the corresponding classes. We develop a finite queue Markov chain for non-preemptive priority scheduling, extending the previous work on infinite capacity systems. We extract a numerical solution for the proposed analytical framework by formulating and solving the corresponding Markov chain. We further present a comparison of the numerical analysis with comprehensive simulation studies of the same system. We also implement a Cisco-router based test bed, which serves to validate the mathematical, numerical, and simulation results as well as to support in understanding the QoS behaviour of realistic traffic input. (Less)
Please use this url to cite or link to this publication:
author
publishing date
type
Contribution to journal
publication status
published
subject
in
Computer Communications
volume
31
issue
5
pages
1012 - 1027
publisher
Elsevier
external identifiers
  • scopus:40249103076
ISSN
0140-3664
DOI
10.1016/j.comcom.2007.12.033
language
English
LU publication?
no
id
a37bff39-1e0a-4f1b-bda5-0433324c0359 (old id 3173075)
date added to LUP
2012-11-19 14:46:21
date last changed
2017-07-30 04:24:49
@article{a37bff39-1e0a-4f1b-bda5-0433324c0359,
  abstract     = {In order to deliver innovative and cost-effective IP multimedia applications over mobile devices, there is a need to develop a unified service platform for the future mobile Internet referred as the Next Generation (NG) all-IP network. It is convincingly demonstrated by numerous recent studies that modern multimedia network traffic exhibits long-range dependence (LRD) and self-similarity. These characteristics pose many novel and challenging problems in traffic engineering and network planning. One of the major concerns is how to allocate network resources efficiently to diverse traffic classes with heterogeneous QoS constraints. However, much of the current understanding of wireless traffic modeling is based on classical Poisson distributed traffic, which can yield misleading results and hence poor network planning. Unlike most existing studies that primarily focus on the analysis of single-queue systems based on the simplest First-Come-First-Serve (FCFS) scheduling policy, in this paper we introduce the first of its kind analytical performance model for multiple-queue systems with self-similar traffic scheduled by priority queueing to support differentiated QoS classes. The proposed model is based on a G/M/1 queueing system that takes into account multiple classes of traffic that exhibit long-range dependence and self-similarity. We analyze the model on the basis of non-preemptive priority and find exact packet delay and packet loss rate of the corresponding classes. We develop a finite queue Markov chain for non-preemptive priority scheduling, extending the previous work on infinite capacity systems. We extract a numerical solution for the proposed analytical framework by formulating and solving the corresponding Markov chain. We further present a comparison of the numerical analysis with comprehensive simulation studies of the same system. We also implement a Cisco-router based test bed, which serves to validate the mathematical, numerical, and simulation results as well as to support in understanding the QoS behaviour of realistic traffic input.},
  author       = {Iftikhar, Mohsin and Singh, Tejeshwar and Landfeldt, Björn and Caglar, Mine},
  issn         = {0140-3664},
  language     = {eng},
  number       = {5},
  pages        = {1012--1027},
  publisher    = {Elsevier},
  series       = {Computer Communications},
  title        = {Multiclass G/M/1 Queueing System with Self-Similar Input and Non- Preemptive Priority},
  url          = {http://dx.doi.org/10.1016/j.comcom.2007.12.033},
  volume       = {31},
  year         = {2008},
}