In this paper we introduce the adaptive MMAP[K] arrival process and analyze the adaptive MMAP[K]/PH[K]/1 queue. In such a queueing system, customers of K different types with Markovian inter-arrival times and possibly correlated customer types, are fed to a single server queue that makes use of r thresholds. Service times are phase-type and depend on the type of customer in service. Type k cust...

This paper treats a discrete-time single-server finite-buffer exhaustive (singleand multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation te...

Abstract. In this paper a queuing system with an in nite number of servers is considered. Customers arrive in the system according to a Markovian Arrival Process. Each customer carries a random quantity of work (capacity of the customer). In this study service time does not depend on the customers' capacities; the latter are used just to x some additional features of the system evolution. It is...

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

In this paper we introduce and analyze a model of a multiplexer queue with a batch Markovian arrival process and a special, timer based, non-work-conserving service discipline. We show that the embedded process at departures is an M/G/1 type process with proper state partitioning, which can be efficiently analyzed by matrix geometric methods. We derive the expressions to compute the distributio...

We derive in this paper the transient queue length and the busy period distributions of a single server queue with phase-type (PH) service times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precision o...

Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and quantitative system behaviour. We introduce a a process algebra including exponentially distributed time delays and a systematic approach to compute the underlying labelled transition system and continuous time Markov process. ...

We present GSMPA, a stochastically timed process algebra that enhances the expressiveness of the stochastically timed process algebra EMPA by allowing arbitrarily distributed durations to be directly modeled through the adoption of the mechanism of action identification as well as the adoption of the preselection policy for alternative actions. GSMPA is introduced together with the definition o...

Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...