<%@ page language="java" contentType="text/html" %>
<%-- Include common initialisation code --%>
<%@ include file="/arch/common.jsp" %>
<%-- The current tab --%>
<% String currentTab = "Research"; %>
<%-- Content of navigation pane --%>
<%@ include file="nav.jsp" %>
<% showCurrentLink=true; %>
<%-- Current navigation location --%>
<% String currentNav = "Reports and Theses"; %>
<%-- Include the code for the document header --%>
<%@ include file="/arch/header.jsp" %>
Research Report CS-RR-359
<%-- Include the code for the lines and navigation --%>
<%@ include file="/arch/middle.jsp" %>
Hesham Al-Ammal, Leslie Ann Goldberg and Phil MacKenzie,
Binary Exponential Backoff is Stable for High Arrival Rates
(August 3, 1999).
Abstract
Goodman, Greenberg, Madras and March gave a lower bound of n-Omega(log n) for the maximum arrival rate for which the n-user binary exponential
backoff protocol is stable. Thus, they showed that the protocol is stable
as long as the arrival rate is at most n-Omega(log n). We improve
the lower bound, showing that the protocol is stable for arrival rates
up to O(n-.9).
Download
cs-rr-359.ps.gz
<%-- Include the code for the document footer --%>
<%@ include file="/arch/footer.jsp" %>