Extremal shape-controlled traffic patterns in high-speed networks

George Kesidis, Takis Konstantopoulos

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

We consider a variable bit-rate connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on packet-transfer delay define a variable bit-rate 'channel;' an equivalent problem is to determine the 'capacity' of this channel. To this end, we consider a queue with a constant service rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.

Original languageEnglish (US)
Pages (from-to)813-819
Number of pages7
JournalIEEE Transactions on Communications
Volume48
Issue number5
DOIs
StatePublished - Dec 3 2000

Fingerprint

HIgh speed networks
Bandwidth
Communication

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{cd834ff3a0c9487796a8f83f78d2d607,
title = "Extremal shape-controlled traffic patterns in high-speed networks",
abstract = "We consider a variable bit-rate connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on packet-transfer delay define a variable bit-rate 'channel;' an equivalent problem is to determine the 'capacity' of this channel. To this end, we consider a queue with a constant service rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.",
author = "George Kesidis and Takis Konstantopoulos",
year = "2000",
month = "12",
day = "3",
doi = "10.1109/26.843194",
language = "English (US)",
volume = "48",
pages = "813--819",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Extremal shape-controlled traffic patterns in high-speed networks. / Kesidis, George; Konstantopoulos, Takis.

In: IEEE Transactions on Communications, Vol. 48, No. 5, 03.12.2000, p. 813-819.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Extremal shape-controlled traffic patterns in high-speed networks

AU - Kesidis, George

AU - Konstantopoulos, Takis

PY - 2000/12/3

Y1 - 2000/12/3

N2 - We consider a variable bit-rate connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on packet-transfer delay define a variable bit-rate 'channel;' an equivalent problem is to determine the 'capacity' of this channel. To this end, we consider a queue with a constant service rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.

AB - We consider a variable bit-rate connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on packet-transfer delay define a variable bit-rate 'channel;' an equivalent problem is to determine the 'capacity' of this channel. To this end, we consider a queue with a constant service rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.

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

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

U2 - 10.1109/26.843194

DO - 10.1109/26.843194

M3 - Article

AN - SCOPUS:0033702547

VL - 48

SP - 813

EP - 819

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 5

ER -