Retrial BMAP/PH/N Queueing System with a Threshold-Dependent Inter-Retrial Time Distribution
In this paper, we study a multi-server queueing system with retrials and an infinite orbit. The arrival of primary customers is described by a batch Markovian arrival process (BMAP), and the service times have a phase-type (PH) distribution.
Valentina I. Klimenok +3 more
doaj +1 more source
Analysis of a k-Stage Bulk Service Queuing System with Accessible Batches for Service
In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a threshold.
Achyutha Krishnamoorthy +2 more
doaj +1 more source
Elucidating the Short Term Loss Behavior of Markovian‐Modulated Batch‐Service Queueing Model with Discrete‐Time Batch Markovian Arrival Process [PDF]
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
Wang, Yung-Chung +3 more
openaire +2 more sources
Modeling of Railway Stations Based on Queuing Networks
Among the micro-logistic transport systems, railway stations should be highlighted, such as one of the most important transport infrastructure elements. The efficiency of the transport industry as a whole depends on the quality of their operation.
Igor Bychkov +3 more
doaj +1 more source
EIGENVALUE EXPRESSION FOR A BATCH MARKOVIAN ARRIVAL PROCESS
Summary: Consider a batch Markovian arrival process (BMAP) as the counting process of an underlying process representing the state of environment. Such a process is useful for representing correlated inputs for example. They are used both as a modeling tool and as a theoretical device to represent and approximate superposition of input processes and ...
Nishimura, Shoichi, Sato, Hajime
openaire +2 more sources
Modeling IP traffic using the batch Markovian arrival process
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation
Klemm, Alexander +2 more
openaire +3 more sources
A Note on the Waiting-Time Distribution in an Infinite-Buffer GI[X]/C-MSP/1 Queueing System
This paper deals with a batch arrival infinite-buffer single server queue. The interbatch arrival times are generally distributed and arrivals are occurring in batches of random size.
A. D. Banik +2 more
doaj +1 more source
Multi-server queueing system with reserve servers
In this paper, we investigate a multi-server queueing system with an unlimited buffer, which can be used in the design of energy consumption schemes and as a mathematical model of unreliable real stochastic systems.
Valentina I. Klimenok
doaj +1 more source
On identifiability of MAP processes [PDF]
Two types of transitions can be found in the Markovian Arrival process or MAP: with and without arrivals. In transient transitions the chain jumps from one state to another with no arrival; in effective transitions, a single arrival occurs.
Lillo Rodríguez, Rosa Elvira +2 more
core +1 more source
An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

