Abstract
Purchase PDF (424 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (512 K)
doi:10.1016/j.comcom.2004.07.035 
Copyright © 2004 Elsevier B.V. All rights reserved.
Capacity requirements of traffic handling schemes in multi-service networks
Received 29 July 2004;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Keywords: Network engineering; Internet QoS; Multimedia networking; Network capacity planning
Article Outline
- 1. Introduction
- 2. Edge-core network capacity analysis using network calculus
- 2.1. Framework
- 2.2. End-to-end delay
- 2.3. Comparison of capacity requirements
- 3. Analysis
- 4. Results
- 4.1. Topology construction
- 4.2. Capacity requirements with symmetric traffic distribution
- 4.3. Effect of projections on traffic growth
- 4.4. Effect of delay ratios
- 5. Conclusion
- References
- Vitae
