Publication
Algorithmica
Paper

A full sensing window Random-Access algorithm for messages with strict delay constraints

View publication

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 algorithm. We analyze the algorithm and we compute the fraction of maintained traffic and the expected delay for the successfully transmitted packet, for various input Poisson intensities and various values of the bound on the transmission delays. © 1989 Springer-Verlag New York Inc.

Date

Publication

Algorithmica

Share