Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
On Reducing the Processing Cost of On-Demand QoS Path Computation
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Efficient dynamic routing in wide-area networks
Efficient dynamic routing in wide-area networks
Empirical study of traffic trunking in Linux-based MPLS test-bed
International Journal of Network Management
| Hi-index | 0.00 |
This study investigates how the Constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in MPLS network. The coarse-grained granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best-effort traffic. On the other hand, the fine-grained 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 with a reasonable overflow ratio of 10% as offered load=0.7. Per-pair/class scheme groups the flows into several paths using routing marks, thus allowing packets to be labelforwarded with a bounded cache.