Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes

Takis Konstantopoulos; George Kesidis

doi:10.1109/ITNW.1999.814354

Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes

Takis Konstantopoulos, George Kesidis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Allocation of resources is a challenging issue in the design and control of broadband ISDN networks because different network connections require different kinds of quality-of-service (QoS). Here, we consider the case of a VBR connection modelled as a random process but with deterministic shaping constraints. These constraints are known ahead of time and are typically specified by the simultaneous imposition of a (σ,ρ) and a (0,π) constraint, i.e., a π-peak-rate constraint. Since the actual statistics of the process may be unknown, it is desirable to obtain estimates of packet delay or buffer occupancy in the "worst-case". One can therefore interpret the results in terms of "capacities" of the VBR channels described.

Original language	English (US)
Title of host publication	Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	44
Number of pages	1
ISBN (Electronic)	0780359542
DOIs	https://doi.org/10.1109/ITNW.1999.814354
State	Published - 1999
Event	1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999 - Metsovo, Greece Duration: Jun 27 1999 → Jul 1 1999

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	1999-June
ISSN (Print)	2157-8095

Other

Other	1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999
Country/Territory	Greece
City	Metsovo
Period	6/27/99 → 7/1/99

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ITNW.1999.814354

Cite this

Konstantopoulos, T., & Kesidis, G. (1999). Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes. In Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999 (pp. 44). Article 814354 (IEEE International Symposium on Information Theory - Proceedings; Vol. 1999-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITNW.1999.814354

@inproceedings{59c05abb10154c3991216666a2d202a2,

title = "Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes",

abstract = "Allocation of resources is a challenging issue in the design and control of broadband ISDN networks because different network connections require different kinds of quality-of-service (QoS). Here, we consider the case of a VBR connection modelled as a random process but with deterministic shaping constraints. These constraints are known ahead of time and are typically specified by the simultaneous imposition of a (σ,ρ) and a (0,π) constraint, i.e., a π-peak-rate constraint. Since the actual statistics of the process may be unknown, it is desirable to obtain estimates of packet delay or buffer occupancy in the {"}worst-case{"}. One can therefore interpret the results in terms of {"}capacities{"} of the VBR channels described.",

author = "Takis Konstantopoulos and George Kesidis",

note = "Publisher Copyright: {\textcopyright} 1999 IEEE.; 1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999 ; Conference date: 27-06-1999 Through 01-07-1999",

year = "1999",

doi = "10.1109/ITNW.1999.814354",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "44",

booktitle = "Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999",

address = "United States",

}

Konstantopoulos, T & Kesidis, G 1999, Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes. in Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999., 814354, IEEE International Symposium on Information Theory - Proceedings, vol. 1999-June, Institute of Electrical and Electronics Engineers Inc., pp. 44, 1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999, Metsovo, Greece, 6/27/99. https://doi.org/10.1109/ITNW.1999.814354

Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes. / Konstantopoulos, Takis; Kesidis, George.
Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999. Institute of Electrical and Electronics Engineers Inc., 1999. p. 44 814354 (IEEE International Symposium on Information Theory - Proceedings; Vol. 1999-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes

AU - Konstantopoulos, Takis

AU - Kesidis, George

PY - 1999

Y1 - 1999

N2 - Allocation of resources is a challenging issue in the design and control of broadband ISDN networks because different network connections require different kinds of quality-of-service (QoS). Here, we consider the case of a VBR connection modelled as a random process but with deterministic shaping constraints. These constraints are known ahead of time and are typically specified by the simultaneous imposition of a (σ,ρ) and a (0,π) constraint, i.e., a π-peak-rate constraint. Since the actual statistics of the process may be unknown, it is desirable to obtain estimates of packet delay or buffer occupancy in the "worst-case". One can therefore interpret the results in terms of "capacities" of the VBR channels described.

AB - Allocation of resources is a challenging issue in the design and control of broadband ISDN networks because different network connections require different kinds of quality-of-service (QoS). Here, we consider the case of a VBR connection modelled as a random process but with deterministic shaping constraints. These constraints are known ahead of time and are typically specified by the simultaneous imposition of a (σ,ρ) and a (0,π) constraint, i.e., a π-peak-rate constraint. Since the actual statistics of the process may be unknown, it is desirable to obtain estimates of packet delay or buffer occupancy in the "worst-case". One can therefore interpret the results in terms of "capacities" of the VBR channels described.

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

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

U2 - 10.1109/ITNW.1999.814354

DO - 10.1109/ITNW.1999.814354

M3 - Conference contribution

AN - SCOPUS:85040620646

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 44

BT - Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999

Y2 - 27 June 1999 through 1 July 1999

ER -

Konstantopoulos T, Kesidis G. Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes. In Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999. Institute of Electrical and Electronics Engineers Inc. 1999. p. 44. 814354. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ITNW.1999.814354

Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this