White Papers

A Network Calculus With Effective Bandwidth

Overview This paper presents a statistical network calculus in a setting where both arrivals and service are specified in terms of probabilistic bounds. They provide explicit bounds on delay, backlog, and output burstiness in a node or a network. By formulating well-known effective bandwidth expressions in terms of envelope functions, they are able to apply the calculus to a wide range of traffic source models, including Fractional Brownian Motion. They present probabilistic lower bounds on the service for three scheduling algorithms: Static Priority (SP), Earliest Deadline First (EDF), and Generalized Processor Sharing (GPS).

By downloading you agree to our Terms and Conditions. These include information regarding use of your personal data.

Publisher: University of Virginia
File Format: PDF
Date Published: Sep 10, 2008
Format: White Papers
Topics: GPS - GIS, Bandwidth Issues

University of Virginia White Papers

A Taxonomy for Denial-of-Service Attacks in Wireless Sensor Networks

Featured white papers

The Value of Location Intelligence in the Communications Industry

Pitney Bowes

Public Services are under pressure, the challenge is to do more with less. How do you improve citizen satisfaction, increase cost efficiencies and improve service delivery? The power of location intelligence is helping many local authorities...

Download now »
Best Practices for Translating Customer Satisfaction into Revenue

Citrix Online

Today's support organisations are focused on two top-level metrics: financial results and customer satisfaction. For most, it's easy to track financial performance, but customer satisfaction is akin to speaking a foreign language...

Download now »
HP print solutions and 3M

Hewlett-Packard (HP)

The objective for 3M was to optimize office printing infrastructure at 3M locations worldwide, reduce total cost and environmental footprint. Some of the business benefits acheived by switching to HP print solutions...

Download now »