{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T21:40:06Z","timestamp":1680903606053},"reference-count":53,"publisher":"Elsevier BV","issue":"17","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0140-3664(98)00218-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:03Z","timestamp":1027598883000},"page":"1495-1508","source":"Crossref","is-referenced-by-count":3,"title":["Analytic comparison results for communication networks"],"prefix":"10.1016","volume":"21","author":[{"given":"Nico M.","family":"van Dijk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(98)00218-7_BIB1","unstructured":"I.J.B.F. Adan, J. Van der Wal, Monotonicity of the throughput in single server production and assembly networks with respect to buffer sizes, in: H.G. Perros, T. Altiok (Eds.), Queueing Networks with Blocking, North-Holland, Amsterdam, 1989, pp. 345\u2013356."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB2","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.37.6.953","article-title":"Monotonicity of the throughput of a closed queueing network in the number of jobs","volume":"37","author":"Adan","year":"1989","journal-title":"Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF02054751","article-title":"Approximation analysis of arbitrary configurations of open queueing networks with blocking","volume":"9","author":"Altiok","year":"1987","journal-title":"Annals Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB4","unstructured":"S. Balsamo, G. Iazeolla, Aggregation and disaggregation in queueing networks; The principle of product-form synthesis, in: G. Iazeolla, P.J. Courtois, A. Hordijk (Eds.), Mathematical Computer Performance and Reliability, North-Holland, Amsterdam, 1984, pp. 95\u2013109."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB5","unstructured":"S. Balsamo, B. Pandolfi, Bounded aggregation in Markovian networks, in: G. Iazeolla, P.J. Courtois, O.J. Boxma (Eds.), Computer Performance and Reliability, North-Holland, Amsterdam, 1988, pp. 73\u201392."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/opre.36.1.73","article-title":"An approximation method for tandem queues with blocking","volume":"36","author":"Bandwajn","year":"1988","journal-title":"Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB7","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/TSE.1986.6313019","article-title":"Decomposition and aggregation by class in closed queueing networks","volume":"SE12","author":"Conway","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB8","doi-asserted-by":"crossref","unstructured":"P.J. Courtois, P. Semal, Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models, IEEE J. Select. Areas Commun. SAC-46 (1986).","DOI":"10.1109\/JSAC.1986.1146398"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB9","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/JSAC.1986.1146398","article-title":"Computable error bounds for conditional steady-state probabilities in large Markov chains and queueing models","volume":"SAC4","author":"Courtois","year":"1986","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB10","unstructured":"Y. Dallery, Y. Frein, A decomposition method for the approximate analysis of closed queueing with blocking, in: H.G. Perros, T. Altiok (Eds.), Queueing Networks with Blocking, North-Holland, Amsterdam, 1989."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.35.2.291","article-title":"An efficient decomposition method for approximate evaluation of production lines with finite storage space","volume":"35","author":"Gershwin","year":"1987","journal-title":"Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB12","doi-asserted-by":"crossref","unstructured":"W. Grassmann, Finding transient solutions in Markovian event systems through randomization, in: W.J. Stewart (Ed.), Numerical Solutions of Markov Chains, Marcel Dekker, New York, pp. 357\u2013371.","DOI":"10.1201\/9781003210160-18"},{"issue":"1","key":"10.1016\/S0140-3664(98)00218-7_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-5316(93)90027-R","article-title":"Approximate performability and dependability modelling using generalized stochastic Petri nets","volume":"18","author":"Haverkort","year":"1993","journal-title":"Perform. Eval."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB14","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/0724062","article-title":"Aggregation\/disaggregation methods for computing the stationary distribution of a Markov chain","volume":"24","author":"Haviv","year":"1987","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB15","doi-asserted-by":"crossref","first-page":"804","DOI":"10.2307\/1427341","article-title":"Perturbation bounds for the stationary probabilities of a finite Markov chain","volume":"16","author":"Haviv","year":"1984","journal-title":"Adv. Appl. Prob."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB16","doi-asserted-by":"crossref","first-page":"696","DOI":"10.2307\/3214100","article-title":"Stochastic inequalities for an overflow model","volume":"24","author":"Hordijk","year":"1987","journal-title":"J. Appl. Prob."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB17","unstructured":"J.G. Kemeny, L. Snell, A.W. Knapp, Denumerable Markov Chains, Van Nostrand, Princeton, NJ, 1966."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB18","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1287\/moor.12.2.350","article-title":"Stochastic orderings for Markov processes on partially ordered spaces","volume":"12","author":"Massey","year":"1987","journal-title":"Math. Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-4149(77)90033-3","article-title":"Monotone matrices and monotone Markov processes","volume":"5","author":"Keilson","year":"1977","journal-title":"Stochast. Process. Appl."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0601031","article-title":"The condition of a finite Markov chain and perturbation bounds for the limiting probabilities","volume":"1","author":"Meyer","year":"1980","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB21","unstructured":"H.G. Perros, T. Altiok (Eds.), Queueing Networks with Blocking, North-Holland, Amsterdam, 1989."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0305-0548(88)90026-3","article-title":"Numerical transient analysis of Markov models","volume":"15","author":"Reibman","year":"1988","journal-title":"Comput. Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB23","unstructured":"P.J. Schweitzer, T. Altiok, Aggregate modelling of tandem queues with blocking, in: G. Iazeolla, P.J. Courtois, O. Boxma (Eds.), Computer Performance and Reliability, North-Holland, Amsterdam, 1988, pp. 135\u2013149."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB24","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/3212261","article-title":"Perturbation theory and finite Markov chains","volume":"4","author":"Schweitzer","year":"1968","journal-title":"J. Appl. Prob."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB25","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1017\/S0305004100042006","article-title":"Finite approximations to finite non-negative matrices","volume":"63","author":"Seneta","year":"1967","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB26","first-page":"533","article-title":"The principles of truncations in applied probability","volume":"9","author":"Seneta","year":"1968","journal-title":"Commun. Math. Univ. Carolina"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB27","doi-asserted-by":"crossref","unstructured":"E. Seneta, Non-negative matrices and Markov chains, Springer, New York, 1980.","DOI":"10.1007\/0-387-32792-4"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB28","doi-asserted-by":"crossref","first-page":"474","DOI":"10.2307\/3214188","article-title":"The effect of increasing service rates in closed queueing network","volume":"23","author":"Shanthikumar","year":"1986","journal-title":"J. Appl. Prob."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB29","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0166-5316(88)90025-9","article-title":"Throughput bounds for closed queueing networks with queue-independent service rates","volume":"9","author":"Shanthikumar","year":"1988","journal-title":"Perform. Eval."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB30","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/asm.3150080404","article-title":"Product forms for availability models","volume":"8","author":"Smeitink","year":"1992","journal-title":"Appl. Stochast. Models Data Anal."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB31","doi-asserted-by":"crossref","unstructured":"G.W. Stewart, Computable error bounds for aggregated Markov chains, JACM 30 (2) (1983).","DOI":"10.1145\/322374.322377"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB32","unstructured":"G.W. Stewart, MARCA: Markov chain analyzer, in: W.J. Stewart (Ed.), Numerical Solution of Markov Chains, Marcel Dekker, New York, 1991."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB33","unstructured":"D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley, New York, 1983."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB34","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1287\/opre.33.3.606","article-title":"A concept of monotonicity and its characterization for closed queueing networks","volume":"33","author":"Suri","year":"1985","journal-title":"Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB35","unstructured":"Y. Takahashi, Aggregate approximation for acyclic queueing networks with communication blocking, in: H.G. Perros, T. Altiok (Eds.), Queueing Networks with Blocking, North-Holland, Amsterdam, 1989, pp. 33\u201346."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB36","doi-asserted-by":"crossref","first-page":"134","DOI":"10.2307\/3214323","article-title":"Monotonicity and throughput in non-Markovian networks","volume":"26","author":"Tsoucas","year":"1989","journal-title":"J. Appl. Prob."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB37","unstructured":"P.G. Taylor, N.M. Van Dijk, Strong stochastic bounds for the stationary distribution of a class of multicomponent performability models, Research Report, University of Amsterdam, 1993 (Operat. Res., in press)."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB38","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-4149(87)90041-X","article-title":"A formal proof for the insensitivity of simple bounds for multi-server non-exponential tandem queues based on monotonicity results","volume":"27","author":"Van Dijk","year":"1988","journal-title":"Stochast. Proc. Appl."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB39","unstructured":"N.M. Van Dijk, Queueing Networks and Product Forms: A Systems Approach, Wiley, Chichester, UK, 1993."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB40","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-5316(88)90017-X","article-title":"Simple bounds for queueing systems with breakdowns","volume":"8","author":"Van Dijk","year":"1988","journal-title":"Perform. Eval."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB41","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-5316(89)90008-4","article-title":"Simple throughput bounds for large queueing networks with finite capacity constraints","volume":"9","author":"Van Dijk","year":"1989","journal-title":"Perform. Eval."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB42","unstructured":"N.M. Van Dijk, On the importance of bias-terms for error bounds and comparison results, in: W.J. Stewart (Ed.), The Numerical Solutions of Markov Chains, Marcel Dekker, New York, pp. 618\u2013649."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB43","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-4149(92)90018-L","article-title":"Approximate uniformization for continuous-time Markov chains with applications to performability analysis","volume":"40","author":"Van Dijk","year":"1992","journal-title":"Stochast. Process. Appl."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB44","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02023091","article-title":"On product form approximations for communication networks with losses: error bounds","volume":"35","author":"Van Dijk","year":"1992","journal-title":"Annals Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB45","doi-asserted-by":"crossref","unstructured":"N.M. Van Dijk, L. Puterman, Perturbation theory for Markov reward processes with applications to queueing systems, Adv. Appl. Prob. 20, 79\u201389.","DOI":"10.1017\/S000186780001795X"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB46","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1017\/S026996480000067X","article-title":"Simple bounds and monotonicity of the call congestion of infinite multiserver delay systems","volume":"2","author":"Van Dijk","year":"1988","journal-title":"Prob. Eng. Informat. Sci."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01150852","article-title":"Simple bounds and monotonicity results for multi-server exponential tandem queues","volume":"4","author":"Van Dijk","year":"1989","journal-title":"Queueing Systems"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB48","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-5316(91)90012-R","article-title":"Monotonicity of performance measures in a processor sharing queue","volume":"12","author":"De Waal","year":"1991","journal-title":"Perform. Eval."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB49","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/1426475","article-title":"Comparing counting processes and queues","volume":"13","author":"Whitt","year":"1981","journal-title":"Adv. Appl. Prob."},{"issue":"4","key":"10.1016\/S0140-3664(98)00218-7_BIB50","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1287\/moor.11.4.608","article-title":"Stochastic comparison for non-Markov processes","volume":"11","author":"Whitt","year":"1986","journal-title":"Math. Operat. Res."},{"key":"10.1016\/S0140-3664(98)00218-7_BIB51","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1018978823209","article-title":"Bounds and error bounds for queueing networks","volume":"79","author":"van Dijk","year":"1998","journal-title":"Annals Operat. Res."},{"issue":"1","key":"10.1016\/S0140-3664(98)00218-7_BIB52","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1080\/09332480.1997.10554794","article-title":"To wait or not to wait: That is the question","volume":"10","author":"van Dijk","year":"1997","journal-title":"Chance"},{"key":"10.1016\/S0140-3664(98)00218-7_BIB53","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0377-2217(97)00015-5","article-title":"Why queueing never vanishes","volume":"99","author":"van Dijk","year":"1997","journal-title":"Eur. J. Operat. Res."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T21:15:08Z","timestamp":1680902108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366498002187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":53,"journal-issue":{"issue":"17","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0140366498002187"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(98)00218-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}