This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

in this paper, we study the network location problem for two congestible facilities, considering impatient customers. we suppose that when a customer arrives his/her corresponding facility and faces a queue with the size more than a predetermined threshold, the customer decides not to join the queue but to go to the closest facility to current facility. in the second facility, if the queue size...

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

this paper analyzes a renewal input  working vacations queue with change over times and bernoulli schedulevacation interruption under (a,c,b) policy.the service and vacation times are exponentially distributed.the server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

This paper deals with a discrete-time bulk-service Geo/Geo/1 queueing system with infinite buffer space and multiple working vacations. Considering an early arrival system, as soon as the server empties the system in a regular busy period, he leaves the system and takes a working vacation for a random duration at time n. The service times both in a working vacation and in a busy period and the ...

OPTIMAL INTERVAL FOR STOCHASTIC CLEARING SYSTEMS Shoichi Nishimura University of Tsukuba (Received March 8, 1978; Revised September 8, 1978) Stochastic clearing systems can be applied to bulk-service queue and demand-responsive public-service systems. Customers (input) arrive at a service facility and form a queue waiting to be served. When a server arrives at a service facility, waiting custom...

The performance of a Transmission Control Protocol (TCP) for a system with N connections sharing a common Active Queue Management (AQM) is analyzed for both AdditiveIncrease Multiplicative-Decrease (AIMD) and MultiplicativeIncrease Multiplicative-Decrease (MIMD) control mechanisms, where reduction signals follow either a cyclic or a probabilistic polling-type procedure. The Laplace-Stieltjes Tr...