Loading...
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.
Loading...
Name
IC_TECH_REPORT_200002.pdf
Access type
openaccess
Size
154.62 KB
Format
Adobe PDF
Checksum (MD5)
b1e9239157fee9307f152256888f2367