Technical Reports

The ICICS/CS Reading Room


UBC CS TR-85-03 Summary

A Fast Divide \& Conquer Protocol for Contention Resolution on Broadcast Channels, April 1985 Karl Abrahamson

We describe a contention resolution protocol for an ethernet-like broadcast channel The protocol is based on tree algorithms, particularly that of Greenberg. We show how to obtain a simpler and more accurate estimate of the number of contending stations than Greenberg's method, and use the new estimation method to obtain an improved protocol.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.