<?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-2019-2-203-212</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1212</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>Computer System Organization</subject></subj-group></article-categories><title-group><article-title>На пути к SD-WAN решению</article-title><trans-title-group xml:lang="en"><trans-title>On the Way to SD-WAN Solution</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2349-7980</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Корсаков</surname><given-names>Станислав Валентинович</given-names></name><name name-style="western" xml:lang="en"><surname>Korsakov</surname><given-names>Stanislav V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Директор, ООО «Нетше лаб»; ассистент кафедры теоретической информатики, ЯГУ им. П.Г. Демидова.</p><p>Ул. Белинского, 28-75, Ярославль, 15004,7;иул. Советская, 14, Ярославль, 150003</p></bio><bio xml:lang="en"><p>CEO, NETSHe Lab Ltd; Assistant Professor .G. Demidov YSU.</p><p>Belinskogo str., 28-75, Yaroslavl, 150047; 14 Sovetskaya str., Yaroslavl, 150003</p></bio><email xlink:type="simple">sta@stasoft.net</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1427-4937</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Соколов</surname><given-names>Валерий Анатольевич</given-names></name><name name-style="western" xml:lang="en"><surname>Sokolov</surname><given-names>Valery A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Доктор физико-математических наук, профессор, заведующий кафедрой теоретической информатики.</p><p>Ул. Советская, 14, г. Ярославль, 150003</p></bio><bio xml:lang="en"><p>Doctor, Professor.</p><p>14 Sovetskaya str., Yaroslavl, 150003</p></bio><email xlink:type="simple">valery-sokolov@yandex.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>«Нетше лаб», ООО; Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>NETSHe Lab Ltd; P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><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>2019</year></pub-date><pub-date pub-type="epub"><day>28</day><month>06</month><year>2019</year></pub-date><volume>26</volume><issue>2</issue><fpage>203</fpage><lpage>212</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Корсаков С.В., Соколов В.А., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Корсаков С.В., Соколов В.А.</copyright-holder><copyright-holder xml:lang="en">Korsakov S.V., Sokolov V.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/1212">https://www.mais-journal.ru/jour/article/view/1212</self-uri><abstract><p>В статье описываются предпосылки и некоторые этапы реализации промышленного решения по построению управляемой ячеистой оверлейной сети поверх полностью или частично неуправляемой опорной сети. Оверлейная сеть имеет (или может иметь) некоторые функции из мира программно-определяемых сетей. Мы называем это решение SD-WANLite, чтобы подчеркнуть, что это решение не является (и не будет в обозримом будущем) полным SD-WAN решением.</p></abstract><trans-abstract xml:lang="en"><p>The article describes a background and some steps in the implementation of an industrial solution to build manageable mesh overlay network on top of a complete or partially non-manageable underlay network. The overlay network has (or may have) some features from the software defined networks world. We call this solution as SD-WAN Lite to highlight that this solution is not (and will not be in a visible future) a complete SD-WAN solution.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>программно-определяемые сети</kwd><kwd>ячеистые сети</kwd><kwd>протокол маршрутизации</kwd><kwd>сетевой узел</kwd><kwd>зашифрованное соединение данных</kwd><kwd>общий протокол инкапсуляции маршрутизатора</kwd><kwd>многоточечный GRE туннель</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена при финансовой поддержке РФФИ в рамках научного проекта №17-07-00823-a</funding-statement><funding-statement xml:lang="en">This work was supported by RFBR under the Grant №17-07-00823-a</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Luciani J., Katz D., Piscitello D., Cole B., Doraswamy N., “RFC 2332: NBMA Next Hop Resolution Protocol (NHRP)”, IETF, April, 1998, https://tools.ietf.org/html/rfc2332.</mixed-citation><mixed-citation xml:lang="en">Luciani J., Katz D., Piscitello D., Cole B., Doraswamy N., “RFC 2332: NBMA Next Hop Resolution Protocol (NHRP)”, IETF, April, 1998, https://tools.ietf.org/html/rfc2332.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Fox B., Petri B., “RFC 2735: NHRP Support for Virtual Private Networks”, Request for Comments,’Online, 1999, https://tools.ietf.org/html/rfc2735.</mixed-citation><mixed-citation xml:lang="en">Fox B., Petri B., “RFC 2735: NHRP Support for Virtual Private Networks”, Request for Comments,’Online, 1999, https://tools.ietf.org/html/rfc2735.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Cisco. Dynamic Multipoint VPN Configuration guide., https://www.cisco.com/c/en/us/td/docs/ios-xml/ios/sec_conn_dmvpn/configuration/xe-16/sec-conn-dmvpn-xe-16-book.html.</mixed-citation><mixed-citation xml:lang="en">Cisco. Dynamic Multipoint VPN Configuration guide., https://www.cisco.com/c/en/us/td/docs/ios-xml/ios/sec_conn_dmvpn/configuration/xe-16/sec-conn-dmvpn-xe-16-book.html.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Katz D.,Kompella K., Yeung D., “RFC 3630: Traffic Engineering (TE) Extensions to OSPF Version 2”, Internet RFCs, 1 (2003), 1, https://tools.ietf.org/html/rfc3630.</mixed-citation><mixed-citation xml:lang="en">Katz D.,Kompella K., Yeung D., “RFC 3630: Traffic Engineering (TE) Extensions to OSPF Version 2”, Internet RFCs, 1 (2003), 1, https://tools.ietf.org/html/rfc3630.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Giacalone S., Ward D., Drake J., Atlas A., Previdi S., “RFC-7471. OSPF Traffic Engineering (TE) Metric Extensions”, 2015, https://tools.ietf.org/html/rfc7471.</mixed-citation><mixed-citation xml:lang="en">Giacalone S., Ward D., Drake J., Atlas A., Previdi S., “RFC-7471. OSPF Traffic Engineering (TE) Metric Extensions”, 2015, https://tools.ietf.org/html/rfc7471.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Retvari G., Cinkler T., “Practical OSPF traffic engineering”, IEEE Communications Letters, 8:11 (2004), 689-691.</mixed-citation><mixed-citation xml:lang="en">Retvari G., Cinkler T., “Practical OSPF traffic engineering”, IEEE Communications Letters, 8:11 (2004), 689-691.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Nemeth K., Korosi A., Retvari G., “Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing”, 2013 IFIP Networking Conference. - IEeE, 2013, 19, https://www.researchgate.net/publication/261208279_Optimal_OSPF_traffic_engineering_using_legacy_Equal_Cost_Multipath_load_balancing.</mixed-citation><mixed-citation xml:lang="en">Nemeth K., Korosi A., Retvari G., “Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing”, 2013 IFIP Networking Conference. - IEeE, 2013, 19, https://www.researchgate.net/publication/261208279_Optimal_OSPF_traffic_engineering_using_legacy_Equal_Cost_Multipath_load_balancing.</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>
