Abstract

The maximum achievable throughput and the steady-state throughput of the Butterfly networks are investigated and compared in the context of three types of automatic repeat request (ARQ) schemes of, namely, the stop-and-wait ARQ (SW-ARQ), go-back-N ARQ (GBN-ARQ) and the selective-repeat ARQ (SR-ARQ). Our studies show that, at a given packet error rate (PER), the SW-ARQ scheme yields the lowest throughput while the SR-ARQ scheme can attain the highest throughput, among the three ARQ schemes considered. At a very low PER, the GBN-ARQ may achieve a similar throughput as the SR-ARQ. However, as the PER increases, the throughput achieved by the GBN-ARQ converges to that of the SW-ARQ.

Full Text
Paper version not known

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 call

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.