Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0712.94028
Cruz, Rene L.
A calculus for network delay. I: Network elements in isolation. (English)
[J] IEEE Trans. Inf. Theory 37, No.1, 114-131 (1991). ISSN 0018-9448

Summary: A calculus is developed in this paper (Part I) and the sequel (Part II; reviewed below (see Zbl 0712.94029)) 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 we develop is different from traditional approaches to analyzing delay because the model we use to describe the entry of data into the network is nonprobabilistic: We suppose 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 burstiness 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.

MSC 2000:: *94C99 Circuits, networks

Keywords: network delay; queueing network; flow control; packet switching; high speed networks; communication network; burstiness constraints

Citations: Zbl 0712.94029

Cited in: Zbl 0965.90007 Zbl 0964.90002 Zbl 0712.94029

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]