#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1977

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

#### Organism

Learn More

- Almut Burchard, JÃ¶rg Liebeherr, Yingfeng Oh, Sang Hyuk Son
- IEEE Trans. Computers
- 1995

Optimal scheduling of real-time tasks on multiprocessor systems is known to be computationally intractable for large task sets. Any practical scheduling algorithm for assigning realtime tasks to aâ€¦ (More)

- Chengzhi Li, Almut Burchard, JÃ¶rg Liebeherr
- IEEE/ACM Transactions on Networking
- 2007

This paper establishes a link between two principal tools for the analysis of network traffic, namely, effective bandwidth and network calculus. It is shown that a general version of effectiveâ€¦ (More)

- Florin Ciucu, Almut Burchard, JÃ¶rg Liebeherr
- IEEE Transactions on Information Theory
- 2006

The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochasticâ€¦ (More)

- Robert Boorstyn, Almut Burchard, JÃ¶rg Liebeherr, Chaiwat Oottamakorn
- IEEE Journal on Selected Areas in Communications
- 2000

Network services for the most demanding advanced networked applications which require absolute, per-flow service assurances can be deterministic or statistical. By exploiting the statisticalâ€¦ (More)

- Almut Burchard, JÃ¶rg Liebeherr, Stephen D. Patek
- ArXiv
- 2001

The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. This paper addressesâ€¦ (More)

- Florin Ciucu, Almut Burchard, JÃ¶rg Liebeherr
- SIGMETRICS
- 2005

The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochasticâ€¦ (More)

- Almut Burchard, JÃ¶rg Liebeherr, Stephen D. Patek
- IEEE Transactions on Information Theory
- 2006

The network calculus offers an elegant framework for determining worst-case bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework withâ€¦ (More)

- JÃ¶rg Liebeherr, Stephen D. Patek, Almut Burchard
- INFOCOM
- 2003

Scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determinesâ€¦ (More)

- Almut Burchard, Michael SchmuckenschlÃ¤gery
- 2000

We compare the exit time of Brownian motion from a subset of a smooth complete Riemannian manifold with the exit time from a geodesic disc in a manifold of constant curvature.

- Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson
- Random Struct. Algorithms
- 1999

A general formulation is presented for continuum scaling limits of stochastic spanning trees. Tightness of the distribution, as Î´ â†’ 0, is established for the following twodimensional examples: theâ€¦ (More)