Download:
|
by Mike Paterson, Aravind Srinivasan
In Proc. FOCS'95, IEEE Computer
http://www.dcs.warwick.ac.uk/~msp/papers/FOCS95+.ps.gz
Add To MetaCart
Abstract:
When distributed processes contend for a shared resource, we need a good distributed contention resolution protocol, e.g., for multiple-access channels (ALOHA, Ethernet), PRAM emulation, and optical routing. Under a stochastic model of request generation from n synchronous processes, Raghavan & Upfal have shown a protocol which is stable for a positive request rate; their main result is that for every resource request, its expected delay (time to get serviced) is O(log n). Assuming that the initial clock times of the processes are within a known bound of each other, we present a stable protocol, wherein the expected delay for each request is O(1). We derive this by showing an analogous result for an infinite number of processes, assuming that all processes agree on the time.
Citations
|
715
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
427
|
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
– Chernoff
- 1995
|
|
300
|
Ethernet: Distributed packet switching for local computer networks
– Metcalfe, Boggs
- 1976
|
|
223
|
On the method of bounded differences
– McDiarmid
- 1989
|
|
220
|
Genaral purpose parallel architectures
– Valiant
- 1990
|
|
103
|
The probabilistic method,Wiley-Interscience
– Alon, Spencer
- 1992
|
|
65
|
Optical Communication for Pointer Based Algorithms
– Anderson, Miller
- 1988
|
|
64
|
Stochastic models of computer communication systems
– Kelly
- 1985
|
|
47
|
Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers, To appear in this journal. (A preliminary version appeared
– Goldberg, Jerrum, et al.
- 1993
|
|
47
|
Analysis of back-off protocols for multiple access channels
– Håstad, Leighton, et al.
- 1996
|
|
41
|
E cient Optical Communication in Parallel Computers
– Gereb-Graus, Tsantilas
- 1992
|
|
38
|
auf der Heide. Simple, efficient shared memory simulations
– Dietzfelbinger, Meyer
- 1993
|
|
37
|
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
– Aldous
- 1987
|
|
34
|
On Contention Resolution Protocols and Associated Probabilistic Phenomena
– MacKenzie, Plaxton, et al.
- 1994
|
|
32
|
Stochastic Contention Resolution with Short Delays
– Raghavan, Upfal
- 1998
|
|
20
|
The ALOHA system
– Abramson
- 1973
|
|
16
|
Upper bound on the capacity of random multiple access system
– Tsybakov, Likhanov
- 1987
|
|
15
|
The capacity region of the totally asynchronous multiple-access channels
– Hui, Humblet
- 1985
|
|
11
|
Bounds on the performance of protocols for a multiple access broadcast channel
– Pippenger
- 1981
|
|
9
|
Non-optimality of the part-and-try algorithm
– Vvedenskaya, Pinsker
- 1983
|
