Probabilistic packet delay guarantee in buffered crossbar switch

Qiang Duan, John N. Daigle

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

The buffered crossbar packet switch employs the crossbar-based switching fabric architecture with internal buffers and the combined input and output queueing scheme. It is promising to support Quality of Service (QoS) in buffered crossbar switch without complex implementation. In this paper, we study the problem of supporting traffic classes whose QoS requirements are stated statistically in buffered crossbar switches. Specifically, we investigate the resource allocation issue. We extend the network calculus-based model and techniques developed in [1] to determine the amount of bandwidth and number of credits that must be allocated in a buffered crossbar switch to guarantee each traffic class a packet delay that is upper bounded with a small violation probability. We find that the required amount of resources for probabilistic delay upper bound guarantee is less than what is required for deterministic delay upper bound guarantee. This implies that bandwidth and credits can be saved in buffered crossbar switch if resource allocation is based on probabilistic delay objective.

Original languageEnglish (US)
Pages253-258
Number of pages6
StatePublished - Jun 1 2004
Event23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 - Phoenix, AZ., United States
Duration: Apr 15 2004Apr 17 2004

Other

Other23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004
CountryUnited States
CityPhoenix, AZ.
Period4/15/044/17/04

Fingerprint

Switches
Resource allocation
Quality of service
Bandwidth
Telecommunication traffic

All Science Journal Classification (ASJC) codes

  • Media Technology

Cite this

Duan, Q., & Daigle, J. N. (2004). Probabilistic packet delay guarantee in buffered crossbar switch. 253-258. Paper presented at 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States.
Duan, Qiang ; Daigle, John N. / Probabilistic packet delay guarantee in buffered crossbar switch. Paper presented at 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States.6 p.
@conference{9929c76ff85b416989d2944f16ca7016,
title = "Probabilistic packet delay guarantee in buffered crossbar switch",
abstract = "The buffered crossbar packet switch employs the crossbar-based switching fabric architecture with internal buffers and the combined input and output queueing scheme. It is promising to support Quality of Service (QoS) in buffered crossbar switch without complex implementation. In this paper, we study the problem of supporting traffic classes whose QoS requirements are stated statistically in buffered crossbar switches. Specifically, we investigate the resource allocation issue. We extend the network calculus-based model and techniques developed in [1] to determine the amount of bandwidth and number of credits that must be allocated in a buffered crossbar switch to guarantee each traffic class a packet delay that is upper bounded with a small violation probability. We find that the required amount of resources for probabilistic delay upper bound guarantee is less than what is required for deterministic delay upper bound guarantee. This implies that bandwidth and credits can be saved in buffered crossbar switch if resource allocation is based on probabilistic delay objective.",
author = "Qiang Duan and Daigle, {John N.}",
year = "2004",
month = "6",
day = "1",
language = "English (US)",
pages = "253--258",
note = "23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 ; Conference date: 15-04-2004 Through 17-04-2004",

}

Duan, Q & Daigle, JN 2004, 'Probabilistic packet delay guarantee in buffered crossbar switch' Paper presented at 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States, 4/15/04 - 4/17/04, pp. 253-258.

Probabilistic packet delay guarantee in buffered crossbar switch. / Duan, Qiang; Daigle, John N.

2004. 253-258 Paper presented at 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Probabilistic packet delay guarantee in buffered crossbar switch

AU - Duan, Qiang

AU - Daigle, John N.

PY - 2004/6/1

Y1 - 2004/6/1

N2 - The buffered crossbar packet switch employs the crossbar-based switching fabric architecture with internal buffers and the combined input and output queueing scheme. It is promising to support Quality of Service (QoS) in buffered crossbar switch without complex implementation. In this paper, we study the problem of supporting traffic classes whose QoS requirements are stated statistically in buffered crossbar switches. Specifically, we investigate the resource allocation issue. We extend the network calculus-based model and techniques developed in [1] to determine the amount of bandwidth and number of credits that must be allocated in a buffered crossbar switch to guarantee each traffic class a packet delay that is upper bounded with a small violation probability. We find that the required amount of resources for probabilistic delay upper bound guarantee is less than what is required for deterministic delay upper bound guarantee. This implies that bandwidth and credits can be saved in buffered crossbar switch if resource allocation is based on probabilistic delay objective.

AB - The buffered crossbar packet switch employs the crossbar-based switching fabric architecture with internal buffers and the combined input and output queueing scheme. It is promising to support Quality of Service (QoS) in buffered crossbar switch without complex implementation. In this paper, we study the problem of supporting traffic classes whose QoS requirements are stated statistically in buffered crossbar switches. Specifically, we investigate the resource allocation issue. We extend the network calculus-based model and techniques developed in [1] to determine the amount of bandwidth and number of credits that must be allocated in a buffered crossbar switch to guarantee each traffic class a packet delay that is upper bounded with a small violation probability. We find that the required amount of resources for probabilistic delay upper bound guarantee is less than what is required for deterministic delay upper bound guarantee. This implies that bandwidth and credits can be saved in buffered crossbar switch if resource allocation is based on probabilistic delay objective.

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

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

M3 - Paper

SP - 253

EP - 258

ER -

Duan Q, Daigle JN. Probabilistic packet delay guarantee in buffered crossbar switch. 2004. Paper presented at 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States.