Capacity requirements of traffic handling schemes in multi-service networks

Abstract

This paper deals with the impact of traffic handling mechanisms on capacity for different network architectures. Three traffic handling models are considered: per-flow, class-based and best-effort (BE). These models can be used to meet service guarantees, the major differences being in their complexity of implementations and in the quantity of network resources that must be provided. In this study, the performance is fixed and the required capacity determined for various combinations of traffic handling architectures for edge-core networks. This study provides a comparison of different QoS architectures. One key result of this work is that on the basis of capacity requirements, there is no significant difference between semi-aggregate traffic handling and per-flow traffic handling. However, best-effort handling requires significantly more capacity as compared to the other methods. © 2004 Elsevier B.V. All rights reserved