Shared network communication channels must deal with the fundamental issues of scheduling packet transmissions, and what to do about path contention and packet collisions. This paper highlights the authors’ authoritative knowledge of the underlying medium access control (MAC) protocols and algorithms. They work to identify an ideal persistence value, or the fraction of permitted packet transmission time, for a given topology and traffic loading. This topological persistence, a characteristic of the interrelated network, can then help improve traditional MAC protocols (such as those that are contention based and schedule based). Backed up by numerous detailed algorithms, theorems, and proofs, the paper takes the reader through details of both a centralized and a distributed approach. For example, the distributed approach introduces an efficient and accurate auctioning of available channel allocation, followed by bidding of the adjacent communication nodes. While acknowledging the need for reliable and finite time communication, the paper describes mitigating solutions for many of the failure modes of unreliable networks.

The new algorithms are analyzed through extensive simulations that focus on MAC layer convergence times while varying the persistence times, traffic loading, and packet sizes. The paper describes many intuitive approaches that still fail or prove too costly, while also contrasting variations in other network parameters. Bottlenecks in the distributed bidding process are also analyzed. Finally, their approach compares favorably with the wireless IEEE 802.11 protocol.

Overall, this paper is extensive and relevant for other approaches, and should provide a novice understanding of MAC protocols and expert protocol design ramifications.