Results 111 to 120 of about 184 (123)

Drop behaviour of random early detection with discrete-time batch Markovian arrival process

IEE Proceedings - Communications, 2004
A matrix-analytic approach is applied to analyse both the long-term and the short-term drop behaviour of a router with an RED scheme. The bursty nature of packet drop is examined by means of conditional statistics with respect to alternating congested and non-congested periods.
Y.-C. Wang, J.-A. Jiang, R.-G. Chu
openaire   +1 more source

Loss behavior in space priority queue with batch Markovian arrival process — discrete-time case

Performance Evaluation, 2000
Summary: This paper applies matrix-analytic approach to the examination of the loss behavior of a space priority queue. In addition to the evaluation of the long-term high-priority and low-priority packet loss probabilities, we examine the bursty nature of packet losses by means of conditional statistics with respect to critical and non-critical ...
Yung-Chung Wang, Chih-Wei Liu, Chung-Chin Lu   +2 more
openaire   +2 more sources

Loss probabilities and delay and jitter distributions in a finite buffer queue with heterogeneous batch Markovian arrival processes

Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference, 2002
We study a single server queue with finite buffer that may represent an ATM multiplexer. The input traffic is a superposition of independent heterogeneous batch Markovian arrival processes. Service durations are supposed to be exponential. We derive the loss probability and the delay and jitter distributions for each individual process, as well as for ...
D. Kofman, H. Korezlioglu
openaire   +1 more source

A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)

Ann. Oper. Res., 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohan L. Chaudhry, Abhijit Datta Banik, António Pacheco 0001   +2 more
openaire   +3 more sources

Algorithmic Analysis of Dual Tandem Queue with Batch Markovian Arrival Process and Repeated Attempts at the First Station

2014
A dual tandem queueing system with a Batch Markovian Arrival Process (\(BMAP\)) is considered. The first station is represented by a retrial multi-server queueing system with infinite orbit. General form of dependence of the total retrial intensity on the current number of customers in orbit is suggested. The second station is a multi-server queue with
Valentina Klimenok, Alexander Dudin
openaire   +1 more source

A Two-Step Fitting Approach of Batch Markovian Arrival Processes for Teletraffic Data

2021
Gang Chen 0038, Li Xia, Zhaoyu Jiang, Xi Peng 0006, Li Chen 0008, Bo Bai 0001   +5 more
openaire   +1 more source

Analysis of a population model with batch Markovian arrivals influenced by Markov arrival geometric catastrophes

Communications in Statistics - Theory and Methods, 2021
Nitin Kumar, U C Gupta
exaly  

Continuous‐Batch Markovian Arrival Process

2022
exaly  

A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\infty $$ M S P / 1 / ∞

Annals of Operations Research, 2015
M L Chaudhry, A D Banik, Antonio Pacheco   +2 more
exaly  

Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service

Journal of Systems Science and Systems Engineering, 2015
A D Banik, Banik A D
exaly