Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-butTer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals. i.e. we consider a batch alTiva! single-server queue with ...

We consider the following stochastic bin packing process: the items arrive continuously over time to a server and are packed into bins of unit size according to an online algorithm. The unpacked items form a queue. The items have random sizes with symmetric distribution. Our first contribution identifies some monotonicity properties of the queueing system that allow to derive bounds on the queu...

This paper deals with a Markovian queueing system having a multi-task service counters and finite queue in front of each counter. The total service of a customer is completed in three stages provided by two servers at three counters. The first server (S1) can serve the counter I and III alternatively, whereas second server (S2) provides the service at counter II. The server (S1) g ives the prio...

A Starlite-like switching architecture for ATM applications is examined in this paper. The switching architecture consists primarily of a Batcher sorting network and a Banyan switching network. A performance evaluation is done using both analysis and simulation. A discrete time queueing analysis is utilized due to the slotted nature of the system. Cells that are unable to make it through the sy...

 Abstract—This paper considers a Geo/G/1 queue, in which the server operates a single vacation at end of each consecutive service period. After all the customers in the system are served exhaustively, the server immediately leaves for a vacation. Upon returning from the vacation, the server inspects the queue length. If there are customers waiting in the queue, the server either resumes servin...

Conventional urban traffic control systems have been based on historical traffic data. Later advancements made use of detectors, which enabled the gathering of real-time traffic data, in order to re-organize and calibrate traffic signalization programs. Further evolvement provided the ability to forecast traffic conditions, in order to develop traffic signalization programs and strategies pre-c...

This paper presents a performance analysis for the bandwidth allocation in IEEE 802.16 broadband wireless access (BWA) networks considering the packet-level quality-of-service (QoS) constraints. Adaptive Modulation and Coding (AMC) rate based on IEEE 802.16 standard is used to adjust the transmission rate adaptively in each frame time according to channel quality in order to obtain multiuser di...

We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M/G/1/n) systems. We show the somewhat surprising result that for three variations of the preemptive LCFS discipline, the maximum queue ...

In this paper, we consider a queue whose service speed changes according to an external environment that is governed by a Markov process. It is possible that the server changes its service speed many times while serving a customer. We derive first and second moments of the service time of customers in system using first step analysis to obtain an insight on the service process. In fact, we obta...