A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback (Q1120993)
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 unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback |
scientific article; zbMATH DE number 4102468
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback |
scientific article; zbMATH DE number 4102468 |
Statements
A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback (English)
0 references
1989
0 references
unified minimum-search method
0 references
multiaccess networks
0 references
window protocol
0 references
adaptive-tree-polling protocols
0 references
urn protocols
0 references
priority-access protocols
0 references
arrival-time-window protocols
0 references
virtual-window protocol
0 references
0 references
0.8504192
0 references
0.8504192
0 references
0.8446567
0 references
0 references
0.8419023
0 references
0.8413631
0 references
0.83952504
0 references
