We consider the problem of allocation of network resources for a variable bit rate connection requiring a probabilistic bound on cell delay. We only make the standard assumption that the connection has a deterministically controlled shape as specified by a (a, p) constraint, simultaneously with a (0, /spl pi/) (or peak-rate) constraint. This paper settles one instance of this open problem raised by Doshi (1994), which is motivated by the need to obtain worst-case probabilistic bounds, and is particularly applicable to situations where no statistical descriptors of network traffic are available. In particular, we describe that traffic pattern which maximizes the "overflow probability" P(Q/sub 0/展开▼
机译:我们考虑用于可变比特率连接的网络资源分配问题,需要在单元延迟上占概率的概率。我们仅进行标准假设,即连接具有由(a,p)约束的确定性控制的形状,同时与(0,/ spl pi /)(或峰值速率)约束同时。本文定居了Doshi(1994)提出的这个公开问题的一个例子,这是由于需要获得最坏情况的概率范围,并且特别适用于网络流量统计描述符的情况。特别地,我们描述了用于给定缓冲区B的“溢出概率”P(Q / Sub 0 / 展开▼