Throughput Analysis for Persistent CSMA Systems

DOI10.1109/TCOM.1985.1096355zbMath0568.94001OpenAlexW2159320215MaRDI QIDQ3686605

Leonard Kleinrock, Hideaki Takagi

Publication date: 1985

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1985.1096355

zbMATH Keywords

collision detectioninfinite populationrandom access protocolschannel throughputpacket communication systemsslotted persistent carrier sense multiple accessunslotted persistent CSMA

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05)

Related Items (4)

Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs ⋮ A mean value analysis of the Ethernet troughput ⋮ Gated polling with stationary ergodic walking times, Markovian routing and random feedback ⋮ Evaluating Complex MAC Protocols for Sensor Networks with APMC

This page was built for publication: Throughput Analysis for Persistent CSMA Systems