An Access Algorithm for a Communication Channel

A multiple-access system with a finite number of stations is examined. The stations of the system are numbered, and their number is assumed to be known. An efficient access algorithm which allows for conflicts and ensures their resolution with the aid of the station numbers is proposed. The average packet delay at a station with a given number is analyzed. It is shown that the delay is smaller than that of a random-multiple-access stack algorithm.