Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, YDen_US
dc.contributor.authorHsu, NBen_US
dc.contributor.authorHwang, RHen_US
dc.date.accessioned2014-12-08T15:42:20Z-
dc.date.available2014-12-08T15:42:20Z-
dc.date.issued2002-06-01en_US
dc.identifier.issn0163-6804en_US
dc.identifier.urihttp://dx.doi.org/10.1109/MCOM.2002.1007409en_US
dc.identifier.urihttp://hdl.handle.net/11536/28749-
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.titleQoS routing granularity in MPLS networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/MCOM.2002.1007409en_US
dc.identifier.journalIEEE COMMUNICATIONS MAGAZINEen_US
dc.citation.volume40en_US
dc.citation.issue6en_US
dc.citation.spage58en_US
dc.citation.epage65en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.identifier.wosnumberWOS:000175932200005-
dc.citation.woscount15-
Appears in Collections:Articles


Files in This Item:

  1. 000175932200005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.