We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...
Michael G. Kallitsis, Robert D. Callaway, Michael ...
In this paper we introduce a new distributed algorithm for location discovery. It can be used in wireless ad-hoc sensor networks that are equipped with means of measuring the dista...
Latency is a fundamental problem for all distributed systems including digital libraries. To reduce user perceived delays both caching – keeping accessed objects for future use â...
—The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. ...
John W. Byers, Michael Luby, Michael Mitzenmacher,...