Infoscience

Report

A Proven Delay Bound for a Network with Aggregate Scheduling

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and the utilization at every link.

    Reference

    • LCA-REPORT-2000-015

    Record created on 2005-07-13, modified on 2016-08-08

Related material