We study a queueing system having a mixture of a special semi-Markov process (SSMP) and a Poisson process as the arrival process, where the Poisson arrival is regarded as interfering traffic. It is shown by numerical examples that the SSMP customers receive worse treatment than Poisson customers, i.e., the mean waiting time of SSMP customers is longer than that of Poisson customers. We also pro...

In this paper, we analyze a retrial queueing system with Batch Markovian Arrival Processes and two types of customers. The rate of individual repeated attempts from the orbit is modulated according to a Markov Modulated Poisson Process. Using the theory of multi-dimensional asymptotically quasi-Toeplitz Markov chain, we obtain the stability condition and the algorithm for calculating the statio...

We present an efficient algorithm for effecting round-robin service in discrete-event simulation systems. The approach generalizes and improves upon a previous approach in which a single arrival and a single departure event is considered and handled at a time; further, the previous approach is already an improvement over naive round-robin scheduling currently in use in simulation libraries. The...

A mixture of reservation plus contention data slots is now widely implemented in TDMA/ CDMA systems to make a system flexible enough to suit various kinds of packets but preserve the good nature of frame-based protocols. We conducted performance analysis for an arbitrary connection in such a system under the assumption of MMPP (Markov-modulated Poisson process) arrivals. Accessible slot locatio...

An embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the system is empty, the server remains idle (deactivates) and does not start serving the waiting customers in the queue until the number of arrivals reaches N. The service is performed in batches of min(n, N) if there are n customers waiting at the completion of service. Service times of the server depend o...

Batching jobs in a manufacturing system is a very common policy in most industries. Main reasons for batching are avoidance of set ups and/or facilitation of material handling. Examples of batch-wise production systems are ovens found in aircraft industry and in semiconductor manufacturing. Starting from the early nineties much research efforts have been put in constructing strategies for the d...

We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as they can be used to approximate Lévy processes, diffusion processes, and certain types of growth-collapse processes; thus, all of the processes mentioned abo...

This paper describes the SODA scheduler for System S , a highly scalable distributed stream processing system. Unlike traditional batch applications, streaming applications are open-ended. The system cannot typically delay the processing of the data. The scheduler must be able to shift resource allocation dynamically in response to changes to resource availability, job arrivals and departures, ...

We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-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 has been served. Depending on ...

– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...