A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events (Q1331296)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events |
scientific article |
Statements
A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events (English)
0 references
21 August 1994
0 references
Capetanakis-type tree algorithm
0 references
synchronous random-access protocols
0 references
variable size packets
0 references
0 references
0 references
