Resource allocation for statistical QoS provision in buffered crossbar switches

Qiang Duan, John N. Daigle

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


In this paper, we quantify the resources-bandwidth and credits-required to guarantee that the probability that a prescribed class-based target packet delay will be violated is upper bounded by a prescribed violation probability. We assume that the upper bound on the traffic arrival process for each class can be described statistically via effective envelopes. Our results are derived using a network calculus-based model of the system. We consider both deterministic and probabilistic delay guarantees. We find that the resources required to guarantee a probabilistic delay upper bound are less than those required to guarantee a deterministic delay upper bound of the same value.

Original languageEnglish (US)
Pages (from-to)2292-2296
Number of pages5
JournalIEEE International Conference on Communications
StatePublished - Aug 30 2004
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Resource allocation for statistical QoS provision in buffered crossbar switches'. Together they form a unique fingerprint.

Cite this