BURST REDUCING SERVERS IN ATM NETWORKS

被引：12

作者：

LOW, SH ^{[1
]}

VARAIYA, PP ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY, BERKELEY, CA 94720 USA

来源：

QUEUEING SYSTEMS | 1995年 / 20卷 / 1-2期

关键词：

FLUID MODEL; BURSTINESS CURVE; BURST REDUCTION; BURSTINESS BOUND; LEAKY BUCKET;

D O I：

10.1007/BF01158432

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We study a stream of traffic or message as it is transferred over an ATM connection consisting of burst reducing servers. A message is modeled as a deterministic fluid flow, and an ATM node is modeled as a server which allocates bandwidth to messages. A message's burstiness curve b(mu) is the buffer size needed to prevent cell loss if it is served at rate mu. A server is burst reducing if its output message is always less bursty than the input message. Two popular bandwidth allocation schemes - the fixed rate and the leaky bucket server - are shown to be burst reducing. We also present a new class of burst reducing servers, the affine servers. We derive buffer requirements along a multi-hop connection and the final fluid flow reaching the destination as a message goes through a sequence of burst reducing servers. Finally, we suggest an approach to defining service quality.

引用

页码：61 / 84

页数：24

共 23 条

[1]

ANANTHARAM V, 1991, 29TH P ANN ALL C COM

[2] A CALCULUS FOR NETWORK DELAY .2. NETWORK ANALYSIS [J].