A CALCULUS FOR NETWORK DELAY .2. NETWORK ANALYSIS
A CALCULUS FOR NETWORK DELAY .2. NETWORK ANALYSIS
复制标题
DOI:
10.1109/18.61110
复制
发表时间:
1991-01-01
影响因子:
2.5
通讯作者:
CRUZ, RL
中科院分区:
文献类型:
--
作者:
CRUZ, RL
For pt.I see ibid., vol.37, no.1, p.114-31 (1991). A method to analyze the flow of data in a network consisting of the interconnection of network elements is presented. Assuming the data that enters the network satisfies burstiness constraints, burstiness constraints are derived for traffic flowing between network elements. These derived constraints imply bounds on network delay and buffering requirements. By example, it is shown that the use of regulator elements within the network can reduce maximum network delay. It is also found that such a use of regulator elements can enlarge the throughput region where finite bounds for delay are found. Finally, it is shown how regulator elements connected in series can be used to enforce general burstiness constraints.<>