<?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-1-170-190</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1170</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>Анализ эффективности демультиплексирования транспортных потоков</article-title><trans-title-group xml:lang="en"><trans-title>On Analysis of Traffic Flow Demultiplexing Effectiveness</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-3649-0745</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>Stepanov</surname><given-names>Evgeniy P.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант</p><p>Ленинские горы, 1, стр. 52, г. Москва, 119991</p></bio><bio xml:lang="en"><p>graduate student</p><p>1, bd. 52 Leninskiye Gory, Moscow 119991</p></bio><email xlink:type="simple">estepanov@lvk.cs.msu.su</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>Lomonosov Moscow 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>15</day><month>03</month><year>2019</year></pub-date><volume>26</volume><issue>1</issue><fpage>170</fpage><lpage>190</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">Stepanov E.P.</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/1170">https://www.mais-journal.ru/jour/article/view/1170</self-uri><abstract><p>Известно, что разделение отдельного транспортного потока на несколько независимых транспортных подпотоков может повысить скорость этого потока. Справедливость этого утверждения, верная для одного потока, не очевидна для массового случая, когда демультиплексированию (разделению на подпотоки) подвергают все транспортные потоки в сети одного ISP оператора. Возникает вопрос, какое влияние окажет массовое демультиплексирование транспортных потоков на пропускную способность сети ISP оператора. В статье этот вопрос рассмотрен для статического случая, когда каждый поток разделяется статически, т.е. перед его запуском, на одинаковое число подпотоков. Была предложена математическая модель, на основе которой построена имитационная модель с целью получения более точных оценок производительности сети с демультиплексированием потоков и без него. С помощью имитационной модели определены свойства сети, при которых применение демультиплексирования транспортных потоков оправдано. Корректность полученных результатов обосновывается при помощи эмуляции сети и нагрузки в ней на основе виртуализации стека протоколов при тех же входных данных. В статье рассмотрены разные политики маршрутизации, которые могут быть использованы при массовом демультиплексировании. Особое внимание уделяется алгоритмам, позволяющим строить маршруты с минимальными пересечениями, так как использование неоптимальных по длине, но непересекающихся маршрутов может повысить производительность сети. Маршруты, построенные при помощи этих алгоритмов, использовались как для анализа производительности сети на предложенной имитационной модели с демультиплексированными потоками, так и в случае балансировки недемультиплексированных потоков.</p></abstract><trans-abstract xml:lang="en"><p>It is known that the demultiplexing of the individual traffic flow into several independent transport subflows can increase the speed of it. This statement is true for a single flow but its truth for the massive case, when demultiplexing technics are applied to all traffic flows in the network of a single Internet Service Provider (ISP), is not obvious. The question arises, what impact the massive demultiplexing of traffic flows will have on the whole ISP network bandwidth. In this paper, this question is considered for the static case, when each flow is demultiplexed statically, i.e. every flow before its launching is demultiplexed into the same number of subflows. We developed a mathematical model that was used to construct a simulation model in order to obtain more accurate estimates of the network performance with and without flow demultiplexing. Using simulation model, network properties are defined, under which the demultiplexing of traffic flows is justified. We proved the correctness of the obtained results by emulating a network load based on a protocol stack virtualization for the same input. We considered various routing policies that can be used for massive demultiplexing. Special attention is paid to algorithms that allow you to build routes with minimal intersections, since using the nonintersecting routes with non-optimal cost can increase the network performance. The routes constructed with these algorithms were used both for the network performance analysis with demultiplexed flows and in the case of balancing non-demultiplexed flows.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>многопоточная маршрутизация</kwd><kwd>качество сервиса</kwd><kwd>MPTCP</kwd></kwd-group><kwd-group xml:lang="en"><kwd>multipath routing</kwd><kwd>quality of service</kwd><kwd>MPTCP</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">РФФИ, грант № 18-07-01255</funding-statement><funding-statement xml:lang="en">Russian Fund of Basic Research (Project No. 18-07-01255)</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">Kim Bong Ho, Calin Doru, "On the Split-TCP Performance over Real 4G LTE and 3G Wireless Networks", IEEE Communications Magazine, 55:4 (2017), 124-131.</mixed-citation><mixed-citation xml:lang="en">Kim Bong Ho, Calin Doru, "On the Split-TCP Performance over Real 4G LTE and 3G Wireless Networks", IEEE Communications Magazine, 55:4 (2017), 124-131.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Chiesa M., Kindler G., Schapira M., "Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective", IEEE/ACM Transactions on Networking, 25:2 (2017), 779-792.</mixed-citation><mixed-citation xml:lang="en">Chiesa M., Kindler G., Schapira M., "Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective", IEEE/ACM Transactions on Networking, 25:2 (2017), 779-792.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Saltzer J. H., Reed D. P., Clark D. D., "End-to-end Arguments in System Design", ACM Trans. Comput. Syst., 2:4 (1984), 277-288.</mixed-citation><mixed-citation xml:lang="en">Saltzer J. H., Reed D. P., Clark D. D., "End-to-end Arguments in System Design", ACM Trans. Comput. Syst., 2:4 (1984), 277-288.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Curtis A. R., Kim W., Yalagandula P., "Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection", 2011 Proceedings IEEE INFOCOM, 2011, 1629-1637.</mixed-citation><mixed-citation xml:lang="en">Curtis A. R., Kim W., Yalagandula P., "Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection", 2011 Proceedings IEEE INFOCOM, 2011, 1629-1637.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Ford A., et al., RFC 6824: TCP Extensions for Multipath Operation with Multiple Addresses, 2013, 64 pp.</mixed-citation><mixed-citation xml:lang="en">Ford A., et al., RFC 6824: TCP Extensions for Multipath Operation with Multiple Addresses, 2013, 64 pp.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Raiciu C., et al., "How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP", Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), 2012, 399-412.</mixed-citation><mixed-citation xml:lang="en">Raiciu C., et al., "How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP", Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), 2012, 399-412.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Habib S., et al., "The Past, Present, and Future of Transport-Layer Multipath", 2016, https://arxiv.org/abs/1601.06043.</mixed-citation><mixed-citation xml:lang="en">Habib S., et al., "The Past, Present, and Future of Transport-Layer Multipath", 2016, https://arxiv.org/abs/1601.06043.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Boccassi L., Fayed M.M., Marina M.K., "Binder: A System to Aggregate Multiple Internet Gateways in Community Networks", Proceedings of the 2013 ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access, 2013, 3-8.</mixed-citation><mixed-citation xml:lang="en">Boccassi L., Fayed M.M., Marina M.K., "Binder: A System to Aggregate Multiple Internet Gateways in Community Networks", Proceedings of the 2013 ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access, 2013, 3-8.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Chemeritskiy E., Stepanov E., Smeliansky R., "Managing network resources with ow (de) multiplexing protocol", Mathematical and Computational Methods in Electrical Engineering, Recent Advances in Electrical Engineering Series, 53, 2015, 35-43.</mixed-citation><mixed-citation xml:lang="en">Chemeritskiy E., Stepanov E., Smeliansky R., "Managing network resources with ow (de) multiplexing protocol", Mathematical and Computational Methods in Electrical Engineering, Recent Advances in Electrical Engineering Series, 53, 2015, 35-43.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Raiciu C., Handley M., Wischik D., "RFC 6356: Coupled Congestion Control for Multipath Transport Protocols", 2011, 12 pp.</mixed-citation><mixed-citation xml:lang="en">Raiciu C., Handley M., Wischik D., "RFC 6356: Coupled Congestion Control for Multipath Transport Protocols", 2011, 12 pp.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Khalili R., et al., "MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution", IEEE/ACM Transactions on Networking, 21:5 (2013), 1651-1665.</mixed-citation><mixed-citation xml:lang="en">Khalili R., et al., "MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution", IEEE/ACM Transactions on Networking, 21:5 (2013), 1651-1665.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Peng Q., et al., "Multipath TCP: Analysis, Design, and Implementation", IEEE/ACM Transactions on Networking, 24:1 (2016), 596-609.</mixed-citation><mixed-citation xml:lang="en">Peng Q., et al., "Multipath TCP: Analysis, Design, and Implementation", IEEE/ACM Transactions on Networking, 24:1 (2016), 596-609.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Le T. A., Hong C. S., Lee S., "MPCubic: An extended cubic TCP for multiple paths over high bandwidth-delay networks", ICTC 2011, 2011, 34-39.</mixed-citation><mixed-citation xml:lang="en">Le T. A., Hong C. S., Lee S., "MPCubic: An extended cubic TCP for multiple paths over high bandwidth-delay networks", ICTC 2011, 2011, 34-39.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Ha B. P., et al., "A hybrid multipath congestion control algorithm for high speed and/or long delay networks", 2014 International Conference on Advanced Technologies for Communications (ATC 2014), 2014, 452-456.</mixed-citation><mixed-citation xml:lang="en">Ha B. P., et al., "A hybrid multipath congestion control algorithm for high speed and/or long delay networks", 2014 International Conference on Advanced Technologies for Communications (ATC 2014), 2014, 452-456.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Bich-Phuong Ha, et al., "A Multipath Cubic TCP Congestion Control with Multipath Fast Recovery over High Bandwidth-Delay Product Networks", IEICE Transactions on Communications, E-95B:7 (2012), 2232-2244.</mixed-citation><mixed-citation xml:lang="en">Bich-Phuong Ha, et al., "A Multipath Cubic TCP Congestion Control with Multipath Fast Recovery over High Bandwidth-Delay Product Networks", IEICE Transactions on Communications, E-95B:7 (2012), 2232-2244.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Hassayoun S., Iyengar J., Ros D., "Dynamic Window Coupling for multipath congestion control", 2011 19th IEEE International Conference on Network Protocols, 2011, 341-352.</mixed-citation><mixed-citation xml:lang="en">Hassayoun S., Iyengar J., Ros D., "Dynamic Window Coupling for multipath congestion control", 2011 19th IEEE International Conference on Network Protocols, 2011, 341-352.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Jean-Yves Boudec, Rate adaptation, Congestion Control and Fairness: A Tutorial, 2018, 54 pp.</mixed-citation><mixed-citation xml:lang="en">Jean-Yves Boudec, Rate adaptation, Congestion Control and Fairness: A Tutorial, 2018, 54 pp.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Knight S. et al., "The internet topology zoo", IEEE Journal on Selected Areas in Communications, 29:9 (2011), 1765-1775.</mixed-citation><mixed-citation xml:lang="en">Knight S. et al., "The internet topology zoo", IEEE Journal on Selected Areas in Communications, 29:9 (2011), 1765-1775.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Carter H., "Chaddock, Robert, Emmet. Principles and Methods of Statistics. Pp. xvi+471. Houghton Mifflin Company, 1925", The ANNALS of the American Academy of Political and Social Science, 123:1 (1926), 229.</mixed-citation><mixed-citation xml:lang="en">Carter H., "Chaddock, Robert, Emmet. Principles and Methods of Statistics. Pp. xvi+471. Houghton Mifflin Company, 1925", The ANNALS of the American Academy of Political and Social Science, 123:1 (1926), 229.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">van der Linden S., Detal G., Bonaventure O., "Revisiting Next-hop Selection in Multipath Networks", Proceedings of the ACM SIGCOMM 2011 Conference, 2011, 420-421.</mixed-citation><mixed-citation xml:lang="en">van der Linden S., Detal G., Bonaventure O., "Revisiting Next-hop Selection in Multipath Networks", Proceedings of the ACM SIGCOMM 2011 Conference, 2011, 420-421.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Navin Kukreja, et al., "SDN based automated testbed for evaluating multipath TCP", IEEE International Conference on Communication, ICC 2015 (London, United Kingdom, June 8-12, 2015), 2016, 718-723.</mixed-citation><mixed-citation xml:lang="en">Navin Kukreja, et al., "SDN based automated testbed for evaluating multipath TCP", IEEE International Conference on Communication, ICC 2015 (London, United Kingdom, June 8-12, 2015), 2016, 718-723.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Chawanat Nakasan, et al., "A Simple Multipath OpenFlow Controller using topologybased algorithm for Multipath TCP", 2015, https://arxiv.org/abs/1509.08388.</mixed-citation><mixed-citation xml:lang="en">Chawanat Nakasan, et al., "A Simple Multipath OpenFlow Controller using topologybased algorithm for Multipath TCP", 2015, https://arxiv.org/abs/1509.08388.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Dijkstra E. W., "A Note on Two Problems in Connexion with Graphs", Numer. Math., 1:1 (1959), 269-271.</mixed-citation><mixed-citation xml:lang="en">Dijkstra E. W., "A Note on Two Problems in Connexion with Graphs", Numer. Math., 1:1 (1959), 269-271.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Suurballe J. W., Tarjan R. E., "A quick method for finding shortest pairs of disjoint paths", Networks, 14:2 (1984), 325-336.</mixed-citation><mixed-citation xml:lang="en">Suurballe J. W., Tarjan R. E., "A quick method for finding shortest pairs of disjoint paths", Networks, 14:2 (1984), 325-336.</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>
