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 proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages44
Number of pages1
ISBN (Electronic)0780359542
DOIs
StatePublished - 1999
Event1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999 - Metsovo, Greece
Duration: Jun 27 1999Jul 1 1999

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume1999-June
ISSN (Print)2157-8095

Other

Other1999 IEEE International Symposium on Information Theory: Information Theory and Networking Workshop, ITW 1999
CountryGreece
CityMetsovo
Period6/27/997/1/99

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes'. Together they form a unique fingerprint.

Cite this