Granularity of QoS routing in MPLS networks

Ying-Dar Lin, Nai Bin Hsu, Ren Hung Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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 finegrained 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 label-forwarded with a bounded cache.

Original languageEnglish
Title of host publicationQuality of Service - IWQoS 2001 - 9th International Workshop, Proceedings
EditorsLars Wolf, David Hutchison, Ralf Steinmetz
PublisherSpringer Verlag
Number of pages15
ISBN (Electronic)9783540422174
StatePublished - 2001
Event9th International Workshop on Quality of Service, IWQoS 2001 - Karlsruhe, Germany
Duration: 6 Jun 20018 Jun 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Workshop on Quality of Service, IWQoS 2001


Dive into the research topics of 'Granularity of QoS routing in MPLS networks'. Together they form a unique fingerprint.

Cite this