ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Token Bucket Rate Limiting Algoritmen×Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)×
FagområdeTelekommunikationTelekommunikation
FamilieProcess / pipelineProcess / pipeline
Oprindelsesår19861990
OphavspersonJon TurnerPhil Karn
Typerate limiting algorithmrandom access protocol
Oprindelig kildeTurner, J. S. (1986). New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24(10), 8-15. link ↗Karn, P. (1990). MACA—a new channel access method for packet radio. In Proceedings of the ARRL/CRRL Amateur Radio 9th Computer Networking Conference, 134-140. link ↗
Aliassertraffic shaping, rate limitingmedium access control, WiFi MAC
Relaterede23
ResuméToken bucket is a simple and elegant algorithm for traffic shaping and rate limiting. A virtual bucket accumulates tokens at a fixed rate (the committed information rate). Incoming packets consume tokens (one token per byte); packets are transmitted only if sufficient tokens are available. If the bucket is full, excess tokens are discarded (no carry-over). Token bucket bounds peak rate and allows controlled bursts, making it ideal for traffic management in networks.CSMA/CA is a random access protocol for wireless medium access control, designed to enable multiple devices to share a wireless channel while minimizing collisions. Introduced by Phil Karn in 1990, it is the foundation of WiFi (IEEE 802.11) and is now the de facto standard for unlicensed spectrum access. CSMA/CA combines carrier sensing (listen before transmit) with collision avoidance (RTS/CTS handshake) to improve channel efficiency and fairness, avoiding the efficiency loss of pure random access (Aloha).
ScholarGateDatasæt
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: Token Bucket · CSMA/CA. Hentet 2026-06-17 fra https://scholargate.app/da/compare