The Adaptive RED proposed by Feng et al . [5] is shown to have small packet delay and queue length variation for long-life TCP traffic such as FTP connection with a large file size. However, a great portion of Internet traffic is shortlife web and UDP traffic. Most web traffic has a small file size and its TCP session is mainly operated in the slow start phase with a small congestion window siz...

For the GI0GI01 queue we show that the scaled queue size converges to reflected Brownian motion in a critical queue and converges to reflected Brownian motion with drift for a sequence of subcritical queuing models that approach a critical model+ Instead of invoking the topological argument of the usual continuousmapping approach, we give a probabilistic argument using Skorokhod embeddings in B...

solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time after a disturbance while still maintaining maximum link utilization at all times, even in the transient? The problem is non-trivial especially because of the vast possible heterogeneity in packet propagation delays in the n...

Today’s market share of Intelligent Network (IN) service is growing rapidly in wireless networks due to the rapid advances in wireless telecommunication and IN technology. To guarantee network independent IN services, mobility of IN service subscribers has to be taken into account. This paper proposes new designs of Global Service Logic for the IN service enhancement, which increase call comple...

We examine the properties of a promising new traac descriptor for ATM networks, namely the entropy of cell streams. The entropy is a measure of the disorganization among cells within a traac stream; alternatively we can say that entropy captures the amount of randomness in cell scattering. We study the entropy of ON-OFF sources with respect to the typical queue parameters of interest: average q...

We consider a feedback finite fluid queue with downward jumps, where the net flow rate and the jump size for the fluid are controlled by a background Markov chain with a finite state space. The finite means that the fluid queue has a finite buffer. The feedback means that the transition structure of the background process may change when the buffer content becomes empty or full. In this paper, ...

We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...