Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:33:52.818Z Has data issue: false hasContentIssue false

Stationary and stability of fork-join networks

Published online by Cambridge University Press:  14 July 2016

Panagiotis Konstantopoulos
Affiliation:
University of California, Berkeley
Jean Walrand*
Affiliation:
University of California, Berkeley
*
∗ Postal address for both authors: Department of Electrical Engineering and Computer Sciences and Electronics Research Laboratory, University of California, Berkeley CA 94720, USA.

Abstract

We consider a fork-join network with arrival and service times forming a stationary and ergodic process. The usual stability condition, namely that the input rate is strictly less than all the service rates, is proved to be valid in this general case. Finally we extend the result to the case where there is random routing.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1989 

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