TY - GEN
T1 - Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes
AU - Konstantopoulos, Takis
AU - Kesidis, George
N1 - Funding Information:
and c ( p , ~i)s the service rate of the buffer. This bound holds for all values of n but is not necessarily tight as n + oc) [2]. A tighter bound is also found which is not closed-form and is also based on an extremal 3-level process [4]. We conclude with a discussion of some related results including one for a queue handling different shaped sources that are not necessarily independent [4]. In all cases, the proofs are based on representing the stationary probability by cycle formulae. *Research supported by an NSERC of Canada Personal Operating Grant and Nortel Networks. t Research supported by NSF Faculty Career Development Award NCR 95-02582.
Funding Information:
Research supported by an NSERC of Canada Personal Operating Grant and Nortel Networks. Research supported by NSF Faculty Career Development Award NCR 95-02582
Publisher Copyright:
© 1999 IEEE.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
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 -