Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models

  • Authors:
  • Hui Zhang;Edward W. Knightly

  • Affiliations:
  • Lawrence Berkeley Laboratory, MailStop: 50B-229, Berkeley, CA;University of California at Berkeley and Sandia National Laboratories

  • Venue:
  • SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1994

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper demonstrates a new, efficient, and general approach for providing end-to-end performance guarantees in integrated services networks. This is achieved by modeling a traffic source with a family of bounding interval-dependent (BIND) random variables and by using a rate-controlled service discipline inside the network. The traffic model stochastically bounds the number of bits sent over time intervals of different length. The model captures different source behavior over different time scales by making the bounding distribution an explicit function of the interval length. The service discipline, RCSP, has the priority queueing mechanisms necessary to provide performance guarantees in integrated services networks. In addition, RCSP provides the means for efficiently extending the results from a single switch to a network of arbitrary topology. These techniques are derived analytically and then demonstrated with numerical examples.