Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
