Multiple-access algorithms for a system with mixed traffic: high and low priority
- 1 March 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 40 (3) , 541-555
- https://doi.org/10.1109/26.135724
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A multiuser random-access communication system for users with different prioritiesIEEE Transactions on Communications, 1991
- A full sensing window Random-Access algorithm for messages with strict delay constraintsAlgorithmica, 1989
- A simple window random access algorithm with advantageous propertiesIEEE Transactions on Information Theory, 1989
- 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
- Generalized TDMA: The Multi-Accessing Tree ProtocolIEEE Transactions on Communications, 1979
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979