Most probable path techniques for Gaussian queueing systems

DOI10.1007/3-540-47906-6_7MaRDI QIDQ3045032zbMATH OpenFDO

Authors Ilkka Norros

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2345/23450086.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 879779
• A probabilistic approach for the analysis of the \(M_n/G/1\) queue
• Networks and queues: Probabilistic methods
• Sample-path analysis of queueing systems
• Queueing Networks with Gaussian Inputs
• On the Dependence Structure of Gaussian Queues
• Queueing networks with path-dependent arrival processes
• Gaussian queues in light and heavy traffic
• Sample path methods in the control of queues

Cited in

(2)

• A queue with semiperiodic traffic
• scientific article; zbMATH DE number 879779 (Why is no real title available?)

This page was built for publication: Most probable path techniques for Gaussian queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3045032)