skip to main content
article
Free Access

An analysis of link level protocols for error prone links

Published:01 October 1981Publication History
Skip Abstract Section

Abstract

This paper analyzes the maximum throughput across a full duplex link, under three link level protocols. The three protocols all assume cumulative acknowledgements, but the sender's retransmission policy and the destination's policy on retaining correctly received packets which arrive before an expected retransmission do differ. The results quantify the throughput advantages in retaining all correctly received packets, for the two different retransmission policies. A retention policy on the part of the destination is most advantageous when the link is quite error-prone.

References

  1. 1 Metcalfe, R., "Packet Communication". MIT Project MAC Report MAC TR-114, Dec. 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Sunshine, C., "Interprocess Communication Protocols for Computer Networks". Stanford Electronics Laboratories Technical Report #105, Dec. 1975.Google ScholarGoogle Scholar
  3. 3 Morris, R., "Fixing Timeout Intervals for Lost Packet Detection in Computer Communication Networks". Proc. AFIPS 1979 National Comp. Conf., Vol 48, AFIPS Press, Montvale, N.J., pp.887-891, 1979.Google ScholarGoogle Scholar
  4. 4 Fayolle, G.; Gelenbe, E.; Pujolle, G., "An Analytic Evaluation of the Performance of the 'Send and Wait' Protocol". IEEE Trans. on Comm., 26, 313-319, Mar. 1978.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 Gelenbe, E.; Labetoulle, J.; Pujolle, G., "Performance Evaluation of the Protocol HDLC". Computer Networks, XX Apr. 1978.Google ScholarGoogle Scholar
  6. 6 Gelenbe, E.; Poulain, C., "Performance of Protocols in the Satellite Channel". Proceedings of the 1st International Conference on Distributed Processing, 177-184, Huntsville, AL, October 1979.Google ScholarGoogle Scholar

Index Terms

  1. An analysis of link level protocols for error prone links

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGCOMM Computer Communication Review
          ACM SIGCOMM Computer Communication Review  Volume 11, Issue 4
          October 1981
          249 pages
          ISSN:0146-4833
          DOI:10.1145/1013879
          Issue’s Table of Contents

          Copyright © 1981 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 October 1981

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader