DISTRIBUTION OF WAITING TIMES IN CLOCKED MULTISTAGE INTERCONNECTION NETWORKS.

Clyde P. Kruskal, Marc Snir, Alan Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An analysis is made of the random delay experienced by a message traversing a buffered, multistage packet-switching banyan network. The generating function for the distribution of waiting times at the first stage of the network is found for a very general class of traffic, assuming that messages have discrete sizes. For example, traffic can be uniform or nonuniform, messages can have different sizes, and messages can arrive in batches. For light to moderate loads, the authors conjecture that delays experienced at the various stages of the network are nearly the same and are nearly independent. This allows them to approximate the total delay distribution. Better approximations for the distribution of waiting times at later stages of the network are attained by assuming that in the limit a sort of spatial steady-state is achieved. Extensive simulations confirm the formulas and conjectures.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsKai Hwang, Steven M. Jacobs, Earl E. Swartzlander
PublisherIEEE
Pages12-19
Number of pages8
ISBN (Print)0818607246
StatePublished - Dec 1 1986
Externally publishedYes

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'DISTRIBUTION OF WAITING TIMES IN CLOCKED MULTISTAGE INTERCONNECTION NETWORKS.'. Together they form a unique fingerprint.

Cite this