Almut Burchard

According to our database, Almut Burchard authored at least 29 papers between 1995 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Analysis of a Queueing Model for Energy Storage Systems with Self-discharge.

Majid Raeis, Almut Burchard, Jörg Liebeherr

ACM Trans. Model. Perform. Evaluation Comput. Syst., 2020

2018

A General Per-Flow Service Curve for GPS.

Almut Burchard, Jörg Liebeherr

Proceedings of the 30th International Teletraffic Congress, 2018

2017

Analysis of the Leakage Queue: A Queueing Model for Energy Storage Systems with Self-discharge.

Majid Raeis, Almut Burchard, Jörg Liebeherr

CoRR, 2017

2016

Network-Layer Performance Analysis of Multihop Fading Channels.

Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard

IEEE/ACM Trans. Netw., 2016

Network Calculus Analysis of a Feedback System with Random Service.

Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard

Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

2015

Window Flow Control Systems with Random Service.

Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard

CoRR, 2015

2013

A (min, ×) network calculus for multi-hop fading channels.

Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012

Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic.

Jörg Liebeherr, Almut Burchard, Florin Ciucu

IEEE Trans. Inf. Theory, 2012

A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels

Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard

CoRR, 2012

2011

On superlinear scaling of network delays.

Almut Burchard, Jörg Liebeherr, Florin Ciucu

IEEE/ACM Trans. Netw., 2011

On Computing the Instability Index of a Non-Self-Adjoint Differential Operator Associated with Coating and Rimming Flows.

Almut Burchard, Marina Chugunova

SIAM J. Math. Anal., 2011

On the Impact of Link Scheduling on End-to-End Delays in Large Networks.

Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard

IEEE J. Sel. Areas Commun., 2011

Statistical Analysis of Link Scheduling on Long Paths

Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard

CoRR, 2011

The impact of link scheduling on long paths: Statistical analysis and optimal bounds.

Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic.

Jörg Liebeherr, Almut Burchard, Florin Ciucu

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Does Link Scheduling Matter on Long Paths?.

Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard

Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009

Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic

Jörg Liebeherr, Almut Burchard, Florin Ciucu

CoRR, 2009

2007

A network calculus with effective bandwidth.

Chengzhi Li, Almut Burchard, Jörg Liebeherr

IEEE/ACM Trans. Netw., 2007

On Q(H log H) Scaling of Network Delays.

Almut Burchard, Jörg Liebeherr, Florin Ciucu

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Scaling properties of statistical end-to-end bounds in the network calculus.

Florin Ciucu, Almut Burchard, Jörg Liebeherr

IEEE Trans. Inf. Theory, 2006

A Min-Plus Calculus for End-to-End Statistical Service Guarantees.

Almut Burchard, Jörg Liebeherr, Stephen D. Patek

IEEE Trans. Inf. Theory, 2006

On the Geometry of Optimal Windows, with Special Focus on the Square.

Almut Burchard, Jochen Denzler

SIAM J. Math. Anal., 2006

2005

A network service curve approach for the stochastic analysis of networks.

Florin Ciucu, Almut Burchard, Jörg Liebeherr

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

2003

Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning.

Jörg Liebeherr, Stephen D. Patek, Almut Burchard

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002

A Calculus for End-to-end Statistical Service Guarantees

Almut Burchard, Jörg Liebeherr, Stephen D. Patek

CoRR, 2002

2000

Statistical service assurances for traffic scheduling algorithms.

Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn

IEEE J. Sel. Areas Commun., 2000

Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks.

Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Scaling limits for minimal and random spanning trees in two dimensions.

Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson

Random Struct. Algorithms, 1999

1995

New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems.

Almut Burchard, Jörg Liebeherr, Yingfeng Oh, Sang Hyuk Son

IEEE Trans. Computers, 1995