Transactions Papers Bounds on the Delay Distribution of Window Random-Access Algorithms

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 in the computation of the delay distribution can be related to the solution of appropriate infinite systems of linear equations. Once the constants and the coefficients of the unknowns of the 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 window random-access algorithm and the part-and-try algorithm, both under binary feedback. © 1993 IEEE.