Heavy-traffic universality of redundancy systems with assignment constraints (Q6598916)
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: Heavy-traffic universality of redundancy systems with assignment constraints |
scientific article; zbMATH DE number 7907213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heavy-traffic universality of redundancy systems with assignment constraints |
scientific article; zbMATH DE number 7907213 |
Statements
Heavy-traffic universality of redundancy systems with assignment constraints (English)
0 references
5 September 2024
0 references
assignment constraints
0 references
heterogeneity
0 references
parallel-server systems
0 references
load balancing
0 references
redundancy scheduling
0 references
heavy-traffic limit
0 references
state space collapse
0 references
resource pooling
0 references
0.7679258584976196
0 references
0.754601776599884
0 references
0.7416108846664429
0 references
0.7382357716560364
0 references
