Waiting time and queue length distributions for go-back-N and selective-repeat ARQ protocols

Abstract

The paper provides a performance analysis of automatic-repeat-request (ARQ) protocols in connection-oriented transmission. Each message arriving at a transmitter is divided into several packets, which are continuously transmitted to a receiver according to go-back-N ARQ or selective-repeat ARQ protocols. Because of connection-oriented transmission, messages are served on a first come first served basis, i.e., transmission of a message is commenced after all packets in the previous message are successfully transmitted. For the two ARQ protocols, the authors derive the probability generating functions of message waiting time and queue length at an arbitrary instant, from which the average performance measures are explicitly obtained.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 24 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.