High Performance Asynchronous Limited Sensing Algorithms for CSMA and CSMA-CD Channels.
Abstract
We consider the random multiple access of a collision-type, packet-switched channel, for the Poisson user model in a local area network environment, where 'carrier sensing' techniques are possible due to small propagation delays. We propose and analyze asynchronous (unslotted) random access algorithms that belong to a recently emerged class of random-access algorithms, called 'limited channel sensing' algorithms. Utilizing the regenerative character of the stochastic processes that are associated with the random access system, we derive lower bounds on the maximum stable throughput, and tight upper and lower bounds on the induced mean packet delay. The proposed algorithms are inherently stable, they combine good performance with modest channel sensing requirements, and they outperform their synchronous counterparts in some Ethernet and mobile radio environments.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1985
- Accession Number
- ADA153919
Entities
People
- L. Merakos
- M. Georgiopoulos
- P. Papantoni-kazakos
Organizations
- University of Connecticut