Performance analysis of window type random-access algorithms for packet radio networks

A method for delay distribution analysis of window random-access algorithms is presented. The window size is allowed to vary during the operation of the algorithm. It is shown that the quantities of interest can be obtained from the solution of appropriate infinite systems of linear equations. Once the constants and the coefficients of the unknowns of a system are determined, bounds on the solution can be developed by applying previously developed methodologies. The method is applied to the delay distribution analysis of the Capetanakis's window random-access algorithm and the part-and-try algorithm, both under binary C-NC feedback.<
>