Sink tree-based bandwidth allocation for scalable QoS flow set-up
Document Type
Conference Proceeding
Publication Date
2006
Department
Department of Computer Science
Abstract
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up within this architecture has not been well established. In this paper we explore the possibility of a scalable QoS flow set-up using a sink-tree paradigm. The paradigm constructs a sink tree at each egress edge router using network topology and bandwidth information provided by a QoS extended version of Open Shortest Path First (OSPF). Simulation results are very encouraging in that our methodology requires significantly less communication overhead in setting up QoS flows compared to the traditional per-flow signaling-based methodology while still maintaining high resource utilization.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-540-48563-6
Recommended Citation
Lembke, J.,
&
Choi, B. K.
(2006).
Sink tree-based bandwidth allocation for scalable QoS flow set-up.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
3961 LNCS, 521-531.
http://doi.org/10.1007/11919568_52
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4003