Elucidating the Short Term Loss Behavior of Markovian-Modulated Batch-Service Queueing Model with Discrete-Time Batch Markovian Arrival Process
Author(s) -
YungChung Wang,
Dong-Liang Cai,
Li-Hsin Chiang,
Chengwei Hu
Publication year - 2014
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2014/814810
Subject(s) - markovian arrival process , markov process , queueing theory , network packet , discrete time and continuous time , computer science , queue , packet loss , real time computing , markov chain , computer network , mathematics , statistics , machine learning
This paper applies a matrix-analytical approach to analyze the temporal behavior of Markovian-modulated batch-service queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time batch Markovian service process (DBMSP). We examine the temporal behavior of packet loss by means of conditional statistics with respect to congested and noncongested periods that occur in an alternating manner. The congested period corresponds to having more than a certain number of packets in the buffer; noncongested period corresponds to the opposite. All of the four related performance measures are derived, including probability distributions of a congested and noncongested periods, the probability that the system stays in a congested period, the packet loss probability during congested period, and the long term packet loss probability. Queueing systems of this type arise in the domain of wireless communications.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom