QoS routing granularity in MPLS networks
QoS routing granularity in MPLS networks
复制标题
MPLS 网络中的 QoS 路由粒度
DOI：
10.1109/mcom.2002.1007409
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Ren
中科院分区：
文献类型：
--
作者：
Ying;N. Hsu;Ren
本文研究了基于约束的路由决策粒度对MPLS网络中QoS路由的可扩展性和阻塞性能的影响。粗粒度（如每个目的地）具有较低的存储和计算开销，但仅适用于尽力而为流量。另一方面，细粒度，如每流，提供较低的阻塞概率的带宽请求，但需要大量的状态和高计算成本。为了实现具有成本效益的可扩展性，本研究提出使用混合粒度方案。每对/流的溢出缓存机制增加了一个每对缓存和一个每流缓存作为路由缓存，并在阻塞概率方面有较好的表现。每对/类方案使用路由标记将流分组到几个路径中，从而允许数据包使用有界缓存进行标签转发。
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.