DocumentCode
2697787
Title
Rate-independent delay across state-reduced networks
Author
Cobb, Jorge A.
Author_Institution
Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
fYear
2009
fDate
20-23 Oct. 2009
Firstpage
577
Lastpage
584
Abstract
Two techniques have been proposed in the literature to improve the scalability of QoS scheduling in the core of the Internet: flow aggregation and dynamic packet scheduling (DPS). These techniques reduce or eliminate the amount of state maintained by each router in a core network. Flow aggregation combines multiple individual flows into a single aggregate flow (and thus reducing the per-flow state of the routers), while DPS stores in the packet header all the information required to compute the deadline of the packet at each intermediate router (and thus maintains no per-flow state).
Keywords
Internet; protocols; telecommunication network routing; Internet; QoS scheduling; dynamic packet scheduling; rate-independent delay; scheduling protocols; state-reduced networks; work-conserving flow-aggregation method; Aggregates; Computer networks; Delay; Dynamic scheduling; Processor scheduling; Protocols; Quality of service; Scalability; Video on demand; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on
Conference_Location
Zurich
Print_ISBN
978-1-4244-4488-5
Electronic_ISBN
978-1-4244-4487-8
Type
conf
DOI
10.1109/LCN.2009.5355194
Filename
5355194
Link To Document