Skip to main content
Article thumbnail
Location of Repository

Statistical service assurances for traffic scheduling algorithms

By Robert Boorstyn, Almut Burchard, Jörg Liebeherr and Chaiwat Oottamakorn

Abstract

Network services for the most demanding advanced networked applications which require absolute, per-flow service assurances can be deterministic or statistical. By exploiting statistical properties of traffic, statistical assurances can extract more capacity from a network than deterministic assurances. In this work we consider statistical service assurances for traffic scheduling algorithms. We present functions, so-called effective envelopes, which are, with high certainty, upper bounds of multiplexed traffic. Effective envelopes can be used to obtain bounds on the amount of traffic on a link that can be provisioned with statistical service assurances. We show that our bounds can be applied to a variety of packet scheduling algorithms. In fact, one can reuse existing admission control functions for scheduling algorithms with deterministic assurances. We present numerical examples which compare the number of ows with statistical assurances that can be admitted with our effective envelope approach to those achieved with existing methods

Topics: Key Words, Internet, Tra c control (communication, Packet switching, Statistical Multiplexing, Statistical Service, Scheduling, Quality-of-Service
Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9858
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.comm.utoronto.ca/~j... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.