DocumentCode
3433620
Title
Work-Conserving Fair-Aggregation Across Multiple Core Networks
Author
Cobb, Jorge A. ; Xu, Zhe
Author_Institution
Texas Univ. at Dallas, Richardson
fYear
2007
fDate
13-16 Aug. 2007
Firstpage
932
Lastpage
938
Abstract
In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, flow aggregation outperforms dynamic packet state by providing better end-to-end delay guarantee. Work-conserving flow aggregation (WCFA) has the advantage of gaining work-conserving property at the cost of an extra per-hop delay. Most research on work-conserving flow aggregation so far has focused on a single level of flow aggregation within a single aggregation domain. In this paper, we investigate the per-hop behavior of flow aggregation over multiple aggregation domains. Moreover, in each aggregation domain, multiple aggregation levels are considered. We show that the aggregating cost happens only once in each aggregation domain over all aggregation levels, and higher level of flow aggregation provides lower per-hop delay guarantee.
Keywords
Internet; quality of service; telecommunication network routing; Internet; QoS scheduler; multiple core networks; per-hop delay behavior; work-conserving flow aggregation; Aggregates; Clocks; Costs; Delay; Diffserv networks; Dynamic scheduling; Quality of service; Scheduling algorithm; Video on demand; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on
Conference_Location
Honolulu, HI
ISSN
1095-2055
Print_ISBN
978-1-4244-1251-8
Electronic_ISBN
1095-2055
Type
conf
DOI
10.1109/ICCCN.2007.4317937
Filename
4317937
Link To Document