Abstract
A simple full-feedback-sensing window random access algorithm is proposed and analyzed. The throughput of the algorithm is 0.429; its delay and resistance to feedback channel errors are better than those induced by J.I. Capetanakis's (ibid., vol.IT-25, p.505-15, Sept. 1979) window algorithm. In addition, the simple operations of the algorithm allow for the analytical evaluation of the output-traffic interdeparture distribution. >
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.
