Weak convergence limits for closed cyclic networks of queues with multiple bottleneck nodes

Link:
Autor/in:
Erscheinungsjahr:
2012
Medientyp:
Text
Schlagworte:
  • Queueing networks
  • Servers
  • Random neural
  • Queueing Theory
  • Markov Processes
  • Cyclic exponential network
  • Bottleneck structure
  • Central limit theorem
  • Idle time
  • Filling behaviour
  • Cycle time
  • Queueing networks
  • Servers
  • Random neural
  • Queueing Theory
  • Markov Processes
Beschreibung:
  • We consider a sequence of cycles of exponential single-server nodes, where the number of nodes is fixed and the number of customers grows unboundedly. We prove a central limit theorem for the cycle time distribution. We investigate the idle time structure of the bottleneck nodes and the joint sojourn time distribution that a test customer observes at the nonbottleneck nodes during a cycle. Furthermore, we study the filling behaviour of the bottleneck nodes, and show that the single bottleneck and multiple bottleneck cases lead to different asymptotic behaviours. © 2012 Applied Probability Trust.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/df65d562-8a93-47f7-83d8-13baf6135f67