.png){kind=icon}
返回
Performance bounds for flow control protocols
.png){kind=icon}
PRE
AI
DOI：10.1109/90.779197.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
adaptive service
burstiness
delay
guaranteed service
network calculus
regulator
scheduler
service curve
queueing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Synthesis and spectroscopic characterization of (trialkll/triaryl)-phosphine gold(I) thiocyanate complexes.png)
Polyhedron
PolyhedronIF0
PREAI
分享收藏Mutation Scanning Using MUT-MAP, a High-Throughput, Microfluidic Chip-Based, Multi-Analyte PanelPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容