Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process (Q1719195): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59069521, #quickstatements; #temporary_batch_1707303357582
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:26, 5 March 2024

scientific article
Language Label Description Also known as
English
Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process
scientific article

    Statements

    Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: 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.
    0 references

    Identifiers