We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...