{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:41:18Z","timestamp":1760031678896,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The paper considers queuing networks with prohibitions on transitions between network nodes that determine the protocol of their operation. In the graph of transient network intensities, a set of base vertices is allocated (proportional to the number of edges), and we raise the question of whether some subset of it can be deleted such that the stationary distribution of the Markov process describing the functioning of the network is preserved. In order for this condition to be fulfilled, it is sufficient that the set of vertices of the graph of transient intensities, after the removal of a subset of the base vertices, coincide with the set of states of the Markov process and that this graph be connected. It is proved that the ratio of the number of remaining base vertices to their total number n converges to one-half for n\u2192\u221e. In this paper, we are looking for graphs of transient intensities with a minimum (in some sense) set of edges for open and closed service networks.<\/jats:p>","DOI":"10.3390\/computation13040089","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T16:26:31Z","timestamp":1743611191000},"page":"89","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Invariance of Stationary Distributions of Exponential Networks with Prohibitions and Determination of Maximum Prohibitions"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2600-0474","authenticated-orcid":false,"given":"Gurami","family":"Tsitsiashvili","sequence":"first","affiliation":[{"name":"Institute for Applied Mathematics, Far Eastern Branch of Russian Academy of Sciences, IAM FEB RAS, Radio Str. 7, 690041 Vladivostok, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5615-9449","authenticated-orcid":false,"given":"Marina","family":"Osipova","sequence":"additional","affiliation":[{"name":"Institute for Applied Mathematics, Far Eastern Branch of Russian Academy of Sciences, IAM FEB RAS, Radio Str. 7, 690041 Vladivostok, Russia"},{"name":"Institute for Applied Mathematics, Far Eastern Federal University, 690922 Vladivostok, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.17816\/transsyst20206115-29","article-title":"Comparative analysis of international transport systems: Infrastructure, ratings, transport corridors","volume":"6","author":"Kvitko","year":"2020","journal-title":"Transp. Syst. Technol."},{"key":"ref_2","first-page":"243","article-title":"Modern development trends and the importance of international transport corridors in the transport services market","volume":"6","author":"Komov","year":"2022","journal-title":"Econ. Entrep."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/1255421.1255424","article-title":"Toward a Commodity Enterprise Middleware: Can AMQP enable a new era in messaging middleware? A look inside standards-based messaging with AMQP","volume":"5","year":"2007","journal-title":"Queue"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gudehus, T., and Kotzab, H. (2012). Comprehensive Logistics, Springer Science and Business Media.","DOI":"10.1007\/978-3-642-24367-7"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.20410\/2073-7815-2019-30-5-101-108","article-title":"Topical issues of development of international transport corridors and realization of transport potential of Russia","volume":"30","author":"Konfino","year":"2019","journal-title":"Labour Soc. Relat. J."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/MIC.2006.116","article-title":"Advanced Message Queuing Protocol","volume":"10","author":"Vinoski","year":"2006","journal-title":"IEEE Internet Comput."},{"key":"ref_7","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":"48","author":"Balsamo","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018947410914","article-title":"A Convolution Algorithm for Product-form Queueing Networks with Blocking","volume":"79","author":"Balsamo","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"ref_9","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":"29","author":"Boucherie","year":"1997","journal-title":"Perform. Eval."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s11122-005-0021-7","article-title":"New multiplicative theorems for queuing networks","volume":"41","author":"Tsitsiashvili","year":"2005","journal-title":"Probl. Inf. Transm."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1134\/S0032946006020098","article-title":"Probabilistic distribution in queuing networks with variable structure","volume":"42","author":"Tsitsiashvili","year":"2006","journal-title":"Probl. Inf. Transm."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.5.4.518","article-title":"Networks of Waiting Lines","volume":"5","author":"Jackson","year":"1957","journal-title":"Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.15.2.254","article-title":"Closed Queuing Systems with Exponential Servers","volume":"15","author":"Gordon","year":"1967","journal-title":"Oper. Res."},{"key":"ref_14","unstructured":"Balbo1, G., Marin, A., Olliaro, D., and Sereno, M. (2024). Computational Algorithms for the Product Form Solution of Closed Queuing Networks with Finite Buffers and Skip-Over Policy. arXiv."},{"key":"ref_15","unstructured":"Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N. (1982). Theory of Queuing: A Textbook for Universities, Higher School. (In Russian)."},{"key":"ref_16","unstructured":"Kovalenko, I.N., Kuznetsov, N.Y., and Shurenkov, V.M. (1983). Random Processes, Naukova dumka. (In Russian)."},{"key":"ref_17","unstructured":"Stillwell, J. (2004). Mathematics and Its History, Springer Science and Business Media Inc.. [2nd ed.]."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/4\/89\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:07:44Z","timestamp":1760029664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/4\/89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,1]]},"references-count":17,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["computation13040089"],"URL":"https:\/\/doi.org\/10.3390\/computation13040089","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2025,4,1]]}}}