70 search results - page 1 / 14 » On the queue-overflow probabilities of distributed schedulin... |
TON
2010
12 years 11 months ago
2010
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
ICC
2008
IEEE
13 years 10 months ago
2008
IEEE
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
SPIN
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
IFM
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...