{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:59:16Z","timestamp":1774421956708,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030308582","type":"print"},{"value":"9783030308599","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30859-9_26","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T08:03:26Z","timestamp":1568189006000},"page":"305-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Preemptive Priority Queuing System with Randomized Push-Out Mechanism and Negative Customers"],"prefix":"10.1007","author":[{"given":"Polina","family":"Shorenko","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4836-3524","authenticated-orcid":false,"given":"Oleg","family":"Zayats","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1361-9000","authenticated-orcid":false,"given":"Alexander","family":"Ilyashenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3583-7324","authenticated-orcid":false,"given":"Vladimir","family":"Muliukha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"26_CR1","unstructured":"Vishnevsky, V.M.: Theoretical bases of designing computer networks. Technosphere, Moscow (2003)"},{"issue":"1","key":"26_CR2","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":"26_CR3","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10353-2_38"},{"issue":"1\/3","key":"26_CR4","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":"26_CR5","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23126-6_38"},{"key":"26_CR6","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-46301-8_19"},{"key":"26_CR7","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":"26_CR8","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67380-6_39"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.procs.2019.02.016","volume":"150","author":"M Korenevskaya","year":"2019","unstructured":"Korenevskaya, M., Zayats, O., Ilyashenko, A., Muliukha, V.: Retrial queueing system with randomized push-out mechanism and non-preemptive priority. Procedia Comput. Sci. 150, 716\u2013725 (2019)","journal-title":"Procedia Comput. Sci."},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-030-01168-0_22","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"M Korenevskaya","year":"2018","unstructured":"Korenevskaya, M., Zayats, O., Ilyashenko, A., Muliukha, V.: The phenomenon of secondary flow explosion in retrial priority queueing system with randomized push-out mechanism. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN\/ruSMART -2018. LNCS, vol. 11118, pp. 236\u2013246. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-01168-0_22"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.peva.2010.10.001","volume":"68","author":"TV Do","year":"2011","unstructured":"Do, T.V.: An initiative for a classified bibliography on G-networks. Perform. Eval. 68(3), 385\u2013394 (2011)","journal-title":"Perform. Eval."},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.mcm.2010.08.006","volume":"53","author":"TV Do","year":"2011","unstructured":"Do, T.V.: Bibliography on G-networks, negative customers and applications. Math. Comput. Model. 53(2), 205\u2013212 (2011)","journal-title":"Math. Comput. Model."},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.2307\/3214499","volume":"28","author":"E Gelenbe","year":"1991","unstructured":"Gelenbe, E.: Product form networks with negative and positive customers. J. Appl. Probab. 28(3), 656\u2013663 (1991)","journal-title":"J. Appl. Probab."},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/3214756","volume":"28","author":"E Gelenbe","year":"1991","unstructured":"Gelenbe, E., Glynn, P., Siegman, K.: Queues with positive and negative arrivals. J. Appl. Probab. 28(3), 245\u2013250 (1991)","journal-title":"J. Appl. Probab."},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-319-23126-6_69","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"V Zaborovsky","year":"2015","unstructured":"Zaborovsky, V., Muliukha, V., Ilyashenko, A.: Cyber-physical approach in a series of space experiments \u201cKontur\u201d. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) ruSMART 2015. LNCS, vol. 9247, pp. 745\u2013758. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23126-6_69"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-10353-2_57","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"V Zaborovsky","year":"2014","unstructured":"Zaborovsky, V., Guk, M., Muliukha, V., Ilyashenko, A.: Cyber-physical approach to the network-centric robot control problems. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN 2014. LNCS, vol. 8638, pp. 619\u2013629. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10353-2_57"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30859-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T08:07:32Z","timestamp":1568189252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30859-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308582","9783030308599"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30859-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rusmart.e-werest.org\/2019.html","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 (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"144","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}