Non-preemptive buffer management for latency sensitive packets
Year of publication: |
August 2017
|
---|---|
Authors: | Feldman, Moran ; Naor, Joseph |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 4, p. 337-353
|
Subject: | Latency sensitive packets | Non-preemptive buffering problems | Online algorithms | Dual fitting | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
-
Lower bounds for online makespan minimization on a small number of related machines
Jeż, Łukasz, (2013)
-
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Birks, Martin, (2013)
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
- More ...
-
Frequency capping in online advertising
Buchbinder, Niv, (2014)
-
Minimizing Service and Operation Costs of Periodic Scheduling
Bar-Noy, Amotz, (2002)
-
Homogeneous interference game in wireless networks
Naor, Joseph, (2008)
- More ...