Performance Measurements of Motorola's Implementation of Map

We present performance measurements for data transfer services at the CASE. transport, and datalink layers of Motorola's implementation of MAP for a range of message sizes. We compare the performance results of using a stop-and-wait vs. a sliding window protocol, and find that the sliding window permits a 40% speedup. We observe that end-to-end latency exceeds transmission delay by a factor of 25 for 1,000-byte messages, thereby making all network access, transmission, and propagation delays negligible when compared to protocol processing. We show that the throughput of CASE and transport is basically linear with message size, whereas the throughput of datalink is not. We identify the bottlenecks which constrain total system throughput at each layer.
Note: Abstract extracted from PDF file via OCR

Strayer, W, and Alfred Weaver. "Performance Measurements of Motorola's Implementation of Map." University of Virginia Dept. of Computer Science Tech Report (1988).