Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Nimrod Megiddo
Journal of Symbolic Computation
Minghong Fang, Zifan Zhang, et al.
CCS 2024