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 the normal view instead:
scientific article; zbMATH DE number 622034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events |
scientific article; zbMATH DE number 622034 |
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
0.7940901517868042
0 references
0.7916342616081238
0 references
0.7742812633514404
0 references
0.773822546005249
0 references
0.7736232280731201
0 references
