BOUNDS ON THE DELAY DISTRIBUTION OF WINDOW RANDOM-ACCESS ALGORITHMS

A method for delay distribution analysis of window random-access algor ithms is presented. The window size is allowed to vary during the oper ation of the algorithm. It is shown that the quantities of interest in the computation of the delay distribution can be related to the solut ion of appropriate infinite systems of linear equations. Once the cons tants and the coefficients of the unknowns of the system are determine d, bounds on the solution can be developed by applying previously deve loped methodologies. The method is applied to the delay distribution a nalysis of the Capetanakis window random-access algorithm and the part -and-try algorithm, both under binary feedback.