Publication:
Multiclass G/M/1 queueing system with self-similar input and non-preemptive priority

dc.contributor.coauthorIftikhar, Mohsin
dc.contributor.coauthorSingh, Tejeshwar
dc.contributor.coauthorLandfeldt, Bjorn
dc.contributor.departmentDepartment of Mathematics
dc.contributor.kuauthorÇağlar, Mine
dc.contributor.schoolcollegeinstituteCollege of Sciences
dc.date.accessioned2024-11-09T23:45:20Z
dc.date.issued2008
dc.description.abstractIn 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.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue5
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.volume31
dc.identifier.doi10.1016/j.comcom.2007.12.033
dc.identifier.eissn1873-703X
dc.identifier.issn0140-3664
dc.identifier.scopus2-s2.0-40249103076
dc.identifier.urihttps://doi.org/10.1016/j.comcom.2007.12.033
dc.identifier.urihttps://hdl.handle.net/20.500.14288/13820
dc.identifier.wos254826800011
dc.keywordsQoS
dc.keywords3G
dc.keywordsUMTS
dc.keywordsGGSN
dc.keywordsSelf-similar model
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofComputer Communications
dc.subjectComputer science
dc.subjectInformation systems
dc.subjectEngineering
dc.subjectElectrical
dc.subjectElectronic
dc.subjectTelecommunications
dc.titleMulticlass G/M/1 queueing system with self-similar input and non-preemptive priority
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorÇağlar, Mine
local.publication.orgunit1College of Sciences
local.publication.orgunit2Department of Mathematics
relation.isOrgUnitOfPublication2159b841-6c2d-4f54-b1d4-b6ba86edfdbe
relation.isOrgUnitOfPublication.latestForDiscovery2159b841-6c2d-4f54-b1d4-b6ba86edfdbe
relation.isParentOrgUnitOfPublicationaf0395b0-7219-4165-a909-7016fa30932d
relation.isParentOrgUnitOfPublication.latestForDiscoveryaf0395b0-7219-4165-a909-7016fa30932d

Files