The complexity of deciding stability under FFS in the adversarial queueing model (Q2390263)
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: The complexity of deciding stability under FFS in the adversarial queueing model |
scientific article; zbMATH DE number 5581136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of deciding stability under FFS in the adversarial queueing model |
scientific article; zbMATH DE number 5581136 |
Statements
The complexity of deciding stability under FFS in the adversarial queueing model (English)
0 references
21 July 2009
0 references
graph algorithms
0 references
packet-switched interconnection networks
0 references
interconnection networks
0 references
adversarial queueing theory
0 references
greedy scheduling protocols
0 references
network stability
0 references
0 references
0.8686515092849731
0 references
0.830430805683136
0 references
0.830430805683136
0 references
0.8226459622383118
0 references
0.8207553029060364
0 references
