Collection Of 2n Stations

A uses the adaptive tree walk protocol to arbitrate access to a shared cable. At a certain instant, two of them become ready. What are the minimum, maximum, and mean number of slots to walk the tree if 2n >> 1?

Posted in Uncategorized