STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q967036 |
Changed an Item |
||
| Property / author | |||
| Property / author: Chris Blondia / rank | |||
Normal rank | |||
Revision as of 17:38, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN |
scientific article |
Statements
STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (English)
0 references
10 October 2001
0 references
binary stack algorithm
0 references
random multiple access communication
0 references
Markov chains
0 references
