90 citations · 168 across the 10 of their papers we have counts for
8 papers · 1 filter
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…
A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels
Hussein Al-Zubaidy, Jorg Liebeherr, Almut Burchard
A fundamental problem in the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the u…
Statistical Analysis of Link Scheduling on Long Paths
Yashar Ghiassi-Farrokhfal, Jorg Liebeherr, Almut Burchard
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic…
Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic
Jorg Liebeherr, Almut Burchard, Florin Ciucu
We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic…
A System Theoretic Approach to Bandwidth Estimation
Jorg Liebeherr, Markus Fidler, Shahrokh Valaee
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in…
A Calculus for End-to-end Statistical Service Guarantees
A. Burchard, J. Liebeherr, S. D. Patek
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. Th…