A calculus for network delay. II. Network analysis
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1), 132-141
- https://doi.org/10.1109/18.61110
Abstract
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.<>Keywords
This publication has 6 references indexed in Scilit:
- Worst case analysis of a simple routing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Input buffer requirements for round robin polling systemsPerformance Evaluation, 1993
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Randomized parallel communications on an extension of the omega networkJournal of the ACM, 1987
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975