{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:14:09Z","timestamp":1743156849204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030219512"},{"type":"electronic","value":"9783030219529"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21952-9_28","type":"book-chapter","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T23:09:30Z","timestamp":1560812970000},"page":"387-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A System with Warm Standby"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1591-0248","authenticated-orcid":false,"given":"Galina","family":"Zverkina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10958-016-3015-7","volume":"218","author":"LG Afanasyeva","year":"2016","unstructured":"Afanasyeva, L.G., Tkachenko, A.V.: On the convergence rate for queueing and reliability models described by regenerative processes. J. Math. Sci. 218(2), 119\u201336 (2016)","journal-title":"J. Math. Sci."},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/b97236","volume-title":"Applied Probability and Queues","author":"S Asmussen","year":"2003","unstructured":"Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003). https:\/\/doi.org\/10.1007\/b97236","edition":"2"},{"key":"28_CR3","volume-title":"Mathematical Methods of Reliability Theory","author":"BV Gnedenko","year":"2014","unstructured":"Gnedenko, B.V., Belyayev, Y.K., Solovyev, A.D.: Mathematical Methods of Reliability Theory. Academic Press, Cambridge (2014)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queuing Theory. In: Mathematical Modeling, Birkhaeuser Boston, Boston (1989)","DOI":"10.1007\/978-1-4615-9826-8"},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00539434","volume":"31","author":"D Griffeath","year":"1975","unstructured":"Griffeath, D.: A maximal coupling for Markov chains. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 31(2), 95\u2013106 (1975)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"28_CR6","first-page":"77","volume":"2","author":"W Doeblin","year":"1938","unstructured":"Doeblin, W.: Expos\u00e9 de la th\u00e9orie des cha\u00eenes simples constantes de Markov \u00e0 un nombre fini d\u2019\u00e9tats. Rev. Math. de l\u2019Union Interbalkanique 2, 77\u2013105 (1938)","journal-title":"Rev. Math. de l\u2019Union Interbalkanique"},{"key":"28_CR7","volume-title":"Stochastic Processes","author":"JL Doob","year":"1953","unstructured":"Doob, J.L.: Stochastic Processes. Wiley, Hoboken (1953)"},{"key":"28_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-319-66836-9_30","volume-title":"Distributed Computer and Communication Networks","author":"EY Kalimulina","year":"2017","unstructured":"Kalimulina, E.Y.: Analysis of unreliable open queueing network with dynamic routing. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2017. CCIS, vol. 700, pp. 355\u2013367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66836-9_30"},{"key":"28_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-51917-3_23","volume-title":"Distributed Computer and Communication Networks","author":"EY Kalimulina","year":"2016","unstructured":"Kalimulina, E.Y.: Rate of convergence to stationary distribution for unreliable Jackson-type queueing network with dynamic routing. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 253\u2013265. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-51917-3_23"},{"key":"28_CR10","unstructured":"Kato, K.: Coupling Lemma and Its Application to The Security Analysis of Quantum Key Distribution. Tamagawa University Quantum ICT Research Institute Bulletin, vol. 4, no. 1, pp. 23\u201330 (2014)"},{"key":"28_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2224-8_19","volume-title":"Probability Towards 2000","author":"H Thorisson","year":"2000","unstructured":"Thorisson, H.: Coupling. In: Accardi, L., Heyde, C.C. (eds.) Probability Towards 2000, vol. 128. Springer, New York (2000). https:\/\/doi.org\/10.1007\/978-1-4612-2224-8_19"},{"issue":"9","key":"28_CR12","doi-asserted-by":"publisher","first-page":"3518","DOI":"10.1016\/j.spa.2013.04.016","volume":"123","author":"A Veretennikov","year":"2013","unstructured":"Veretennikov, A., Butkovsky, O.A.: On asymptotics for Vaserstein coupling of Markov chains. Stoch. Process. Appl. 123(9), 3518\u20133541 (2013)","journal-title":"Stoch. Process. Appl."},{"key":"28_CR13","first-page":"479","volume":"20","author":"AY Veretennikov","year":"2014","unstructured":"Veretennikov, A.Y., Zverkina, G.A.: Simple proof of Dynkin\u2019s formula for single-server systems and polynomial convergence rates. Markov Process. Relat. Fields 20, 479\u2013504 (2014)","journal-title":"Markov Process. Relat. Fields"},{"key":"28_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-51917-3_34","volume-title":"Distributed Computer and Communication Networks","author":"G Zverkina","year":"2016","unstructured":"Zverkina, G.: On strong bounds of rate of convergence for regenerative processes. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 381\u2013393. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-51917-3_34"},{"key":"28_CR15","unstructured":"Zverkina G.: About some extended Erlang-Sevast\u2019yanov queueing system and its convergence rate (English and Russian versions). https:\/\/arxiv.org\/abs\/1805.04915. Fundamentalnaya i Prikladnaya Matematika, 2018, No 22, issue 3 - in print"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Stoyan, D.: Qualitative Eigenschaften und Abschtzungen stochastischer Modelle. Berlin (1977)","DOI":"10.1515\/9783112563762"}],"container-title":["Communications in Computer and Information Science","Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21952-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T12:05:08Z","timestamp":1685793908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21952-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030219512","9783030219529"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21952-9_28","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kamie\u0144 \u015al\u0105ski","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cn2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cn.polsl.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"eConf Web System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}