Computer Science – Information Theory

Scientific paper

[
0.00
] – not rated yet
Voters
0
Comments 0

2005-07-03

IWQoS 2006

Computer Science

Information Theory

Scientific paper

Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.

No associations

LandOfFree

If you have personal experience with

An End-to-End Probabilistic Network Calculus with Moment Generating Functionsdoes not yet have a rating. At this time, there are no reviews or comments for this scientific paper.An End-to-End Probabilistic Network Calculus with Moment Generating Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An End-to-End Probabilistic Network Calculus with Moment Generating Functions will most certainly appreciate the feedback.

Profile ID: LFWR-SCP-O-467320

Use Google custom search:

All data on this website is collected from public sources.
Our data reflects the most accurate information available at the time of publication.