A model of the contention resolution time for binary tree protocols
Jagan P. Agrawal, Mary L. Gerken · 1992
In a binary tree type local area network (LAN) protocol, the number of probe slots (K) needed for contention resolution, when M out of N terminals are contending for the bus access depends not only on the value of M but also on the pattern of the active terminals, i.e., where the physical addresses of the active terminals are located in the logical binary tree structure. The value of M depends on the traffic intensity and increases with the packet arrival rate.