<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-718</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></article-categories><title-group><article-title>Высокоскоростная передача данных в глобальных сетях для систем производства цифровой аудиовизуальной информации</article-title><trans-title-group xml:lang="en"><trans-title>High Speed WAN Data Transmission for Globalized Content Production Environments</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>Siemens</surname><given-names>E.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.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>Herpel</surname><given-names>C.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.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>Köhler</surname><given-names>R.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.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>Aust</surname><given-names>A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="en" id="aff-1"><institution>Thomson Corporate Research</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2010</year></pub-date><pub-date pub-type="epub"><day>06</day><month>02</month><year>2023</year></pub-date><volume>0</volume><issue>4</issue><fpage>3</fpage><lpage>12</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Сименс Э..., Херпель К..., Келер Р..., Ауст А..., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Сименс Э..., Херпель К..., Келер Р..., Ауст А...</copyright-holder><copyright-holder xml:lang="en">Siemens E., Herpel C., Köhler R., Aust 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://vestnik.sibsutis.ru/jour/article/view/718">https://vestnik.sibsutis.ru/jour/article/view/718</self-uri><abstract><p>В создание аудиовизуальных материалов часто вовлечены лица, находящиеся в пространственно распределенных местах.  Для улучшения экономических показателей и ускорения производственных процессов создания фильмов на базе передовых цифровых технологий крайне необходима более тесная интеграция всех участников посредством эффективного электронного обмена информацией.  В статье представлен взгляд авторов на сетевую и управляемую среду для производства цифровой аудиовизуальной информации, которая может быть распределена по всему миру.  Представлены необходимые шаги и основные проблемы в реализации этой среды, а также обозначены подходы к их решению.  Статья особенно сфокусирована на проблеме сверхбыстрой передачи данных в глобальных сетях, что необходимо для передачи несжатых изображений формата 4k HDTV.  Исследовано новое, но уже реализованное решение для этой задачи.  Приводится обзор следующих шагов, направленных на дальнейшее повышение эффективности распределённой системы производства цифровой аудиовизуальной информации.</p></abstract><trans-abstract xml:lang="en"><p>Audiovisual content creation often involves actors at many distributed locations. Tighter integration of these actors, among others by means of an efficient electronic content exchange, is urgently needed to improve the economics and to speed up especially high end, digital film production workflows. In this paper, we present the vision for a networked and managed audiovisual content production environment that may be distributed around the world. Necessary steps and major challenges towards the realization of this vision are presented here and solution approaches are sketched. A focus of this paper is on the specific challenge of fast wide-area data transport at multi-gigabit data rates. Currently a discrepancy exists between the available network bandwidth and the ability to "fill this pipe" in order to transport uncompressed imagery at 4k resolution. A new, but already deployed, solution for this issue is elaborated. The paper concludes with an outlook on the next steps towards our vision to make globalized content production more efficient.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>распределённое производство мультимедийной информации</kwd><kwd>пост-обработка мультимедийной информации</kwd><kwd>сверхбыстрая передача данных в глобальных сетях</kwd></kwd-group><kwd-group xml:lang="en"><kwd>globalized content production</kwd><kwd>post production</kwd><kwd>fast wide area data transfer</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. Transmission of component-coded digital television signals for contribution-quality applications at the third hierarchical level of ITU-T Recommendation G.702, ITU-T recommendation J.81, 1993</mixed-citation><mixed-citation xml:lang="en">ITU-T. Transmission of component-coded digital television signals for contribution-quality applications at the third hierarchical level of ITU-T Recommendation G.702, ITU-T recommendation J.81, 1993</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Dina Katabi, Mark Handley, Charlie Rohrs. Congestion control for high bandwidth-delay product networks. In Proc. Of: ACM SIGCOMM Computer Communication Review, Oct. 2002</mixed-citation><mixed-citation xml:lang="en">Dina Katabi, Mark Handley, Charlie Rohrs. Congestion control for high bandwidth-delay product networks. In Proc. Of: ACM SIGCOMM Computer Communication Review, Oct. 2002</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">C. Anglano, M. Canonico. Performance analysis of high-performance file-transfer systems for Grid applications. Concurrency and Computation: Practice &amp; Experience, Vol 18 pp 807-816, Jul. 2006</mixed-citation><mixed-citation xml:lang="en">C. Anglano, M. Canonico. Performance analysis of high-performance file-transfer systems for Grid applications. Concurrency and Computation: Practice &amp; Experience, Vol 18 pp 807-816, Jul. 2006</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">E. He, J. Leigh, O. Yu and T. DeFanti, Reliable Blast UDP: Predictable High Performance Bulk Data Transfer. IEEE Cluster Computing, 2002: p. 317</mixed-citation><mixed-citation xml:lang="en">E. He, J. Leigh, O. Yu and T. DeFanti, Reliable Blast UDP: Predictable High Performance Bulk Data Transfer. IEEE Cluster Computing, 2002: p. 317</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Y. Gu „UDT: A High Performance Data Transport Protocol" PhD Thesis, University of Illinois at Chicago, 2005</mixed-citation><mixed-citation xml:lang="en">Y. Gu „UDT: A High Performance Data Transport Protocol" PhD Thesis, University of Illinois at Chicago, 2005</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Anue Systems. Network emulator Anue XGEM, Product information page. URL:http://www.anuesystems.com/GEM_XGEM_network_simulator.htm. 2008</mixed-citation><mixed-citation xml:lang="en">Anue Systems. Network emulator Anue XGEM, Product information page. URL:http://www.anuesystems.com/GEM_XGEM_network_simulator.htm. 2008</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Xinran (Ryan) Wu and Andrew A. Chien. Evaluation of rate-based transport protocols for lambdagrids. In HPDC '04: 13th IEEE International Symposium on High Performance Distributed Computing. 2004</mixed-citation><mixed-citation xml:lang="en">Xinran (Ryan) Wu and Andrew A. Chien. Evaluation of rate-based transport protocols for lambdagrids. In HPDC '04: 13th IEEE International Symposium on High Performance Distributed Computing. 2004</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">F. Buschmann et. al. Pattern-Oriented Software Architecture, Vol 1. John Wiley &amp; Sons,2000</mixed-citation><mixed-citation xml:lang="en">F. Buschmann et. al. Pattern-Oriented Software Architecture, Vol 1. John Wiley &amp; Sons,2000</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Globus Toolkit Home Page. URL: http:// www.globus.org. 2008</mixed-citation><mixed-citation xml:lang="en">Globus Toolkit Home Page. URL: http:// www.globus.org. 2008</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">The WS-Resource Framework, Home Page. URL:http://www.globus.org/wsrf/</mixed-citation><mixed-citation xml:lang="en">The WS-Resource Framework, Home Page. URL:http://www.globus.org/wsrf/</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">GRIA Home Page. URL: http://www.gria.org. 2008</mixed-citation><mixed-citation xml:lang="en">GRIA Home Page. URL: http://www.gria.org. 2008</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Society of Motion Picture and Television Engineers. " Serial Digital Interface (SDI)", SMPTE-259M, 1997</mixed-citation><mixed-citation xml:lang="en">Society of Motion Picture and Television Engineers. " Serial Digital Interface (SDI)", SMPTE-259M, 1997</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">IEEE. IEEE 802 part 3: Part 3: Carrier sense multiple access with collision detection (CSMA/CD) access, method and physical layer specifications, IEEE 802.3-2005, 2005</mixed-citation><mixed-citation xml:lang="en">IEEE. IEEE 802 part 3: Part 3: Carrier sense multiple access with collision detection (CSMA/CD) access, method and physical layer specifications, IEEE 802.3-2005, 2005</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">IEEE P802.3ba 40Gb/s and 100Gb/s Ethernet Task Force, Home Page URL: http://www.ieee802.org/3/ba/. 2008</mixed-citation><mixed-citation xml:lang="en">IEEE P802.3ba 40Gb/s and 100Gb/s Ethernet Task Force, Home Page URL: http://www.ieee802.org/3/ba/. 2008</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">M. Wadekar. "Enhanced Ethernet for Data Center: Reliable, Channelized and Robust. 15th IEEE Workshop on Local &amp; Metropolitan Area Networks 2007, p.65</mixed-citation><mixed-citation xml:lang="en">M. Wadekar. "Enhanced Ethernet for Data Center: Reliable, Channelized and Robust. 15th IEEE Workshop on Local &amp; Metropolitan Area Networks 2007, p.65</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Fibre Channel Industry Organisation. Home Page URL:http://www.fibrechannel.org/. 2008</mixed-citation><mixed-citation xml:lang="en">Fibre Channel Industry Organisation. Home Page URL:http://www.fibrechannel.org/. 2008</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Infiniband Trade Association. Home Page URL: http://www.infinibandta.org/. 2008</mixed-citation><mixed-citation xml:lang="en">Infiniband Trade Association. Home Page URL: http://www.infinibandta.org/. 2008</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">C. Herpel. "Di/oS - Improve Cost and Time Efficiencyof SAN-Based Workflows" Thomson, Corporate Newsletter Nr. 1, 2007 URL:http://www.thomson.net/GlobalEnglish/research/research/Documents/Newsletter/Corporate_Research_summer2007.pdf</mixed-citation><mixed-citation xml:lang="en">C. Herpel. "Di/oS - Improve Cost and Time Efficiencyof SAN-Based Workflows" Thomson, Corporate Newsletter Nr. 1, 2007 URL:http://www.thomson.net/GlobalEnglish/research/research/Documents/Newsletter/Corporate_Research_summer2007.pdf</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">F. Le Bolzer et. al. Prodim@ges - A new Video Production Environment based on IP wireless and optical links. Accepted to 2008 NEM Summit.</mixed-citation><mixed-citation xml:lang="en">F. Le Bolzer et. al. Prodim@ges - A new Video Production Environment based on IP wireless and optical links. Accepted to 2008 NEM Summit.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">MUPBED Project Home Page. URL: http://www.ist-mupbed.org/. 2008</mixed-citation><mixed-citation xml:lang="en">MUPBED Project Home Page. URL: http://www.ist-mupbed.org/. 2008</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">IRMOS Project Home Page. URL: http://www.irmosproject.eu. 2008</mixed-citation><mixed-citation xml:lang="en">IRMOS Project Home Page. URL: http://www.irmosproject.eu. 2008</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">ContenShare2 Product Home Page. URL: http://www.thomsongrassvalley.com/products/security/cs2/. 2008</mixed-citation><mixed-citation xml:lang="en">ContenShare2 Product Home Page. URL: http://www.thomsongrassvalley.com/products/security/cs2/. 2008</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>
