Abstract
This paper considers the framed ALOHA protocol for a finite number of terminals. Terminals are single-buffered, i.e. each one can store only one packet. We derive the throughput and the delay under two types of queue disciplines, first-in-first-out (FIFO) and last-in-first-out LIFO. It is assumed that terminals are independent each other and generate packets of constant size according to a Bernoulli process. The one slot duration equals to the one packet transmission. The analysis is carried out by means of Markovian tools. Some discussion on the applicability of that protocol is addressed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.