Bounds on the delay distribution of window random-access algorithms

DOI10.1109/26.225484zbMath0800.94023OpenAlexW1983077445MaRDI QIDQ4273265

Michael Paterakis, Leonidas Georgiadis

Publication date: 2 January 1994

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.225484

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (1)

A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events

This page was built for publication: Bounds on the delay distribution of window random-access algorithms