Maxima of sojourn times in acyclic Jackson queueing networks
From MaRDI portal
(Redirected from Publication:1374039)
Recommendations
Cites work
- scientific article; zbMATH DE number 4030574 (Why is no real title available?)
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3731128 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 193528 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 964546 (Why is no real title available?)
- Analysis of a three node queueing network
- Extreme Values in the GI/G/1 Queue
- Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems
- Extreme values of birth and death processes and queues
- Extremes and related properties of random sequences and processes
- Markovian network processes: Congestion-dependent routing and processing
- Note on Queues in Tandem
- Note—Some Results on Sojourn Times in Acyclic Jackson Networks
- Positive correlations in a three-node Jackson queueing network
- Products of distribution functions attracted to extreme value laws
- Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback
- Sample extremes: an elementary introduction
- Sojourn Times in Queueing Networks
- Sojourn times and the overtaking condition in Jacksonian networks
- Sufficient Conditions for a Mixture of Exponentials to be a Probability Density Function
- The amount of overtaking in a network of queues
This page was built for publication: Maxima of sojourn times in acyclic Jackson queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374039)