Analysis of Jackson networks with infinite supply and unreliable nodes

Link:
Autor/in:
Erscheinungsjahr:
2017
Medientyp:
Text
Schlagworte:
  • Queueing networks
  • Heavy traffic
  • Servers
  • Queueing Theory
  • Markov Processes
  • Queueing networks
  • Heavy traffic
  • Servers
  • Queueing Theory
  • Markov Processes
Beschreibung:
  • 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.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH

Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/6ccf18c3-a4f4-405d-a7e2-71eb60359af0