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

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

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

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 presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...