Asymptotic analysis for closed multichain queueing networks with bottlenecks

DOI10.1007/BF01206559MaRDI QIDQ1362314zbMATH OpenFDO

Authors O. Diekmann, Yaakov Kogan, A. Y. Yakovlev

Publication date 20 November 1997

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01206559

zbMATH Keywords

explicit asymptotic expressions for the partition functionsaddle-point contoursingle server stations

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25)

Review text

The authors obtain explicit asymptotic expressions for the partition function for a large two-chain network consisting of one infinite server and two processor-sharing on FMFS single server stations. The key step in asymptotic evaluation of the multidimensional contour integral is its transformation to the saddle-point contour integral, which has an explicit asymptotic expression. This approach requires one to find the saddle-point contour, move the initial integration contour to the saddle-point contour, pick-up the residues between these two contours and find the term providing the main contribution to the asymptotic expansion of the partition function. This paper generalizes the results of the one-dimensional case discussed by \textit{A. Birman} and \textit{Y. Kogan} [Commun. Stat., Stochastic Models 8, No. 3, 543-563 (1992; Zbl 0756.60087)].

Recommendations

• Asymptotic analysis of multiclass closed queueing networks: Common bottleneck
• On the asymptotic behaviour of closed multiclass queueing networks
• Asymptotic analysis for closed multiclass queueing networks in critical usage
• Bottleneck analysis in multiclass closed queueing networks and its application
• Exact-order asymptotic analysis for closed queueing networks
• Closed queue networks with load-dependent servers: An asymptotic analysis
• Asymptotic methods for the analysis of closed queueing networks with heavy traffic
• Asymptotic analysis of multiple class queueing networks

Cites work

• A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
• Another approach to asymptotic expansions for large closed queueing networks
• Asymptotic analysis for closed multiclass queueing networks in critical usage
• Asymptotic evaluation of closed queueing networks with many stations
• scientific article; zbMATH DE number 41767 (Why is no real title available?)
• scientific article; zbMATH DE number 3634395 (Why is no real title available?)
• Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage
• Multidimensional Residues, Generating Functions, and Their Application to Queueing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Several complex variables I. Introduction to complex analysis. Transl. from the Russian by P. M. Gauthier
• The Evaluation of Normalizing Constants in Closed Queueing Networks

Cited in

(9)

• Another approach to asymptotic expansions for large closed queueing networks
• Asymptotic analysis for closed multiclass queueing networks in critical usage
• Existence and uniqueness of nonnegative solution of \(M/G^B/1\) queueing model
• Asymptotic expansions for large closed and loss queueing networks
• Exact-order asymptotic analysis for closed queueing networks
• Multidimensional Residues, Generating Functions, and Their Application to Queueing Networks
• Asymptotic evaluation of closed queueing networks with many stations
• On the asymptotic behaviour of closed multiclass queueing networks
• Limit non-stationary behavior of large closed queueing networks with bottlenecks

This page was built for publication: Asymptotic analysis for closed multichain queueing networks with bottlenecks

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