An improved persitent CSMA algorithm without collision detection

Claudio Salati · ACM SIGCOMM Computer Communication Review · 1990

The paper presents a new version of the CSMA algorithm which improves the performances of 1-persistent CSMA without the need of collision detection, and without any rescheduling of frames, and thus any waste of bandwidth. Performances are evaluated both through experimental data and through a mathematical argument, which explains the reasons of the improvement.

Read the paper · More papers on PaperTik