A Calculus for Network Delay and a Note on Topologies of Interconnection Networks

In this thesis we develop a calculus for obtaining bounds on delay in a buffered communication network that applies to a wide variety of models for network operation. 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. Given this model, we show that data traffic streams on each internal link of the network satisfy burstiness constraints. This allows us to obtain upper bounds on network delay and buffering requirements.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Cruz, Rene Leonardo

Contributors dc:contributor

• Hajek, Bruce

• Engineering, Electronics and Electrical

Identifier

(UMI)AAI8803010

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/69370