{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:08:39Z","timestamp":1719306519028},"reference-count":29,"publisher":"University of Zielona G\u00f3ra, Poland","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,3,1]]},"abstract":"Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation<\/jats:title>This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate \u03bb, and the service times at the first and the second node are non-exponentially distributed with meanssA<\/jats:sup><\/jats:italic>andsB<\/jats:sup><\/jats:italic>, respectively. Both nodes have buffers with finite capacities. In this type of network, if the second buffer is full, the accumulation of new tasks by the second node is temporarily suspended (a blocking factor) and tasks must wait on the first node until the transmission process is resumed. All new tasks that find the first buffer full are turned away and are lost (a truncation factor). First, a Markov model of the tandem is investigated. Here, a two-dimensional state graph is constructed and a set of steady-state equations is created. These equations allow calculating state probabilities for each graph state. A special algorithm for transforming the Markov model into a semi-Markov process is presented. This approach allows calculating steady-state probabilities in the semi-Markov model. Next, the algorithms for calculating the main measures of effectiveness in the semi-Markov model are presented. In the numerical part of this paper, the author investigates examples of several semi-Markov models. Finally, the results of calculating both the main measures of effectiveness and quality of service (QoS) parameters are presented.<\/jats:p>","DOI":"10.2478\/v10006-009-0014-6","type":"journal-article","created":{"date-parts":[[2009,4,3]],"date-time":"2009-04-03T01:05:55Z","timestamp":1238720755000},"page":"151-164","source":"Crossref","is-referenced-by-count":4,"title":["Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation"],"prefix":"10.61822","volume":"19","author":[{"given":"Walenty","family":"Oniszczuk","sequence":"first","affiliation":[]}],"member":"37438","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/32.4663","article-title":"Mean value analysis for blocking queuing networks","volume":"4","author":"I. Akyildiz","year":"1988","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02023094","article-title":"A survey of product form queueing networks with blocking and their equivalences","volume":"1\/4","author":"S. Balsamo","year":"1994","journal-title":"Annals of Operations Research"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3345-7","author":"S. Balsamo","year":"2001","journal-title":"Analysis of Queueing Networks with Blocking"},{"key":"4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0166-5316(02)00099-8","article-title":"A review on queueing network models with finite capacity queues for software architectures performance predication","volume":"2-4","author":"S. Balsamo","year":"2003","journal-title":"Performance Evaluation"},{"key":"5","first-page":"145","article-title":"Performance evaluation of multistage interconnection networks with blocking\u2014Discrete and continuous time Markov models","volume":"2","author":"A. Badrah","year":"2002","journal-title":"Archiwum Informatyki Teoretycznej i Stosowanej"},{"key":"6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-5316(96)00045-4","article-title":"On the arrival theorem for product form queueing networks with blocking","volume":"3","author":"R. Boucherie","year":"1997","journal-title":"Performance Evaluation"},{"key":"7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-5316(95)00022-4","article-title":"Performance evaluation of closed tandem queueing networks","volume":"26","author":"A. Bouhchouch","year":"1996","journal-title":"Performance Evaluation"},{"key":"8","first-page":"579","article-title":"A matrix-based method for analysing stochastic process algebras","author":"J. Bradley","year":"2000"},{"key":"9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.peva.2004.10.007","article-title":"Iterative convergence of passage-time densities in semi-Markov performance models","volume":"1-4","author":"J. Bradley","year":"2005","journal-title":"Performance Evaluation"},{"key":"10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1018995326844","article-title":"MVA for product-form cyclic queueing networks with blocking","volume":"79","author":"M. Clo","year":"1998","journal-title":"Annals of Operations Research"},{"key":"11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1019117121530","article-title":"Product form stationary distributions for queueing networks with blocking and rerouting","volume":"3\/4","author":"A. Economou","year":"1998","journal-title":"Queueing Systems"},{"key":"12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1016235415066","article-title":"A tandem queue with blocking and Markovian arrival process","volume":"4","author":"A. Gomez-Corral","year":"2002","journal-title":"Queueing Systems"},{"key":"13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0166-5316(02)00091-3","article-title":"Decomposition of general queueing networks with MMPP inputs and customer losses","volume":"2-4","author":"A. Heindl","year":"2003","journal-title":"Performance Evaluation"},{"key":"14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0166-5316(94)00029-8","article-title":"Blocking in a shared resource environment with batched arrival processes","volume":"4","author":"J. Kaufman","year":"1996","journal-title":"Performance Evaluation"},{"key":"15","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-4625-8","author":"V. Korolyuk","year":"1999","journal-title":"Stochastic Models of Systems"},{"key":"16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00299634","article-title":"Maximum entropy two-station cyclic queues with multiple general servers","volume":"3","author":"D. Kouvatsos","year":"1988","journal-title":"Acta Informatica"},{"key":"17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S1389-1286(00)00099-2","article-title":"A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks","volume":"1","author":"D. Kouvatsos","year":"2000","journal-title":"Computer Networks"},{"key":"18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1015729701521","article-title":"Large tandem queueing networks with blocking","volume":"1\/2","author":"J. Martin","year":"2002","journal-title":"Queueing Systems"},{"key":"19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0166-5316(94)00042-5","article-title":"Blocking probabilities for multiple class batched arrivals to a shared resource","volume":"2","author":"J. Morrison","year":"1996","journal-title":"Performance Evaluation"},{"key":"20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-0-387-36503-9_24","author":"W. Oniszczuk","year":"2006","journal-title":"Biometrics, Computer Security Systems and Artificial Intelligence Applications"},{"key":"21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/78919.78920","article-title":"Survey of closed queuing networks with blocking","volume":"2","author":"R. Onvural","year":"1990","journal-title":"Computer Survey"},{"key":"22","author":"H. Perros","year":"1994","journal-title":"Queuing Networks with Blocking. Exact and Approximate Solution"},{"key":"23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1018932108865","article-title":"A two-level queueing network model with blocking and non-blocking messages","volume":"1\/4","author":"S. Ramesh","year":"2000","journal-title":"Annals of Operations Research"},{"key":"24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0166-5316(99)00038-3","article-title":"Mean value analysis of product form solution queueing networks with repetitive service blocking","volume":"1","author":"M. Sereno","year":"1999","journal-title":"Performance Evaluation"},{"key":"25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-5316(01)00053-0","article-title":"A finite buffer queue with priorities","volume":"1","author":"V. Sharma","year":"2002","journal-title":"Performance Evaluation"},{"key":"26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1018914503645","article-title":"Analysis of queueing networks with blocking using a new aggregation technique","volume":"0","author":"J. Strelen","year":"1998","journal-title":"Annals of Operations Research"},{"key":"27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1018970621392","article-title":"Throughput estimation in cyclic queueing networks with blocking","volume":"0","author":"T. Tolio","year":"1998","journal-title":"Annals of Operations Research"},{"key":"28","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01158953","article-title":"Approximate mean value performance analysis of cyclic queueing networks with production blocking","volume":"1-2","author":"L. Zhuang","year":"1994","journal-title":"Queueing Systems"},{"key":"29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-5316(95)00003-8","article-title":"Acceptance instant distributions in product-form closed queueing networks with blocking","volume":"2","author":"L. Zhuang","year":"1996","journal-title":"Performance Evaluation"}],"container-title":["International Journal of Applied Mathematics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/amcs\/19\/1\/article-p151.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/amcs.2009.19.issue-1\/v10006-009-0014-6\/v10006-009-0014-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T10:26:33Z","timestamp":1709202393000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/v10006-009-0014-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,1]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.2478\/v10006-009-0014-6","relation":{},"ISSN":["1641-876X"],"issn-type":[{"value":"1641-876X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3,1]]}}}