[PDF][PDF] The batch Markovian arrival process: a review and future work

SR Chakravarthy - Advances in probability theory and stochastic …, 2001 - researchgate.net
Marked point processes (MPP's) play an important role in stochastic modeling. In this talk we
review a class of point processes, called batch Markovian arrival processes (BMAP's), that is …

Markovian arrival process parameter estimation with group data

H Okamura, T Dohi, KS Trivedi - IEEE/ACM Transactions on …, 2009 - ieeexplore.ieee.org
This paper addresses a parameter estimation problem of Markovian arrival process (MAP).
In network traffic measurement experiments, one often encounters the group data where …

A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes

Z Niu, Y Takahashi - Queueing Systems, 1999 - Springer
We consider a finite‐capacity single‐server vacation model with close‐down/setup times
and Markovian arrival processes (MAP). The queueing model has potential applications in …

Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions

T Takine - Queueing Systems, 2001 - Springer
This paper considers the queue length distribution in a class of FIFO single-server queues
with (possibly correlated) multiple arrival streams, where the service time distribution of …

Error bounds for augmented truncations of discrete-time block-monotone Markov chains under geometric drift conditions

H Masuyama - Advances in Applied Probability, 2015 - cambridge.org
In this paper we study the augmented truncation of discrete-time block-monotone Markov
chains under geometric drift conditions. We first present a bound for the total variation …

MAP/G/1 queues under N-policy with and without vacations

S Kasahara, T Takine, Y Takahashi… - Journal of the …, 1996 - jstage.jst.go.jp
There. aremany iJariants in single-server queueing models with server vacatiens, where a
server is unavailable foroccasional intervalscalled vacations. Queueingsystems with …

Fundamental characteristics of queues with fluctuating load

V Gupta, M Harchol-Balter, AS Wolf… - Proceedings of the joint …, 2006 - dl.acm.org
Systems whose arrival or service rates fluctuate over time are very common, but are still not
well understood analytically. Stationary formulas are poor predictors of systems with …

Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline

J Walraevens, B Steyaert, H Bruneel - Performance Evaluation, 2002 - Elsevier
Priority scheduling for packets is becoming a hot topic, as attempts are being made to
integrate voice services in existing data networks. In this paper, we consider a discrete-time …

The nonpreemptive priority MAP/G/1 queue

T Takine - Operations Research, 1999 - pubsonline.informs.org
This paper considers the nonpreemptive priority queue with MAP (Markovian Arrival
Process) arrivals. Since MAP is weakly dense in the class of stationary point processes, it is …

Quantitative security evaluation of intrusion tolerant systems with Markovian arrivals

J Zheng, H Okamura, T Dohi… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Intrusion tolerance is an ability to keep the correct service by masking the intrusion based on
fault-tolerant techniques. With the rapid development of virtualization, the virtual machine …