.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
We develop a simple theory of flows to study the flow of data in real-time computing networks. Flow Theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows: smooth and uniform, and eight types of flow operators. We prove that, if the input flow to any of these operators is smooth or uniform, then both the internal buffer and delay of that operator are bounded. Linear networks of flow operators are introduced, and their internal buffers and delays are derived from the internal buffers and delays of their constituent operators. We extend Flow Theory so that it can be used in analyzing cyclic networks and networks of multiflows. Since many rate-reservation protocols can be represented as linear networks of flow operators, we use Flow Theory to prove that a number of these protocols (Stop-and-Go, Hierarchical Round-Robin, Weighted Fair Queueing, Self-Clocking Fair Queueing, and Virtual Clock) require bounded buffering and introduce bounded delay.
Keyword:
guaranteed performance protocols
protocol verification
rate reservation protocols
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Humoral immunity to herpes simplex viral-induced antigens in smokers吸烟者对单纯疱疹病毒诱导抗原的体液免疫.png)
Cancer.png)
OAAI
CancerIF0
OAAI.png){kind=icon}
分享.png){kind=icon}
收藏分享收藏SERVICE DISCIPLINES FOR GUARANTEED PERFORMANCE SERVICE IN PACKET-SWITCHING NETWORKSPROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容