|Start Page Number:||181|
|End Page Number:||207|
|Publication Date:||Oct 2017|
|Authors:||Daduna Hans, Heidergott Bernd, Sommer Jennifer, Berkhout Joost|
|Keywords:||queues: applications, networks, maintenance, repair & replacement, performance|
Jackson networks are versatile models for analyzing complex networks. In this paper we study generalized Jackson networks with single‐server stations, where nodes may have an infinite supply of work. We allow simultaneous breakdown of servers and consider group repair strategies. We establish the existence of a steady‐state distribution of the queue‐length vector at stable nodes for different types of failure regimes. In steady state the distribution of the failure/repair regime and of the queue‐length vector at stable nodes decouples in a product‐form way. We provide closed‐form solutions for the classical performance measures such as throughput or mean sojourn time at a station.