In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...

Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our...

We consider a fading point-to-point link with packets arriving randomly at rate λ per slot to the transmitter queue. We assume that the transmitter can control the number of packets served in a slot by varying the transmit power for the slot. We restrict to transmitter scheduling policies that are monotone and stationary, i.e., the number of packets served is a non-decreasing function of the qu...

In order to achieve high throughput and low average delay in computer network, it is necessary to stabilize the queue length and avoid oscillation or chaos phenomenon. In this paper, based on Adaptive Random Early Detection ARED , an improved algorithm is proposed, which dynamically changes the range of maximum drop probability pmax according to different network scenarios and adjusts pmax to l...

This work presents an extension of a recently developed scheme, namely the Simple Explicit Rate Identification with Congestion Avoidance (SERICA) algorithm, which regulates the ABR traffic flow in an ATM network. Like SERICA, the new scheme, which is called SERICA_ω, takes into account the load and the queue length per VC, calculates the first approximation of the ER field of the BRM cell, and ...

In this paper, we propose a preemptive priority handoff scheme for integrated voice/data cellular mobile systems. In our scheme, calls are divided into three different classes: handoff voice calls, originating voice calls, and data calls. In each cell of the system there is a queue only for data calls. Priority is given to handoff voice calls over the other two kinds of calls. That is, the righ...

Understanding how delayed information impacts queueing systems is an important area of research. However, much of the current literature neglects one important feature of many queueing systems, namely non-stationary arrivals. Non-stationary arrivals model the fact that customers tend to access services during certain times of the day and not at a constant rate. In this paper, we analyze two two...

In this paper a novel adaptive bandwidth allocation scheme called Prudent Creditization Polling (PCP) is proposed and adapted with the reservation protocol IPACT. PCP attempts to reduce the average queue length at the ONUs and the average packet delay throughout the network. At each polling period, PCP attempts to creditize the request of the ONUs that suffer from high RTT, high average delay p...

In this paper, we first review a localized ramp-metering strategy for freeways that achieves the goal of reducing the spatial and temporal span of traffic congestion, using locally available information. The control scheme is composed of a switching mainline-traffic responsive ramp-metering controller that adapts to the different traffic dynamics under different congestion conditions—free-flow ...

Current TCP flow control depends on packet losses to find the workload that a network can support. Packet drops not only reduce TCP performance, but also add large transfer delay to the packets. Instead of dropping the overflowed packets, Explicit Congestion Notification (ECN) detects incipient congestion and notifies the sources to reduce their windows when the queue length exceeds a threshold...