Sciweavers

341 search results - page 43 / 69
» queue 2006
Sort
View
RSA
2006
144views more  RSA 2006»
14 years 9 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
ETT
2002
92views Education» more  ETT 2002»
14 years 9 months ago
Most probable paths and performance formulae for buffers with gaussian input traffic
In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the ...
Ron Addie, Petteri Mannersalo, Ilkka Norros
LCN
2006
IEEE
15 years 3 months ago
A New Stable AQM Algorithm Exploiting RTT Estimation
AQM is a technique for congestion control such that a router notifies congestion to a TCP sender when congestion occurs. Almost no AQM algorithms ever take the RTT values of TCP ...
Hayato Hoshihara, Hisashi Koga, Toshinori Watanabe
SIGMETRICS
2006
ACM
116views Hardware» more  SIGMETRICS 2006»
15 years 3 months ago
The Erlang model with non-poisson call arrivals
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
Thomas Bonald
IOR
2006
163views more  IOR 2006»
14 years 9 months ago
Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
T. P. I. Ahamed, Vivek S. Borkar, S. Juneja