The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. Simulation with stochastic and long range dependent traffic source models is performed, and the algorithms for buffer overfl...

Abstract: In this paper, we consider a single-server infinite(finite-) buffer bulk-service queues. The interarrival and service times are respectively, arbitrarily and exponentially distributed. The customers are served by a single server in accessible or non-accessible batches of maximum size ‘ b ’ with a minimum threshold value ‘ ’. We provide a recursive method, using the supplementary varia...

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...

In this paper, we present a discrete-time single-server finite-buffer queue in which the server takes single/multiple vacations whenever the system becomes empty. The interarrival times are geometrically distributed and service, vacation times are independently identically distributed random variables and their durations are integral multiples of a slot duration. We obtain the state probabiliti...

We study a finite buffer N-policy GI/M(n)/1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive met...

We consider a finite-buffer single-server queue with Markovian arrival process (MAP) where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both singleand multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parame...

A model of a cell communication network, divided into zones, with the dependence users' service time on zone, in which they are located, is considered. The arrival flow users defined by marked Markovian process. number that can receive simultaneously finite. If reached limit, then new lost, except come to already during (handover users). For short-term storage such users, there buffer finite ca...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers in the queue is N . We obtain the system-length distributions at prearrival and arbitrary epochs using the supplement...

This paper presents stochastic modelling of a single server, finite buffer Markovian queuing system with discouraged arrivals, balking, reneging, and retention reneged customers. Markov process is used to derive the steady-state solution model. Closed form expressions using probability generating functions (PGFs) are derived presented for both classical novel performance measures. In addition, ...

Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we s...