A Delay Bound for a Network with Aggregate Scheduling

Given the increasing demand for services that can guarantee a maximum end-to-end delay in the Internet, it is important to understand the behaviour of different existing networks. We consider networks that implement scheduling per aggregate flow. We give a worst case bound that is valid for any network topology given the maximum hop count for every flow and the utilization at every link. Unfortunately, this bound is finite only for small utilization. Using the context of arrival and service curves we can improve the result for the case of a ring.


Published in:
Sixteenth UK Teletraffic Symposium on Management of Quality of Service, 5
Presented at:
Sixteenth UK Teletraffic Symposium on Management of Quality of Service, Harlow, UK
Year:
2000
Keywords:
Laboratories:




 Record created 2004-08-31, last modified 2018-03-18

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)