Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Capacity requirements of traffic handling schemes in multi-service networks
 

Summary: Capacity requirements of traffic handling schemes
in multi-service networks
Towela P.R. Nyirenda-Jerea
, Victor S. Frosta,*, Nail Akarb
a
Department of Electrical Engineering and Computer Science, Information and Telecommunication Technology Center, University of Kansas,
2335 Irving Hill Road, Lawrence, KS 66045-7612, USA
b
Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey
Received 29 July 2004; accepted 29 July 2004
Available online 17 September 2004
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.
q 2004 Elsevier B.V. All rights reserved.

  

Source: Akar, Nail - Department of Electrical and Electronics Engineering, Bilkent University
Kansas, University of - Information and Telecommunication Technology Center

 

Collections: Computer Technologies and Information Sciences; Engineering; Multidisciplinary Databases and Resources