<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2015-4-521-532</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-270</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Оригинальные статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Articles</subject></subj-group></article-categories><title-group><article-title>Разработка механизма адаптивной маршрутизации трафика в программно-конфигурируемых сетях</article-title><trans-title-group xml:lang="en"><trans-title>Development of an Adaptive Routing Mechanism in Software-Deﬁned Networks</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Носков</surname><given-names>А. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Noskov</surname><given-names>A. N.</given-names></name></name-alternatives><bio xml:lang="ru"><p>старший преподаватель</p><p>ул. Советская, 14, г. Ярославль, 150000 Россия</p></bio><bio xml:lang="en"><p>Lecturer</p><p>Sovetskaya str., 14, Yaroslavl, 150000, Russia</p></bio><email xlink:type="simple">lantoni@uniyar.ac.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Манов</surname><given-names>И. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Manov</surname><given-names>I. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p><p>ул. Советская, 14, г. Ярославль, 150000 Россия</p></bio><bio xml:lang="en"><p> magister</p><p>Sovetskaya str., 14, Yaroslavl, 150000, Russia</p></bio><email xlink:type="simple">ivanmanov@live.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>20</day><month>08</month><year>2015</year></pub-date><volume>22</volume><issue>4</issue><fpage>521</fpage><lpage>532</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Носков А.Н., Манов И.А., 2015</copyright-statement><copyright-year>2015</copyright-year><copyright-holder xml:lang="ru">Носков А.Н., Манов И.А.</copyright-holder><copyright-holder xml:lang="en">Noskov A.N., Manov I.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/270">https://www.mais-journal.ru/jour/article/view/270</self-uri><abstract><p>Цель данной работы – разработать единый механизм адаптивной маршрутизации трафика различного рода, опираясь на текущие требования к качеству предоставления сервисов.Программное конфигурирование сети – это технологии будущего. Современная тенденция развития систем связи постоянно подтверждает этот факт. Однако на сегодняшний день применение этой технологии в ее текущем виде оправдано лишь в больших сетях технологических гигантов и операторов связи. К настоящему времени создано большое количество динамических протоколов маршрутизации трафика в сетях связи. Наша задача создать такое решение, которое сможет использовать возможности каждого узла принимать решение о передаче информации всеми возможными способами для каждого типа трафика. Достижение поставленной цели возможно путем решения задачи разработки обобщенной метрики, подробно характеризующей каналы связи между устройствами в сети, и задачи разработки механизма адаптивного перестроения логической топологии сети (управления маршрутами) для обеспечения качественной работы всей сети в целях удовлетворения текущим требованиям к качеству предоставления того или иного вида сервиса.</p></abstract><trans-abstract xml:lang="en"><p>The purpose of this work is to develop a unitary mechanism of adaptive routing of diﬀerent kinds, basing on the current requirements on the quality of service. The software conﬁguration of a network is the technology of the future. The trend in communication systems constantly conﬁrms this fact. However, the application of this technology in its current form is justiﬁed only in large networks of technology giants and telecom operators. Today we have a large number of dynamic routing protocols to route big volume traﬃc in communication networks. Our task is to create the solution that can use the opportunities of each node to make a decision on the transmission of information by all possible means for each type of traﬃc. Achieving this goal is possible by solving the problem of the development of generalized metrics, which details the links between devices in the network, and the problem of establishing a framework of adaptive logical network topology (route management) to ensure the quality of the whole network in order to meet the current requirements on the quality of a particular type service.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>программно-конфигурируемые сети</kwd><kwd>информационный поток</kwd></kwd-group><kwd-group xml:lang="en"><kwd>software deﬁned network</kwd><kwd>information ﬂow</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">ITU-T. Recommendation Y.1540 Internet protocol aspects – Quality of service and network performance, 2011.</mixed-citation><mixed-citation xml:lang="en">ITU-T. Recommendation Y.1540 Internet protocol aspects – Quality of service and network performance, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">ITU-T. Recommendation Y.1541 Network Performance Objectives for IP-Based Services, 2011.</mixed-citation><mixed-citation xml:lang="en">ITU-T. Recommendation Y.1541 Network Performance Objectives for IP-Based Services, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">ITU-T. Y.1541: Network performance objectives for IP-based services.</mixed-citation><mixed-citation xml:lang="en">ITU-T. Y.1541: Network performance objectives for IP-based services.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">John F. Buford, Heather Yu, Eng Lua, P2P Networking and Applications, The Morgan Kaufmann Series in Networking, 2009.</mixed-citation><mixed-citation xml:lang="en">John F. Buford, Heather Yu, Eng Lua, P2P Networking and Applications, The Morgan Kaufmann Series in Networking, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Luc De Ghein, MPLS Fundamentals, Cisco Press, 2006.</mixed-citation><mixed-citation xml:lang="en">Luc De Ghein, MPLS Fundamentals, Cisco Press, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Thomas D. Nadeau, Ken Gray, SDN: Software Deﬁned Networks, O’Reilly Media, 2013.</mixed-citation><mixed-citation xml:lang="en">Thomas D. Nadeau, Ken Gray, SDN: Software Deﬁned Networks, O’Reilly Media, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Вешегна Ш., Качество облуживания в IP-сетях, Cisco Press, 2003, 356 с.; [Veshegna Sh., Kachestvo obslujivaniya v IP-setyah, Cisco Press, 2003, 356 pp., (in Russian).]</mixed-citation><mixed-citation xml:lang="en">Вешегна Ш., Качество облуживания в IP-сетях, Cisco Press, 2003, 356 с.; [Veshegna Sh., Kachestvo obslujivaniya v IP-setyah, Cisco Press, 2003, 356 pp., (in Russian).]</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Blei D. M., Ng A. Y., Jordan M. I., “Latent Dirichlet Allocation”, Journal of Machine Learning Research, 3 (2002), 993–1022.</mixed-citation><mixed-citation xml:lang="en">Blei D. M., Ng A. Y., Jordan M. I., “Latent Dirichlet Allocation”, Journal of Machine Learning Research, 3 (2002), 993–1022.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Daud A, Li J. ,Zhou L., Muhammad F., “Knowledge discovery through directed probabilistic topic models”, Frontiers of Computer Science in China, 4:2 (2010), 280–301.</mixed-citation><mixed-citation xml:lang="en">Daud A, Li J. ,Zhou L., Muhammad F., “Knowledge discovery through directed probabilistic topic models”, Frontiers of Computer Science in China, 4:2 (2010), 280–301.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Gelman A., Carlin J. B., Stern H. S., Rubin D. B., Bayesian Data Analysis, Chapman and Hall/CRC, 2013.</mixed-citation><mixed-citation xml:lang="en">Gelman A., Carlin J. B., Stern H. S., Rubin D. B., Bayesian Data Analysis, Chapman and Hall/CRC, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Vapnik V., Statistical Learning Theory, Wiley, 1998.</mixed-citation><mixed-citation xml:lang="en">Vapnik V., Statistical Learning Theory, Wiley, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Ferguson T. S., “A bayesian analysis of some nonparametric problems”, The Annals of Statistics, 1:2 (1973), 209–230.</mixed-citation><mixed-citation xml:lang="en">Ferguson T. S., “A bayesian analysis of some nonparametric problems”, The Annals of Statistics, 1:2 (1973), 209–230.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kintsch W., Handbook of Latent Semantic Analysis, Erlbaum, Hillsdale, NJ, 2007.</mixed-citation><mixed-citation xml:lang="en">Kintsch W., Handbook of Latent Semantic Analysis, Erlbaum, Hillsdale, NJ, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Knorr E. M., Ng R. T., “Algorithms for Mining Distance-Based Outliers in Large</mixed-citation><mixed-citation xml:lang="en">Knorr E. M., Ng R. T., “Algorithms for Mining Distance-Based Outliers in Large</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Datasets”, Proceedings of the 24th International Conference on Very Large Data Bases, 1 (1998), 392–403.</mixed-citation><mixed-citation xml:lang="en">Datasets”, Proceedings of the 24th International Conference on Very Large Data Bases, 1 (1998), 392–403.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Knorr E. M., Ng R. T., “Finding Intensional Knowledge of Distance-based Outliers”, Proceedings of the 25th International Conference on Very Large Data Bases, 1 (1999), 211–222.</mixed-citation><mixed-citation xml:lang="en">Knorr E. M., Ng R. T., “Finding Intensional Knowledge of Distance-based Outliers”, Proceedings of the 25th International Conference on Very Large Data Bases, 1 (1999), 211–222.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Minka T., Laﬀerty J., “Expectation-propagation for the generative aspect model”, Proceedings of the 18th Conference on Uncertainty in Artiﬁcial Intelligence, 2002.</mixed-citation><mixed-citation xml:lang="en">Minka T., Laﬀerty J., “Expectation-propagation for the generative aspect model”, Proceedings of the 18th Conference on Uncertainty in Artiﬁcial Intelligence, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Saurabh Ganeriwal, Laura K. Balzano, Mani B., “Reputation-based Framework for High Integrity Sensor Networks”, ACM Transactions on Sensor Networks, 5 (2007).</mixed-citation><mixed-citation xml:lang="en">Saurabh Ganeriwal, Laura K. Balzano, Mani B., “Reputation-based Framework for High Integrity Sensor Networks”, ACM Transactions on Sensor Networks, 5 (2007).</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Paramasivan B. A, Prakash M. J, Kaliappan M., “Development of a secure routing protocol using game theory model in mobile ad hoc networks”, Journal of Communications and Networks, 1:15 (2015), 75–83.</mixed-citation><mixed-citation xml:lang="en">Paramasivan B. A, Prakash M. J, Kaliappan M., “Development of a secure routing protocol using game theory model in mobile ad hoc networks”, Journal of Communications and Networks, 1:15 (2015), 75–83.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Samsudin N. A. a, Bradley A. P. b, “Extended na?ve bayes for group based classiﬁcation Advances in Intelligent Systems and Computing”, 1st International Conference on Soft Computing and Data Mining, 287 (2014), 497–506.</mixed-citation><mixed-citation xml:lang="en">Samsudin N. A. a, Bradley A. P. b, “Extended na?ve bayes for group based classiﬁcation Advances in Intelligent Systems and Computing”, 1st International Conference on Soft Computing and Data Mining, 287 (2014), 497–506.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Jolliﬀe I. T., Principal components analysis, Springer-Verlag, New York, 1986.</mixed-citation><mixed-citation xml:lang="en">Jolliﬀe I. T., Principal components analysis, Springer-Verlag, New York, 1986.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Shipman C. M., Hopkinson K. M., Lopez J., “Con-resistant trust for improved reliability in a smart-grid special protection system”, IEEE Transactions on Power Delivery, 13:1 (2015), 455–462</mixed-citation><mixed-citation xml:lang="en">Shipman C. M., Hopkinson K. M., Lopez J., “Con-resistant trust for improved reliability in a smart-grid special protection system”, IEEE Transactions on Power Delivery, 13:1 (2015), 455–462</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
