Sciweavers

5 search results - page 1 / 1
» Asymptotically optimal importance sampling for Jackson netwo...
Sort
View
QUESTA
2010
89views more  QUESTA 2010»
13 years 3 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
Ali Devin Sezer
QUESTA
2007
103views more  QUESTA 2007»
13 years 4 months ago
Large deviations and importance sampling for a tandem network with slow-down
We consider a variant of the two node tandem Jackson network where the upstream server reduces its service rate when the downstream queue exceeds some prespecified threshold. The...
Paul Dupuis, Kevin Leder, Hui Wang
TOMACS
2002
101views more  TOMACS 2002»
13 years 4 months ago
Efficient simulation of a tandem Jackson network
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
Dirk P. Kroese, Victor F. Nicola
ICASSP
2010
IEEE
13 years 3 months ago
A symmetric adaptive algorithm for speeding-up consensus
Performing distributed consensus in a network has been an important research problem for several years, and is directly applicable to sensor networks, autonomous vehicle formation...
Daniel Thai, Elizabeth Bodine-Baron, Babak Hassibi
TMC
2008
127views more  TMC 2008»
13 years 4 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik