The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. This paper shows that this protocol is only marginally stable: once a queue is congested, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induc...

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 discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers in the queue is N . We obtain the system-length distributions at prearrival and arbitrary epochs using the supplement...

This paper presents an approximate analytical model for the evaluation of throughput and access delays in high-speed all-optical networks with slotted multi-channel ring topology, where each channel is shared in statistical time division by all nodes transmitting to one destination using a collision-and contention-free access protocol based on a channel inspection capability. Nodes are assumed ...

We consider a simple reentrant model of a manufacturing process, consisting of one machine at which two different types of items have to be processed. The model is completely deterministic: all delivery and processing times are fixed, and are generally incommensurate. Dependent on the arrival and processing times, a queue of waiting items grows, remains constant or disappears. We demonstrate th...

In the Operations Research queue-joining literature, beginning with Naor (1969), the queue joining probability is monotonic decreasing in the queue length; the longer the queue, the fewer consumers join. Recent academic and empirical evidence indicates that queue-joining probabilities may not always be decreasing in the queue length. We provide a simple explanation for these non-monotonic queue...

We consider Mt/Mt/S-type queueing model with group services. Bounds on the rate of convergence for the queue-length process are obtained. Ordinary Mt/Mt/S queue and Mt/Mt/S type queueing model with group services are studied as examples.

Switches in interconnection networks for highly parallel shared memory computer systems may be implemented with different internal buffer structures. For a 2×2 synchronous switch, previous studies have often assumed a switch composed of two queues, one at each output, each of which has unbounded size and may accept two inputs every clock cycle. Hardware implementations may actually use simpler ...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...