Name
Abstract | ||
|---|---|---|
We study the online bounded-delay packet scheduling problem (PacketScheduling), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the literature; yet currently the best published upper bound is 1.828 [8], still quite far from the best lower bound of ϕ≈1.618 [11], [2], [6]. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.tcs.2019.01.013 | Theoretical Computer Science |
Keywords | DocType | Volume |
Buffer management,Online scheduling,Online algorithm,Lookahead | Conference | 776 |
ISSN | Citations | PageRank |
0304-3975 | 1 | 0.36 |
References | Authors | |
8 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Böhm | 1 | 29 | 6.65 |
| Marek Chrobak | 2 | 1665 | 151.84 |
| Lukasz Jez | 3 | 61 | 11.93 |
| Fei Li | 4 | 43 | 9.37 |
| jir sgall | 5 | 199 | 22.48 |
| Pavel Veselý | 6 | 30 | 9.05 |