An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532)
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 7429290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for 2-bounded delay buffer management with lookahead |
scientific article; zbMATH DE number 7429290 |
Statements
An optimal algorithm for 2-bounded delay buffer management with lookahead (English)
0 references
18 November 2021
0 references
online buffer management
0 references
competitive analysis
0 references
scheduling algorithm
0 references
lookahead
0 references
quality of service
0 references
0 references
0 references
0 references
0.9962817430496216
0 references
0.8635915517807007
0 references
0.8602858781814575
0 references
0.8393805623054504
0 references
0.8352960348129272
0 references
