Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T21:44:12.024Z Has data issue: false hasContentIssue false

The throughput of a series of buffers

Published online by Cambridge University Press:  01 July 2016

F. P. Kelly*
Affiliation:
University of Cambridge
*
∗Postal address: Statistical Laboratory, 16 Mill Lane, Cambridge, CB2 1SB, U.K.

Abstract

Messages are to be transmitted through a series of n nodes linked by communication channels. The lengths of successive messages are independent identically distributed random variables, and the time taken to transmit a message through a channel is determined by its length. Each node has a finite buffer, and when the number of messages at a node reaches the buffer size transmission from the preceding node is interrupted. This paper is concerned with the maximum rate at which messages can pass through the system, called the throughput. We investigate the asymptotic behaviour of throughput as the series length increases, and determine the rate at which buffer sizes should grow to ensure that throughput does not decline to 0.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1982 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable