Almut Burchard

Publication Activity (10 Years)

Years Active: 1995-2020
Publications (10 Years): 6

Top Topics

Fading Channels

Top Venues

IEEE Trans. Inf. Theory

IEEE/ACM Trans. Netw.

Publications

Majid Raeis, Almut Burchard, Jörg Liebeherr
Analysis of a Queueing Model for Energy Storage Systems with Self-discharge. ACM Trans. Model. Perform. Evaluation Comput. Syst. 5 (3) (2020)
Almut Burchard, Jörg Liebeherr
A General Per-Flow Service Curve for GPS. ITC (2) (2018)
Almut Burchard, Jörg Liebeherr
A General Per-Flow Service Curve for GPS. CoRR (2018)
Majid Raeis, Almut Burchard, Jörg Liebeherr
Analysis of the Leakage Queue: A Queueing Model for Energy Storage Systems with Self-discharge. CoRR (2017)
Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard
Network-Layer Performance Analysis of Multihop Fading Channels. IEEE/ACM Trans. Netw. 24 (1) (2016)
Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard
Network Calculus Analysis of a Feedback System with Random Service. SIGMETRICS (2016)
Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard
Window Flow Control Systems with Random Service. CoRR (2015)
Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard
A (min, ×) network calculus for multi-hop fading channels. INFOCOM (2013)
Jörg Liebeherr, Almut Burchard, Florin Ciucu
Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic. IEEE Trans. Inf. Theory 58 (2) (2012)
Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard
A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels CoRR (2012)
Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard
The impact of link scheduling on long paths: Statistical analysis and optimal bounds. INFOCOM (2011)
Almut Burchard, Jörg Liebeherr, Florin Ciucu
On superlinear scaling of network delays. IEEE/ACM Trans. Netw. 19 (4) (2011)
Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard
Statistical Analysis of Link Scheduling on Long Paths CoRR (2011)
Almut Burchard, Marina Chugunova
On Computing the Instability Index of a Non-Self-Adjoint Differential Operator Associated with Coating and Rimming Flows. SIAM J. Math. Anal. 43 (1) (2011)
Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard
On the Impact of Link Scheduling on End-to-End Delays in Large Networks. IEEE J. Sel. Areas Commun. 29 (5) (2011)
Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard
Does Link Scheduling Matter on Long Paths?. ICDCS (2010)
Jörg Liebeherr, Almut Burchard, Florin Ciucu
Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic. INFOCOM (2010)
Jörg Liebeherr, Almut Burchard, Florin Ciucu
Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic CoRR (2009)
Chengzhi Li, Almut Burchard, Jörg Liebeherr
A network calculus with effective bandwidth. IEEE/ACM Trans. Netw. 15 (6) (2007)
Almut Burchard, Jörg Liebeherr, Florin Ciucu
On Q(H log H) Scaling of Network Delays. INFOCOM (2007)
Almut Burchard, Jochen Denzler
On the Geometry of Optimal Windows, with Special Focus on the Square. SIAM J. Math. Anal. 37 (6) (2006)
Almut Burchard, Jörg Liebeherr, Stephen D. Patek
A Min-Plus Calculus for End-to-End Statistical Service Guarantees. IEEE Trans. Inf. Theory 52 (9) (2006)
Florin Ciucu, Almut Burchard, Jörg Liebeherr
Scaling properties of statistical end-to-end bounds in the network calculus. IEEE Trans. Inf. Theory 52 (6) (2006)
Florin Ciucu, Almut Burchard, Jörg Liebeherr
A network service curve approach for the stochastic analysis of networks. SIGMETRICS (2005)
Jörg Liebeherr, Stephen D. Patek, Almut Burchard
Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning. INFOCOM (2003)
Almut Burchard, Jörg Liebeherr, Stephen D. Patek
A Calculus for End-to-end Statistical Service Guarantees CoRR (2002)
Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks. INFOCOM (2000)
Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn
Statistical service assurances for traffic scheduling algorithms. IEEE J. Sel. Areas Commun. 18 (12) (2000)
Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson
Scaling limits for minimal and random spanning trees in two dimensions. Random Struct. Algorithms 15 (3-4) (1999)
Almut Burchard, Jörg Liebeherr, Yingfeng Oh, Sang Hyuk Son
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems. IEEE Trans. Computers 44 (12) (1995)