A 0.487 Throughput Limited Sensing Algorithm
Abstract
The authors consider Poisson packet traffic, accessing a single slotted channel. They assume the existence of ternary feedback, per channel slot. They also adopt the limited feedback sensing model, where each packet senses the feedback only while it is blocked. For the above model, they develop a collision resolution protocol, with last-come first serve characteristics, and we name the protocol, LSTFA. The LSTFA is a refinement of the algorithm developed in another document and it attains the same throughput as Gallager's algorithm does, without the full feedback sensing requirement in the latter. The algorithm is also easy to implement, it requires reasonable memory storage, it induces uniformly good transmission delays, and it is robust in the presence of feedback errors. In the presence of binary (collision versus noncollision) feedback, the algorithm may attain throughput 0.4493; the highest known to this point, among both full and limited sensing algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1985
- Accession Number
- ADA153869
Entities
People
- L. Georgiadis
- P. Papantoni-kazakos
Organizations
- University of Connecticut