Performance bounds for flow control protocols

被引:92
作者
Agrawal, R
Cruz, RL
Okino, C
Rajan, R
机构
[1] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA
[2] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
[3] Dartmouth Coll, Thayer Sch Engn, Hanover, NH 03755 USA
[4] AT&T Bell Labs, Res, Florham Pk, NJ 07932 USA
基金
美国国家科学基金会;
关键词
adaptive service; burstiness; delay; guaranteed service; network calculus; regulator; scheduler; service curve; queueing;
D O I
10.1109/90.779197
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we discuss a simple conceptual framework for analyzing the flow of data in integrated services networks. The framework allows us to easily model and analyze the behavior of open loop, rate based flow control protocols, as well as closed loop, window based how control protocols. Central to the framework is the concept of a service curve element, whose departure process is bounded between the convolution of the arrival process with a minimum service curve and the convolution of the arrival process with a maximum service curve. Service curve elements can model links, propagation delays, schedulers, regulators, and window based throttles. The mathematical properties of convolution allow us to easily analyze complex configurations of service curve elements to obtain bounds on end-to end performance. We demonstrate this by examples, and investigate tradeoffs between buffering requirements, throughput, and delay, for different flow control strategies.
引用
收藏
页码:310 / 323
页数:14
相关论文
共 35 条