Results 1  10
of
1,077
An Exponential Arrival Model for HalfLife 2 Server Discovery Traffic
"... Abstract—Online multiplayer first person shooter (FPS) clients typically discover public game servers through a twostep process. A master server is queried for a list of current game servers, who are then sequentially probed (creating a 24hour cycle of background noise for FPS game servers). Using ..."
Abstract
 Add to MetaCart
). Using 3 million probe packets received by a HalfLife 2 server in February and April 2006, we show arrivals exhibit exponentially distributed, uncorrelated interprobe intervals during both busiest and leastbusy hours of a day. We further show a modified Laplace curve is a reasonable perhour estimator
WideArea Traffic: The Failure of Poisson Modeling
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1995
"... Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session and con ..."
Abstract

Cited by 1775 (24 self)
 Add to MetaCart
Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session
Moment characterization of matrix exponential and Markovian arrival processes
 ANN OPER RES
"... This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an algorithm to compute any finite dimensional moments of these processes based on a set of required (low order) moments. Th ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an algorithm to compute any finite dimensional moments of these processes based on a set of required (low order) moments
Binary Exponential Backoff is Stable for High Arrival Rates
, 1999
"... Goodman, Greenberg, Madras and March gave a lower bound of n 1 8 n) for the maximum arriaval rate for which the nuser binary exponential backo protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n 120 n) . We improve the lower bound, showin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Goodman, Greenberg, Madras and March gave a lower bound of n 1 8 n) for the maximum arriaval rate for which the nuser binary exponential backo protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n 120 n) . We improve the lower bound
Stability, queue length and delay of deterministic and stochastic queueing networks
 IEEE Transactions on Automatic Control
, 1994
"... Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and (ii) conditions for queueing networks in which the queue length distribution of ..."
Abstract

Cited by 231 (21 self)
 Add to MetaCart
of a queue has an exponential tail with rate `. To answer these two types of stability problems, we introduce two new notions of traffic characterization: minimum envelope rate (MER) and minimum envelope rate with respect to `. Based on these two new notions of traffic characterization, we develop a
Stability Of Binary Exponential Backoff
, 1988
"... Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple access broadcast channel. Ethernet, a local area network, is built upon this protocol. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in ti ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
in time, provided the rates of new packet arrivals are small enough? It is assumed n 2 stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable
1 Moment Characterization of Matrix Exponential and Markovian Arrival Processes∗
"... This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an algorithm to compute any finite dimensional moments of these processes based on a set of required (low order) moments. Th ..."
Abstract
 Add to MetaCart
. This algorithm does not require the computation of any representation of the given process. We present a series of related results and numerical examples to demonstrate the potential use of the obtained moment relations. Keywords: Matrix exponential process, Markov arrival process, Matrix exponential
Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
, 2014
"... Multiclass open queueing networks find wide applications in communication, computer and fabrication networks. Often one is interested in steadystate performance measures associated with these networks. Conceptually, under mild conditions, a regenerative structure exists in multiclass networks, mak ..."
Abstract
 Add to MetaCart
corresponding to customer arrivals to an empty network constitute a regenerative structure. In this paper, we consider networks where the interarrival times are generally distributed but have exponential or heavier tails. We show that these distributions can be decomposed into a mixture of sums of independent
Queueing for ergodic arrivals and services
, 709
"... In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail. ..."
Abstract
 Add to MetaCart
In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail.
Results 1  10
of
1,077