We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, lambda, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgment-based protocol
When distributed processes contend for a shared resource, we need a good distributed contention reso...
Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival...
In this work we address the question whether a simple shared channel could be efficiently utilized, ...
We study contention-resolution protocols for multiple-access channels. We show that every backoff pr...
In contention resolution, multiple processors are trying to coordinate to send discrete messages thr...
Backoff protocols are probably the most widely used protocols for contention resolution in multiple ...
AbstractBackoff protocols are probably the most widely used protocols for contention resolution in m...
Backoff protocols are probably the most widely used protocols for contention resolution in multiple...
In this paper, we analyze backoff protocols, such as the one used in Ethernet. We examine a general ...
Conference PaperIn this paper, we study the impact of delay constraints on the throughput of a queue...
A general model is presented for synchronous protocols that resolve conflicts among message transmis...
Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival...
We study contention resolution in a multiple-access channel such as the Ethernet channel. In the mod...
A frequent problem in settings where a unique resource must be shared among users is how to resolve ...
Abstract. A frequent problem in settings where a unique resource must be shared among users is how t...
When distributed processes contend for a shared resource, we need a good distributed contention reso...
Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival...
In this work we address the question whether a simple shared channel could be efficiently utilized, ...
We study contention-resolution protocols for multiple-access channels. We show that every backoff pr...
In contention resolution, multiple processors are trying to coordinate to send discrete messages thr...
Backoff protocols are probably the most widely used protocols for contention resolution in multiple ...
AbstractBackoff protocols are probably the most widely used protocols for contention resolution in m...
Backoff protocols are probably the most widely used protocols for contention resolution in multiple...
In this paper, we analyze backoff protocols, such as the one used in Ethernet. We examine a general ...
Conference PaperIn this paper, we study the impact of delay constraints on the throughput of a queue...
A general model is presented for synchronous protocols that resolve conflicts among message transmis...
Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival...
We study contention resolution in a multiple-access channel such as the Ethernet channel. In the mod...
A frequent problem in settings where a unique resource must be shared among users is how to resolve ...
Abstract. A frequent problem in settings where a unique resource must be shared among users is how t...
When distributed processes contend for a shared resource, we need a good distributed contention reso...
Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival...
In this work we address the question whether a simple shared channel could be efficiently utilized, ...