A CALCULUS FOR NETWORK DELAY .1. NETWORK ELEMENTS IN ISOLATION
A CALCULUS FOR NETWORK DELAY .1. NETWORK ELEMENTS IN ISOLATION
复制标题
DOI：
10.1109/18.61109
复制
发表时间：
1991-01-01
影响因子：
2.5
通讯作者：
CRUZ, RL
中科院分区：
文献类型：
--
作者：
CRUZ, RL
一个演算开发用于获得在固定路由策略下的分组交换模式下操作的通信网络中的延迟和缓冲要求的界限。开发的理论是从传统的方法来分析延迟不同，因为用于描述数据进入网络的模型是非概率的。它被假定为进入网络的数据流由任何给定的用户满足突发性约束。如果来自包含在任何时间间隔中的流的数据量小于取决于间隔的长度的值，则数据流被称为满足突发性约束。定义了几个网络元素，可以用作构建块来对各种通信网络进行建模。每种类型的网络元素进行分析，假设进入它的流量满足突发约束。在此假设下，得到的网络元素的延迟和缓冲的要求上的界限;突发性约束所满足的流量，退出元素的推导。<>
A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the network by any given user satisfies burstiness constraints. A data stream is said to satisfy a burstiness constraint if the quantity of data from the stream contained in any interval of time is less than a value that depends on the length of the interval. Several network elements are defined that can be used as building blocks to model a wide variety of communication networks. Each type of network element is analyzed by assuming that the traffic entering it satisfies bursting constraints. Under this assumption, bounds are obtained on delay and buffering requirements for the network element; burstiness constraints satisfied by the traffic that exits the element are derived.<>