In this paper we study communication networks that employ drop-tail queueing and additive-increase multiplicative-decrease (AIMD) congestion control algorithms. We show that the t...
Robert Shorten, Chris King, Fabian Wirth, Douglas ...
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...