Optimal Traffic Shaping with Deterministic Guarantees Using GPS Scheduling

  • Authors:
  • Enrique Hernández-Orallo;Joan Vila i carbó;Sergio Saez;Silvia Terrasa

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The transmission of video over a high-speed network implies guaranteeing a Quality of Service (QoS). This transmission requires a very demanding reservation of network resources, so optimisation becomes a key issue. Traffic shaping has been proposed as a means for improving network utilisation. This paper introduces a fast and bounded method to obtain the leaky bucket shaper parameters that optimises network reservations (bandwidth and buffers) with deterministic guarantees using GPS scheduling. The algorithm presented finds the optimal solution in 5 or 6 iterations. Another important contribution of this paper is comparing this new admission scheme with different EDF control admission tests. Results show that although GPS is a little less efficient than the optimal EDF scheduler for one node (as expected), it is as efficient as the best RC-EDF known policies for several nodes, or even better when the number of network hops is high.