標題: QoS routing granularity in MPLS networks
作者: Lin, YD
Hsu, NB
Hwang, RH
交大名義發表
National Chiao Tung University
公開日期: 1-六月-2002
摘要: This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in an MPLS network. Coarse granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best effort traffic. On the other hand, fine granularity, such as per-flow, provides lower blocking probability for bandwidth requests, but requires a huge number of states and high computational cost. To achieve cost-effective scalability, this study proposes using hybrid granularity schemes. The overflowed cache of the per-pair/flow scheme adds a per-pair cache and a per-flow cache as the routing cache, and performs well in blocking probability. The per-pair/class scheme groups the flows into several paths using routing marks, thus allowing packets to be label-forwarded with a bounded cache.
URI: http://dx.doi.org/10.1109/MCOM.2002.1007409
http://hdl.handle.net/11536/28749
ISSN: 0163-6804
DOI: 10.1109/MCOM.2002.1007409
期刊: IEEE COMMUNICATIONS MAGAZINE
Volume: 40
Issue: 6
起始頁: 58
結束頁: 65
顯示於類別:期刊論文


文件中的檔案:

  1. 000175932200005.pdf