Resource allocation for quality of service provision in buffered crossbar switches with traffic aggregation

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A wide spectrum of emerging networking applications demand much stricter requirements on computer network quality of service (QoS). Packet switches play one of the most crucial roles in network QoS provision. The buffered crossbar switching architecture is promising to achieve high performance without a complex implementation and is expected to be one of the dominant switch structures for high-speed networks. In this paper we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches for QoS provision. We develop the model and techniques for determining the required amount of bandwidth and buffer space for aggregated traffic classes to provide delay performance guarantees and analyze the impact of traffic aggregation on resource utilization in buffered crossbar switches. We consider two traffic aggregation cases: aggregation of a set of flows with identical traffic profiles and aggregation of a set of flows with different traffic parameters. For both cases, we compare the amount of resources required by the aggregated traffic class and by the set of individual flows for achieving identical delay objectives. We find that traffic aggregation improves the utilization of both bandwidth and buffer space in buffered crossbar switches. Our analysis shows that the amount of resources saved by traffic aggregation is associated with multiple factors, including the delay objective, the arrival traffic parameters, and the number of flows aggregated into one class. The model and techniques we develop in this paper are general enough to be applied to buffered crossbar switches with a variety of scheduling algorithms.

Original languageEnglish (US)
Pages (from-to)283-290
Number of pages8
JournalInternational Journal of Computers and Applications
Volume29
Issue number3
DOIs
StatePublished - Jan 1 2007

Fingerprint

Resource allocation
Quality of service
Agglomeration
Switches
Telecommunication traffic
Bandwidth
HIgh speed networks
Computer networks
Scheduling algorithms

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

@article{1fd5bc85edda4ed1ac520b85049a1b66,
title = "Resource allocation for quality of service provision in buffered crossbar switches with traffic aggregation",
abstract = "A wide spectrum of emerging networking applications demand much stricter requirements on computer network quality of service (QoS). Packet switches play one of the most crucial roles in network QoS provision. The buffered crossbar switching architecture is promising to achieve high performance without a complex implementation and is expected to be one of the dominant switch structures for high-speed networks. In this paper we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches for QoS provision. We develop the model and techniques for determining the required amount of bandwidth and buffer space for aggregated traffic classes to provide delay performance guarantees and analyze the impact of traffic aggregation on resource utilization in buffered crossbar switches. We consider two traffic aggregation cases: aggregation of a set of flows with identical traffic profiles and aggregation of a set of flows with different traffic parameters. For both cases, we compare the amount of resources required by the aggregated traffic class and by the set of individual flows for achieving identical delay objectives. We find that traffic aggregation improves the utilization of both bandwidth and buffer space in buffered crossbar switches. Our analysis shows that the amount of resources saved by traffic aggregation is associated with multiple factors, including the delay objective, the arrival traffic parameters, and the number of flows aggregated into one class. The model and techniques we develop in this paper are general enough to be applied to buffered crossbar switches with a variety of scheduling algorithms.",
author = "Q. Duan",
year = "2007",
month = "1",
day = "1",
doi = "10.1080/1206212X.2007.11441858",
language = "English (US)",
volume = "29",
pages = "283--290",
journal = "International Journal of Computers and Applications",
issn = "1206-212X",
publisher = "ACTA Press",
number = "3",

}

TY - JOUR

T1 - Resource allocation for quality of service provision in buffered crossbar switches with traffic aggregation

AU - Duan, Q.

PY - 2007/1/1

Y1 - 2007/1/1

N2 - A wide spectrum of emerging networking applications demand much stricter requirements on computer network quality of service (QoS). Packet switches play one of the most crucial roles in network QoS provision. The buffered crossbar switching architecture is promising to achieve high performance without a complex implementation and is expected to be one of the dominant switch structures for high-speed networks. In this paper we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches for QoS provision. We develop the model and techniques for determining the required amount of bandwidth and buffer space for aggregated traffic classes to provide delay performance guarantees and analyze the impact of traffic aggregation on resource utilization in buffered crossbar switches. We consider two traffic aggregation cases: aggregation of a set of flows with identical traffic profiles and aggregation of a set of flows with different traffic parameters. For both cases, we compare the amount of resources required by the aggregated traffic class and by the set of individual flows for achieving identical delay objectives. We find that traffic aggregation improves the utilization of both bandwidth and buffer space in buffered crossbar switches. Our analysis shows that the amount of resources saved by traffic aggregation is associated with multiple factors, including the delay objective, the arrival traffic parameters, and the number of flows aggregated into one class. The model and techniques we develop in this paper are general enough to be applied to buffered crossbar switches with a variety of scheduling algorithms.

AB - A wide spectrum of emerging networking applications demand much stricter requirements on computer network quality of service (QoS). Packet switches play one of the most crucial roles in network QoS provision. The buffered crossbar switching architecture is promising to achieve high performance without a complex implementation and is expected to be one of the dominant switch structures for high-speed networks. In this paper we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches for QoS provision. We develop the model and techniques for determining the required amount of bandwidth and buffer space for aggregated traffic classes to provide delay performance guarantees and analyze the impact of traffic aggregation on resource utilization in buffered crossbar switches. We consider two traffic aggregation cases: aggregation of a set of flows with identical traffic profiles and aggregation of a set of flows with different traffic parameters. For both cases, we compare the amount of resources required by the aggregated traffic class and by the set of individual flows for achieving identical delay objectives. We find that traffic aggregation improves the utilization of both bandwidth and buffer space in buffered crossbar switches. Our analysis shows that the amount of resources saved by traffic aggregation is associated with multiple factors, including the delay objective, the arrival traffic parameters, and the number of flows aggregated into one class. The model and techniques we develop in this paper are general enough to be applied to buffered crossbar switches with a variety of scheduling algorithms.

UR - http://www.scopus.com/inward/record.url?scp=35048844714&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048844714&partnerID=8YFLogxK

U2 - 10.1080/1206212X.2007.11441858

DO - 10.1080/1206212X.2007.11441858

M3 - Article

AN - SCOPUS:35048844714

VL - 29

SP - 283

EP - 290

JO - International Journal of Computers and Applications

JF - International Journal of Computers and Applications

SN - 1206-212X

IS - 3

ER -