Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Closed Queueing Networks and Zeros of Successive Derivatives

  • Published : 1997.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

Consider a Jackson type closed queueing network in which each queue has a single exponential server. Assume that N customers are moving among .kappa. queues. We propose a candidata procedure which yields a lower bound of the network throughput which is sharper than those which are currently available : Let (.rho.$_{1}$, ... .rho.$_{\kappa}$) be the loading vector, let x be a real number with 0 .leq. x .leq. N, and let y(x) denote that y is a function of x and be the unique positive solution of the equation. .sum.$_{i = 1}$$^{\kappa}$y(x) .rho.$_{i}$ (N - y(x) x $p_{i}$ ) = 1 Whitt [17] has shown that y(N) is a lower bound for the throughput. In this paper, we present evidence that y(N -1) is also a lower bound. In dosing so, we are led to formulate a rather general conjecture on 'quot;Migrating Critical Points'quot; (MCP). The .MCP. conjecture asserts that zeros of successive derivatives of certain rational functions migrate at an accelerating rate. We provide a proof of MCP in the polynomial case and some other special cases, including that in which the rational function has exactly two real poles and fewer than three real zeros.tion has exactly two real poles and fewer than three real zeros.

Keywords

References

  1. Journal of Math. Ann. and Appl. v.42 Zeros of Succesive Derivatives of Entire Functions Boas, R. P.;A. R. Reddy
  2. Stochastic Models of Manufacturing System Buzacott, J.;J. Shanthikumar
  3. Comm. ACM v.16 Computational algorithms for closed queueing networks with exponential servers Buzen, J. P.
  4. Ann. of Math. v.125 The Zeros fo Derivatives of Entire Functions and the Polya-Wiman Conjecture Craven, T.; G. Csordas;W. Smith
  5. Oper. Res. v.38 The evaluation of Normalizing Constants in Closed Queueing Networks Gordon, J. J.
  6. Oper. Res. v.33 On Normalizing Constants in Queueing Networks Harrison, P. G.
  7. An Introduction to System Performance Evaluation Methodology Modeling and Analysis Kobayashi, H.
  8. IEEE Trans. v.41 Asymptotic Expansions for Closed Queueing Networks with Multiple Job Classes Knessl, C.;C. Tier
  9. Symmetric Functions and Hall Polynomials Macdonald, I. G.
  10. Comm. of the ACM v.31 Random Number Generators: Good Ones Are Hard To Find Park, S.;K. Miller
  11. Bull. Amer. Math. Soc. v.49 On the Zeros of the Derivatives of a Function and Its Analytic Character Polya, G.
  12. Proc. of Amer. Math. Soc. v.45 On the Derivatives of Zeros of Entire Functions Reddy, A. R.
  13. Journal of the ACM v.27 Mean-Value Analysis of Closed Multi-chain Queueing Networks Reiser, M.;S. S. Lavenberg
  14. Computer Systems Performance Modeling Sauer, C. H.;K. M. Chandy
  15. Telecommunication Networks: Protocols, Modeling and Analysis Schwartz, M.
  16. Ann. of Math. v.129 On the Zeros of the Derivatives of Real Entire Functions and Wiman's Conjecture Sheil-Small, T.
  17. AT&T Bell Lab. Tech. J. v.63 Open and Closed Models of Queues Whitt, W.
  18. Oper. Res. Letters v.3 Some Properties of the Throughput Function of Closed Networks of ueues Yao, D. D.
  19. Comm. of the ACM v.25 Balanced Job Bound Analysis of Queueing Networks Zahorjan, J.;K. C. Sevcik;D. L. Eager;B. Galler