Delay or queue length information has the potential to influence the decision of a customer to use a service system. Thus, it is imperative for service system managers to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze two two-dimensional deterministic fluid models that incorporate customer choice behavior based o...

Wireless access points act as bridges between wireless and wired networks. Since the actually available bandwidth in wireless networks is much smaller than that in wired networks, there is a bandwidth disparity in channel capacity which makes the access point a significant network congestion point. The recently proposed active queue management (AQM) is an effective method used in wired network ...

The optimal tradeoff between average service cost rate, average utility rate, and averagedelay is addressed for a state dependent M/M/1 queueing model, with controllable queue lengthdependent service rates and arrival rates. For a model with a constant arrival rate λ for all queuelengths, we obtain an asymptotic characterization of the minimum average delay, when theaverage serv...

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

Mobile Ad hoc network [MANET] consists of mobile nodes without any fixed infrastructure, communicating through wireless medium. In MANET, Congestion occurs in any intermediate nodes when data packets travel from source to destination and they incur higher packet loss rate and long delay, which cause the degradations in performance of a network. Congestion can be controlled by Active Queue Manag...

This paper treats two-threshold policies for an M/G/1 queue with two types of generally distributed random vacations: type 1 (long) and type 2 (short) vacations. Upon returning from a vacation, the server observes the queue length. If this is less than the lower threshold, the server takes a type 1 vacation; if it is between the two thresholds, the server takes a type 2 vacation; and if it is a...

Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection (RED), involves dropping an incoming packet with some probability based on the estimated average queue length at the router. The analytical approaches to obtaining average drop probabilities in a RED en...

We study an admissions control problem, where a queue with service rate 1 − p receives incoming jobs at rate λ ∈ (1 − p,1), and the decision maker is allowed to redirect away jobs up to a rate of p, with the objective of minimizing the time-average queue length. We show that the amount of information about the future has a significant impact on system performance, in the heavy-traffic regime. W...

The quantum time length is usually taken as a fixed value in all applications that use Round Robin (RR) scheduling algorithm. The determination of the optimal length of the quantum that results in a small average turn around time is very complicated because of the unknown nature of the tasks in the ready queue. The round robin algorithm becomes very similar to the first in first served algorith...