Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

Published: 01 March 1987 Publication History

Abstract

When several users simultaneously transmit over a shared communication channel, the messages are lost and must be retransmitted later. Various protocols specifying when to retransmit have been proposed and studied in recent years. One protocol is "binary exponential back-off," used in the local area network Ethernet. A mathematical model with several idealizations (discrete time slots, infinite users, no deletions) is shown to be unstable in that the asymptotic rate of successful transmissions is zero, however small the arrival rate.

Cited By

View all
  • (2024)Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention ResolutionProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662807(231-242)Online publication date: 17-Jun-2024
  • (2023)Probabilistic Modeling of the Behavior of a Computing Node in the Absence of Tasks on the Project ServerSupercomputing10.1007/978-3-031-49435-2_5(62-76)Online publication date: 25-Sep-2023
  • (2022)Robust and Optimal Contention Resolution without Collision DetectionProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538592(107-118)Online publication date: 11-Jul-2022
  • Show More Cited By

Index Terms

  1. Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image IEEE Transactions on Information Theory
      IEEE Transactions on Information Theory  Volume 33, Issue 2
      March 1987
      125 pages

      Publisher

      IEEE Press

      Publication History

      Published: 01 March 1987

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 05 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention ResolutionProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662807(231-242)Online publication date: 17-Jun-2024
      • (2023)Probabilistic Modeling of the Behavior of a Computing Node in the Absence of Tasks on the Project ServerSupercomputing10.1007/978-3-031-49435-2_5(62-76)Online publication date: 25-Sep-2023
      • (2022)Robust and Optimal Contention Resolution without Collision DetectionProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538592(107-118)Online publication date: 11-Jul-2022
      • (2022)Contention Resolution for Coded Radio NetworksProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538573(119-130)Online publication date: 11-Jul-2022
      • (2021)Tight Trade-off in Contention Resolution without Collision DetectionProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467920(139-149)Online publication date: 21-Jul-2021
      • (2021)Optimal Protocols for 2-Party Contention ResolutionStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_30(456-468)Online publication date: 17-Nov-2021
      • (2020)Contention resolution without collision detectionProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384305(105-118)Online publication date: 22-Jun-2020
      • (2019)Stability of Wireless Random Access Systems2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919898(1190-1197)Online publication date: 24-Sep-2019
      • (2018)Scaling Exponential BackoffJournal of the ACM10.1145/327676966:1(1-33)Online publication date: 12-Dec-2018
      • (2016)How to scale exponential backoffProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884482(636-654)Online publication date: 10-Jan-2016
      • Show More Cited By

      View Options

      View options

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media