#### Filter Results:

#### Publication Year

1994

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In order to provide more value-added services, the Internet needs to classify packets into flows for different treatment. This function becomes a bottleneck in the router. High performance packet classification algorithms are therefore in high demand.This paper describes a new algorithm for packet classification using the concept of independent sets. The… (More)

In this paper, we consider single-user transmission over a Rayleigh flat fading channel, in which the Channel State Information (CSI) is known by the receiver only. Subject to an average transmit power constraint, we study the capacity of an Additive White Gaussian Noise (AWGN) channel with Rayleigh fading. Under an independently identically distributed… (More)

—This paper proposes a new data compression algorithm to store the routing table in a tree structure using very little memory. This data structure is tailored to a hardware design reference model presented in this paper. By exploiting the low memory access latency and high bandwidth of on-chip memory, high-speed packet forwarding can be achieved using this… (More)

In this paper, we consider GI=M=c queues with two classes of vacation mechanisms: Station vacation and server vacation. In the rst one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is group vacation for all servers. This phenomenon occurs in… (More)

Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and only if its traffic intensity is less than one. The result implies that the BMAP/PH/s/s+K retrial queue with PH-retrial times and the corresponding BMAP/PH/s queue have the same… (More)

Motivated by applications in computer networks, in this talk, we consider a tandem queue with feedback. In this model, both the interarrival time and the service time are exponential. Upon completion of the service at the second station, the customer either leaves the system with probability p or goes back together with all customers in the second queue to… (More)

In this paper, we consider a BM AP/G/1 retrial queue with a server subject to breakdowns and repairs, where the life time of the server is exponential and the repair time is general. We use the supplementary variable method, which combines with the matrix-analytic method and the censoring technique, to study the system. We apply the RG-factorization of a… (More)

Consider a queueing network with N nodes in which queue lengths are balanced through mean-field interaction. When N is large, we study the performance of such a network in terms of limiting results as N goes to infinity.

Many problems in management science and telecommunications can be solved by the analysis of a D X /D m /1 queueing model. In this paper, we use the zeros, both inside and outside the unit circle, of the denominator of the generating function of the model to obtain an explicit closed-form solution for the equilibrium probabilities of the number of customers… (More)