{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:59:15Z","timestamp":1774421955239,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030011673","type":"print"},{"value":"9783030011680","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01168-0_22","type":"book-chapter","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:03:17Z","timestamp":1538092997000},"page":"236-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Phenomenon of Secondary Flow Explosion in Retrial Priority Queueing System with Randomized Push-Out Mechanism"],"prefix":"10.1007","author":[{"given":"Maria","family":"Korenevskaya","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Zayats","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Ilyashenko","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Muliukha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"key":"22_CR1","volume-title":"Theoretical Bases if Designing Computer Networks","author":"VM Vishnevsky","year":"2003","unstructured":"Vishnevsky, V.M.: Theoretical Bases if Designing Computer Networks. Technosphere, Moscow (2003)"},{"key":"22_CR2","volume-title":"Network computers","author":"AS Tanenbaum","year":"2011","unstructured":"Tanenbaum, A.S., Wetherall, D.J.: Network computers. Prentice Hall, Boston (2011)"},{"key":"22_CR3","volume-title":"Priority queues","author":"NK Jaiswal","year":"1968","unstructured":"Jaiswal, N.K.: Priority queues. Academic Press, New York (1968)"},{"key":"22_CR4","unstructured":"Basharin, G.P.: Some Results for Priority Systems. Queueing Theory in Data Transfer Analysis, pp. 39\u201353. Nauka, Moscow (1969). (in Russian)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1023\/B:JOTH.0000031879.84592.31","volume":"22","author":"KE Avrachenkov","year":"2004","unstructured":"Avrachenkov, K.E., Shevlyakov, G.L., Vilchevsky, N.O.: Randomized push-out disciplines in priority queueing. J. Math. Sci. 22(4), 3336\u20133343 (2004)","journal-title":"J. Math. Sci."},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.peva.2004.08.006","volume":"61","author":"KE Avrachenkov","year":"2005","unstructured":"Avrachenkov, K.E., Vilchevsky, N.O., Shevlyakov, G.L.: Priority queueing with finite buffer size and randomized push-out mechanism. Perform. Eval. 61(1), 1\u201316 (2005)","journal-title":"Perform. Eval."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-10353-2_38","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"A Ilyashenko","year":"2014","unstructured":"Ilyashenko, A., Zayats, O., Muliukha, V., Laboshin, L.: Further investigations of the priority queuing system with preemptive priority and randomized push-out mechanism. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN 2014. LNCS, vol. 8638, pp. 433\u2013443. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10353-2_38"},{"issue":"1\/3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.cnsns.2014.08.020","volume":"21","author":"V Muliukha","year":"2015","unstructured":"Muliukha, V., Ilyashenko, A., Zayats, O., Zaborovsky, V.: Preemptive queueing system with randomized push-out mechanism. Commun. Nonlinear Sci. Numer. Simul. 21(1\/3), 147\u2013158 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-319-23126-6_38","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"A Ilyashenko","year":"2015","unstructured":"Ilyashenko, A., Zayats, O., Muliukha, V., Lukashin, A.: Alternating priorities queueing system with randomized push-out mechanism. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) ruSMART 2015. LNCS, vol. 9247, pp. 436\u2013445. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23126-6_38"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-319-46301-8_19","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"A Ilyashenko","year":"2016","unstructured":"Ilyashenko, A., Zayats, O., Muliukha, V.: Randomized priorities in queuing system with randomized push-out mechanism. In: Galinina, O., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN\/ruSMART -2016. LNCS, vol. 9870, pp. 230\u2013237. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46301-8_19"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.procs.2017.01.061","volume":"103","author":"O Zayats","year":"2017","unstructured":"Zayats, O., Korenevskaya, M., Ilyashenko, A., Lukashin, A.: Retrial queueing systems in series of space experiments \u201cKontur\u201d. Procedia Comput. Sci. 103, 562\u2013568 (2017)","journal-title":"Procedia Comput. Sci."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-319-67380-6_39","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"A Ilyashenko","year":"2017","unstructured":"Ilyashenko, A., Zayats, O., Korenevskaya, M., Muliukha, V.: a retrial queueing system with Preemptive priority and randomized push-out mechanism. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN\/ruSMART\/NsCC -2017. LNCS, vol. 10531, pp. 432\u2013440. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67380-6_39"},{"key":"22_CR13","volume-title":"Catastrophe Theory","author":"VI Arnold","year":"2004","unstructured":"Arnold, V.I.: Catastrophe Theory. Springer, Berlin (2004)"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01168-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T23:57:48Z","timestamp":1544831868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01168-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011673","9783030011680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01168-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.new2an.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"186","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"64","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":"34% - 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":"6","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"}}]}}