A calculus for network delay. I. Network elements in isolation
Cruz, R.L.
Dept. of Electr. & Comput. Eng., California Univ., San Diego, CA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jan 1991
Volume: 37,
Issue: 1
On page(s): 114-131
ISSN: 0018-9448
References Cited: 25
CODEN: IETTAW
INSPEC Accession Number: 3847586
Digital Object Identifier: 10.1109/18.61109
Current Version Published: 2002-08-06
Abstract
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
