The Effect of Per-input Shapers on the Delay Bound in Networks with Aggregate Scheduling

摘要

In order to provide modern multimedia applications with firm guarantees on quality of service (QoS) we have proposed a simplified guaranteed service. In this paper we introduce a router model with per-input shapers for the aggregate flows at the output ports. We calculate the delay bound for the guar-anteed-service traffic. The existing QoS architecture for differentiated services does not give a computable delay bound, which is essential for interactive realtime communications. We show that at the expense of some modifications to the structure of the output port of the routers it is possible to compute a finite delay bound in the case of aggregate scheduling.