90 citations · 168 across the 10 of their papers we have counts for
12 papers
A Round-Robin Packet Scheduler for Hierarchical Max-Min Fairness
Natchanon Luangsomboon, Jörg Liebeherr
Hierarchical link sharing addresses the demand for fine-grain traffic control at multiple levels of aggregation. At present, packet schedulers that can support hierarchical link sh…
A General Per-Flow Service Curve for GPS
Almut Burchard, Jorg Liebeherr
Generalized Processor Sharing (GPS), which provides the theoretical underpinnings for fair packet scheduling algorithms, has been studied extensively. However, a tight formulation…
A Fluid-Flow Interpretation of SCED Scheduling
Jorg Liebeherr
We show that a fluid-flow interpretation of Service Curve Earliest Deadline First (SCED) scheduling simplifies deadline derivations for this scheduler. By exploiting the recently r…
Analysis of the Leakage Queue: A Queueing Model for Energy Storage Systems with Self-discharge
Majid Raeis, Almut Burchard, Jorg Liebeherr
Energy storage is a crucial component of the smart grid, since it provides the ability to buffer transient fluctuations of the energy supply from renewable sources. Even without a…
Window Flow Control Systems with Random Service
Alireza Shekaramiz, Jorg Liebeherr, Almut Burchard
We present an extension of the window flow control analysis by R. Agrawal et.al. (Reference [1]), C.-S. Chang (Reference [6]), and C.-S. Chang et. al. (Reference [8]) to a system w…
Network calculus for parallel processing
G. Kesidis, B. Urgaonkar, Y. Shan +2
In this note, we present preliminary results on the use of "network calculus" for parallel processing systems, specifically MapReduce.