A full sensing window Random-Access algorithm for messages with strict delay constraints
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1) , 313-328
- https://doi.org/10.1007/bf01553894
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Relation Between the Finite and the Infinite Population Models for a Class of RAA'sIEEE Transactions on Communications, 1987
- A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is RegenerativeIEEE Journal on Selected Areas in Communications, 1987
- A 0.487 throughput limited sensing algorithmIEEE Transactions on Information Theory, 1987
- On the Throughput of Channel Access Algorithms with Limited SensingIEEE Transactions on Communications, 1986
- Multiple-access protocols and time-constrained communicationACM Computing Surveys, 1984
- Packet-voice communication on an ethernet local computer networkPublished by Association for Computing Machinery (ACM) ,1983
- Controlling window protocols for time-constrained communication in a multiple access environmentPublished by Association for Computing Machinery (ACM) ,1983
- Performance of CSMA/CD Networks Under Combined Voice and Data LoadsIEEE Transactions on Communications, 1982
- Collision-Resolution Algorithms and Random-Access CommunicationsPublished by Springer Nature ,1981