A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...

For the GI0GI01 queue we show that the scaled queue size converges to reflected Brownian motion in a critical queue and converges to reflected Brownian motion with drift for a sequence of subcritical queuing models that approach a critical model+ Instead of invoking the topological argument of the usual continuousmapping approach, we give a probabilistic argument using Skorokhod embeddings in B...

solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time after a disturbance while still maintaining maximum link utilization at all times, even in the transient? The problem is non-trivial especially because of the vast possible heterogeneity in packet propagation delays in the n...

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications. Service time variability across jobs is an important factor affecting both system performance and scheduling rules (for example, computer systems that prioritize short jobs over long jobs). Service time variability and its effects on mean response times have been studied exte...

Today’s market share of Intelligent Network (IN) service is growing rapidly in wireless networks due to the rapid advances in wireless telecommunication and IN technology. To guarantee network independent IN services, mobility of IN service subscribers has to be taken into account. This paper proposes new designs of Global Service Logic for the IN service enhancement, which increase call comple...

Existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. Several researches have focused on capacity drop existence and also its estimation issues. This paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

We examine the properties of a promising new traac descriptor for ATM networks, namely the entropy of cell streams. The entropy is a measure of the disorganization among cells within a traac stream; alternatively we can say that entropy captures the amount of randomness in cell scattering. We study the entropy of ON-OFF sources with respect to the typical queue parameters of interest: average q...

We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...