Log-logarithmic protocols for resolving ethernet and semaphore conflicts
Dan E. Willard · 1984
We propose two protocols for resolving conflicts on ethernetlike mediums in log-logarithmicexpected time and prove our algorithms are optimal up to an additive constant.It is difficult to second-guess the fast-changing electronics industry, but our analysis could be relevant outside the traditional interests of the ethernet literature to semaphore-like problems.