We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisition of new customers. The server has to divide its energy between both activities. The number of newly acquired customers is uncertain, and the effect of the server’s acquisition efforts can only be seen after some fixe...

We propose a ow-control scheme that combines the merits of credit-and rate-based ow-control schemes by applying direct control over both bandwidth and buuer resources. The goal of the proposed scheme is to design an optimal rate-control policy for a given nite buuer capacity that maximizes average throughput and bounds end-to-end delay. By applying higher-order rate control, the proposed scheme...

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...

Transportation Research Record: Journal of the Transportation Research Board, No. 1988, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 63–66. The analytical procedures for all-way stop-controlled intersections in the 2000 edition of the Highway Capacity Manual (HCM) lack a model to estimate the 95th percentile queue length. This is considered a major shortc...

In this paper, we show that significant simplicities can arise in the analysis of a network when link capacities are large enough to carry many flows. In particular, we prove that, when an upstream queue serves a large number of regulated traffic sources, the queue-length of the downstream queue converges almost surely to the queue-length of a simplified queueing system (single queue) obtained ...