A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints.
Abstract
We consider the Channel Multiple-Access problem for messages with strict delay constraints. The constraints are represented by an upper bound on the transmission delays. For this problem, and for binary collision-noncollision feedback per slot, we present a simple full sensing window Random-Access algorithms. We analyze the algorithm and we compute the fraction of maintained traffic and the expected per successfully transmitted packet delay, for various input Poisson intensities and various values of the bound on the transmission delays. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1987
- Accession Number
- ADA176913
Entities
People
- L. Georgiadis
- M. Paterakis
- P. Papantoni-kazakos
Organizations
- University of Virginia