<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">45254</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2025-33-2-157-171</article-id><article-id pub-id-type="edn">MMCFUG</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Computer Science</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Информатика и вычислительная техника</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Business process analysis of university admissions: Combining TM Forum’s eTOM framework, discrete-event simulation, and queuing theory</article-title><trans-title-group xml:lang="ru"><trans-title>Анализ процесса приема в университет: применение карты TM Forum eTOM, имитационного моделирования и сети массового обслуживания</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0005-4379-3017</contrib-id><name-alternatives><name xml:lang="en"><surname>Terentyev</surname><given-names>Konstantin M.</given-names></name><name xml:lang="ru"><surname>Терентьев</surname><given-names>К. М.</given-names></name></name-alternatives><bio xml:lang="en"><p>Ph.D. student of the Department of Probability Theory and Cyber Security; Director of the Department of Digitalization and Digital Transformation</p></bio><email>terentyev-km@rudn.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0007-0084-0201</contrib-id><name-alternatives><name xml:lang="en"><surname>Abuzyarova</surname><given-names>Leyla D.</given-names></name><name xml:lang="ru"><surname>Абузярова</surname><given-names>Л. Д.</given-names></name></name-alternatives><bio xml:lang="en"><p>M.Sc. student of the Department of Probability Theory and Cyber Security</p></bio><email>d.abuzyarova@yandex.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1594-427X</contrib-id><contrib-id contrib-id-type="scopus">35332169400</contrib-id><contrib-id contrib-id-type="researcherid">E-3806-2014</contrib-id><name-alternatives><name xml:lang="en"><surname>Kochetkova</surname><given-names>Irina A.</given-names></name><name xml:lang="ru"><surname>Кочеткова</surname><given-names>И. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Assosiate Professor of the Department of Probability Theory and Cyber Security, RUDN University; Senior Researcher, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences</p></bio><email>kochetkova-ia@rudn.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6368-9680</contrib-id><contrib-id contrib-id-type="scopus">14009785000</contrib-id><contrib-id contrib-id-type="researcherid">E-9966-2014</contrib-id><name-alternatives><name xml:lang="en"><surname>Samouylov</surname><given-names>Konstantin E.</given-names></name><name xml:lang="ru"><surname>Самуйлов</surname><given-names>К. Е.</given-names></name></name-alternatives><bio xml:lang="en"><p>Professor, Doctor of Technical Sciences, Head of the Department of Probability Theory and Cyber Security, RUDN University; Senior Researcher, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences</p></bio><email>samuylov-ke@rudn.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">RUDN University</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов имени Патриса Лумумбы</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences</institution></aff><aff><institution xml:lang="ru">Федеральный исследовательский центр «Информатика и управление» Российской академии наук</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-07-15" publication-format="electronic"><day>15</day><month>07</month><year>2025</year></pub-date><volume>33</volume><issue>2</issue><issue-title xml:lang="en">VOL 33, NO2 (2025)</issue-title><issue-title xml:lang="ru">ТОМ 33, №2 (2025)</issue-title><fpage>157</fpage><lpage>171</lpage><history><date date-type="received" iso-8601-date="2025-07-25"><day>25</day><month>07</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Terentyev K.M., Abuzyarova L.D., Kochetkova I.A., Samouylov K.E.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Терентьев К.М., Абузярова Л.Д., Кочеткова И.А., Самуйлов К.Е.</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Terentyev K.M., Abuzyarova L.D., Kochetkova I.A., Samouylov K.E.</copyright-holder><copyright-holder xml:lang="ru">Терентьев К.М., Абузярова Л.Д., Кочеткова И.А., Самуйлов К.Е.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/45254">https://journals.rudn.ru/miph/article/view/45254</self-uri><abstract xml:lang="en"><p>The increasing complexity of university admissions requires efficient, standardized processes to manage large volumes of applications and changing regulatory requirements. To address this, the paper applies the TM Forum’s Business Process Framework (eTOM) from the telecommunications industry, a standard for modeling and optimizing academic admissions workflows. Using RUDN University as a case study, the entire admissions process is formalized into a hierarchical model that aligns with the eTOM level 2 processes. The approach integrates discrete-event simulation (DES) and queueing network analysis, providing detailed process modeling and analytical solutions for assessing the average execution time. DES replicates the dynamic interactions between applicants and staff. Queueing analysis provides mathematical model to analyze the average execution times for each step in the process. Together, these techniques help optimize the admissions process and ensure efficient management of large volumes of applications. Through this approach, we aim to streamline processes, increase transparency, and support digital transformation efforts within universities.</p></abstract><trans-abstract xml:lang="ru"><p>С каждым годом процессы поступления в университеты становятся все более сложными. Для управления большим количеством заявок и постоянно меняющимися требованиями законодательства необходимы эффективные методы. В статье используется модель бизнес-процессов Forum eTOM, которая изначально была разработана для телекоммуникационной отрасли, для моделирования и оптимизации приемной кампании. На примере Российского университета дружбы народов имени Патриса Лумумбы (РУДН) показано, как можно формализовать весь процесс поступления в виде иерархической модели, соответствующей уровням eTOM. Методология объединяет два подхода: дискретно-событийное моделирование позволяет детально анализировать динамические взаимодействия между абитуриентами и сотрудниками, а сеть массового обслуживания дает возможность оценить среднее время выполнения процесса. Проведен анализ реального сценария обработки заявок, учитывая ограничения ресурсов. Совместное использование этих методов помогает выявить узкие места, такие как ручная проверка документов, и предложить решения для их устранения. Предложенный подход способствует стандартизации процессов, повышает прозрачность операций и поддерживает цифровую трансформацию университетов. Его можно адаптировать для других учебных заведений, обеспечивая эффективное управление приемными кампаниями в условиях растущих требований к автоматизации и масштабируемости.</p></trans-abstract><kwd-group xml:lang="en"><kwd>university admissions</kwd><kwd>business process</kwd><kwd>TM Forum</kwd><kwd>business process framework</kwd><kwd>eTOM</kwd><kwd>discrete-event simulation</kwd><kwd>DES</kwd><kwd>queuing network</kwd><kwd>RUDN University</kwd><kwd>TM Forum</kwd><kwd>eTOM</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>университет</kwd><kwd>приемная кампания университета</kwd><kwd>бизнес-процесс</kwd><kwd>карта процессов</kwd><kwd>имитационное моделирование</kwd><kwd>сеть массового обслуживания</kwd><kwd>РУДН</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Kiaghadi, M. &amp; Hoseinpour, P. University admission process: A prescriptive analytics approach. Artificial Intelligence Review 56, 233-256. doi:10.1007/s10462-022-10171-y (2023).</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Roudnitski, A. University admissions mechanism: Theoretical analysis with application to Russian universities. HSE Economic Journal 27, 594-610. doi:10.17323/1813-8691-2023-27-4-594-610 (2023).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Shao, L., Levine, R. A., Hyman, S., Stronach, J. &amp; Fan, J. A combinatorial optimization framework for scoring students in university admissions. Evaluation Review 46, 296-335. doi:10.1177/0193841X221082887 (2022).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>For Europe, U. N. E. C. Sustainable Development Goals https://w3.unece.org/SDG/en. Accessed: 2025-03-01.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Tampieri, A. University admission: Is achievement a sufficient criterion? B.E. Journal of Economic Analysis and Policy 24, 799-833. doi:10.1515/bejeap-2023-0260 (2024).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Mengash, H. A. Using data mining techniques to predict student performance to support decision making in university admission systems. IEEE Access 8, 55462-55470. doi:10.1109/ACCESS.2020.2981905 (2020).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Forum, T. Business Process Framework (eTOM) https ://www.tmforum.org/oda/business-architecture-framework/process-framework-etom/. Accessed: 2025-03-01.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Horiuchi, S. &amp; Tayama, K. Latest activities in TM Forum. NTT Technical Review 19, 75-80. doi:10. 53829/ntr202107gls (2021).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Suzuki, A., Kashibuchi, K. &amp; Nakamura, T. Activities toward TM Forum Frameworx 17.0 and TM Forum Live! 2017 report. NTT Technical Review 16. doi:10.53829/ntr201801gls (2023).</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Horiuchi, S. &amp; Tayama, K. Efforts by TM Forum, an operation standards organization. NTT Technical Review 21, 53-58. doi:10.53829/ntr202307gls (2023).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Samouylov, K., Gaidamaka, Y. &amp; Zaripova, E. Analysis of business process execution time with queueing theory models. Communications in Computer and Information Science 638, 315-326. doi:10.1007/978-3-319-44615-8_28 (2016).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Yarkina, N., Popovskaya, N., Khalina, V., Gaidamaka, A. &amp; Samouylov, K. Modeling end-to-end business processes of a telecom company with a BCMP queueing network. Communications in Computer and Information Science 800, 279-296. doi:10.1007/978-3-319-68069-9_23 (2017).</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Fernandes, C. &amp; Cruz, R. A business processes model for the integration of over-the-top platforms in communications service providers operations. Journal of Information Systems Engineering and Management 6. doi:10.29333/jisem/9570 (2021).</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Dachyar, M., Zagloel, T. Y. M. &amp; Saragih, L. R. Enterprise architecture breakthrough for telecommunications transformation: A reconciliation model to solve bankruptcy. Heliyon 6. doi:10.1016/j.heliyon.2020.e05273 (2020).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>University, R. Admission committee https://admission.rudn.ru/. Accessed: 2025-03-01.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>University, R. Electronic examination support system https://esse.rudn.ru/?lang=en. Accessed: 2025-03-01.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Computer science DCM&amp;ACS. 2025, 33 (2), 157-171 image</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Ivleva, M., Nezhnikova, E. &amp; Safronova, N. The study of the impact of coaching on the efficiency of learning in the higher education. RUDN Journal of Sociology 24, 523-538. doi:10.22363/2313-2272-2024-24-2-523-538 (2024).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Of Tartu, U. BIMP simulator https://bimp.cs.ut.ee/simulator/. Accessed: 2025-03-01.</mixed-citation></ref></ref-list></back></article>
