A model for end-to-end delay in distributed computer systems

Abstract

Mitchell [1,2] describes end-to-end performance for a LAN-based computer system as the total system throughput and delay for a single-thread transaction. This model is used for a variety of applications. The single-thread transaction might, for example, be a remote database update or a real-time control activity. To model end-to-end performance, one must include the host computers, the network interface units (NIUs), the host-NIU links, and the NIU-NIU links. Based on Jackson's Theorem, total delay for single-thread transaction traversing a computer network can be approximated by the sum of delays in the host computers, the network interface units, the host-NIU links, and the NIU-NIU links.

The host computer performance model can be refined by applying execution path analysis. Execution path analysis examines the structure of each software routine to be executed and provides an expression of time delay as a function of probabilities associated with conditional branches and a function of data input size.

Spreadsheet models provide quick and convenient solutions for purposes of performing computer system tuning and capacity planning as demonstrated by Thomas [10].

This thesis paper extends the typical modeling approach by providing more detailed analysis of host computer delay, more specifically, the execution path analysis. In addition, spreadsheet models are implemented to demonstrate the execution path analysis and to provide comparisons with previously implemented models.