<?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">vdgtu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Дагестанского государственного технического университета. Технические науки</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of Dagestan State Technical University. Technical Sciences</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2073-6185</issn><issn pub-type="epub">2542-095X</issn><publisher><publisher-name>Daghestan State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.21822/2073-6185-2022-49-2-46-55</article-id><article-id custom-type="elpub" pub-id-type="custom">vdgtu-1080</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>INFORMATION TECHNOLOGY AND TELECOMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Информационная безопасность предпринимательских сетей</article-title><trans-title-group xml:lang="en"><trans-title>Information security of business 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>Losev</surname><given-names>A. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат физико-математических наук, старший научный научно-исследовательской группы вероятностных методов и системного анализа,</p><p>690041, г. Владивосток, ул. Радио, 7</p></bio><bio xml:lang="en"><p>Сand. Sci. (Physics and Mathematics), Senior Researcher of the Research Group of Probabilistic Methods andSystem Analysis,</p><p> </p></bio><email xlink:type="simple">A.S.Losev@yandex.ru</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>Information security of business networks</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>17</day><month>08</month><year>2022</year></pub-date><volume>49</volume><issue>2</issue><fpage>46</fpage><lpage>55</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лосев А.С., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Лосев А.С.</copyright-holder><copyright-holder xml:lang="en">Losev A.S.</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.dgtu.ru/jour/article/view/1080">https://vestnik.dgtu.ru/jour/article/view/1080</self-uri><abstract><sec><title>Цель</title><p>Цель. Целью работы является повышение информационной безопасности сетей предпринимательского вида, как наиболее подверженных внешним угрозам с целью коммерческого шпионажа.</p></sec><sec><title>Метод</title><p>Метод. Исследование основано на использовании оригинального математического алгоритма, позволяющего проводить кластеризацию сетей произвольной топологии и строить матрицу частичного порядка. С одной стороны, кластеризация позволяет выявить агентов сети, имеющих одинаковый информационный доступ к сети, с другой стороны, частичный порядок отражает положение отдельно взятого кластера в иерархической структуре всей сети.</p></sec><sec><title>Результат</title><p>Результат. Данный подход позволяет оценить потенциальную угрозу сети в зависимости от положения агента в сети, подвергшегося атаке. На основе данного подхода разработана методика определения степени открытости предпринимательской сети к воздействию со стороны внешних факторов для каждого агента сети. Она позволяет выделить агентов сети, требующих усиления безопасности по отношению к внешнему воздействию, так как потенциальная атака на них имеет максимально негативные последствия для всего соединения, что подчеркивает практическую значимость результата.</p></sec><sec><title>Вывод</title><p>Вывод. Разработанная методика практически значима и может быть использована для оценки информационной безопасности или целостности сети любой природы, представимой в виде ориентированного графа. </p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The aim of the work is to improve the information security of businesstype networks, as the most susceptible to external threats for the purpose of commercial espionage.</p></sec><sec><title>Method</title><p>Method. The study is based on the use of an original mathematical algorithm that allows clustering networks of arbitrary topology and constructing a partial order matrix. On the one hand, clustering allows you to identify network agents that have the same information access to the network, on the other hand, partial order reflects the position of a single cluster in the hierarchical structure of the entire network.</p></sec><sec><title>Result</title><p>Result. This approach allows assessing the potential threat to the network depending on the position of the agent in the network that has been attacked. On its basis, a methodology has been developed to determine the degree of openness of an entrepreneurial network to the influence of external factors for each agent of the network. It allows you to identify network agents that require increased security in relation to external influences, since a potential attack on them has the most negative consequences for the entire connection, which emphasizes the practical significance of the result.</p></sec><sec><title>Conclusion</title><p>Conclusion. The developed technique is practically significant and can be used to assess the information security or integrity of a network of any nature, represented as a directed graph. </p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>информационная безопасность</kwd><kwd>агент сети</kwd><kwd>предпринимательские сети</kwd><kwd>кластеризация</kwd><kwd>частичный порядок</kwd><kwd>ориентированный граф</kwd><kwd>степень открытости сети</kwd><kwd>методика</kwd></kwd-group><kwd-group xml:lang="en"><kwd>information security</kwd><kwd>network agent</kwd><kwd>business networks</kwd><kwd>clustering</kwd><kwd>partial order</kwd><kwd>directed graph</kwd><kwd>degree of network openness</kwd><kwd>methodology</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">Асаул А.А. Методологические аспекты формирования и развития предпринимательских сетей. – СПб.: «Гуманистика», 2004. – 256 с.</mixed-citation><mixed-citation xml:lang="en">Asaul A.A. Methodological aspects of the formation and development of entrepreneurial networks. SPb.: «Gumanistika», 2004: 256. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Шерешева М.Ю. Формы сетевого взаимодействия компаний. М.: Изд. дом ГУ–ВШЭ, 2010. – 339 с.</mixed-citation><mixed-citation xml:lang="en">Sheresheva M.Yu. Forms of network interaction of companies. M.: Izd. dom GU–VShE`, 2010: 339. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Жаркова Е.С. Экономические теории размещения производства: от штандорта к кластерам // Вестник СПбГУ. – 2011. – Сер. 5. – Вып. 1. – С. 145–150.</mixed-citation><mixed-citation xml:lang="en">Zharkova E.S. Economic theories of production location: from standort to clusters. [Vestnik SPbGU ] Bulletin of St. Petersburg State University, 2011; 5(1): 145–150. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Уильямсон О. Экономические институты капитализма: фирмы, рынки, «отношенческая» контрактация. – СПб.: Лениздат, 1996. – 702 с.</mixed-citation><mixed-citation xml:lang="en">Uil`yamson O. Economic institutions of capitalism: firms, markets, "relational" contracting. SPb.: Lenizdat, 1996: 702. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Радаев В.В. Рынок переплетение социальных сетей // Российский журнал менеджмента. – 2008. – Т.6. – №2. – С. 47– 54.</mixed-citation><mixed-citation xml:lang="en">Radaev V.V. The market for the interweaving of social networks. Rossijskij zhurnal menedzhmenta, 2008; 6(2): 47–54 (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Granovetter M. Business Groups. The Handbook of Economic Sociology. – N.Y., 1994.</mixed-citation><mixed-citation xml:lang="en">Granovetter M. Business Groups. The Handbook of Economic Sociology. N.Y., 1994.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Катькало В.С. Межфирменные сети: проблематика исследований новой организационной категории в 1980–90е гг. // Вестник СПбГУ. Сер.5: Экономика. – 1999. – № 2. – С. 21–38.</mixed-citation><mixed-citation xml:lang="en">Kat`kalo V.S. Interfirm Networks: Research Issues of a New Organizational Category in the 1980–90s. [Vestnik SPbGU Bulletin of St.] Petersburg State University. Ser.5: E`konomika, 1999; 2:21–38. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Elfring T., Hulsink W. Networks in entrepreneurship: The case of high-technology firms // Small Business Economics. – 2001. – Vol. 21(4). – P. 409–422.</mixed-citation><mixed-citation xml:lang="en">Elfring T., Hulsink W. Networks in entrepreneurship: The case of high-technology firms. Small Business Economics. 2001; 21(4): 409–422.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Davidsson P., Honig B. The role of social and human capital among nascent Entrepreneurs // Journal of Business Venturing. – 2003. – Vol. 18(3). – P. 301–331.</mixed-citation><mixed-citation xml:lang="en">Davidsson P., Honig B. The role of social and human capital among nascent Entrepreneurs. Journal of Business Venturing. 2003; 18(3): 301–331.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Erdos P., Renyi A. On random graphs // Publicationes Mathematica. – 1959. – Vol. 6. – P. 290–297.</mixed-citation><mixed-citation xml:lang="en">Erdos P., Renyi A. On random graphs. Publicationes Mathematica. 1959; 6: 290–297.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Newman M.E. The structure and function of complex networks. – SIAM Review, 2003.</mixed-citation><mixed-citation xml:lang="en">Newman M.E. The structure and function of complex networks. SIAM Review, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Леш А. Пространственная организация хозяйства. – М.: Наука, 2007. – 663 с.</mixed-citation><mixed-citation xml:lang="en">Lesh A. Spatial organization of the economy. M.: Nauka, 2007: 663. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Штульберг Б.М., Введенский В.Г. Региональная политика России: теоретические основы, задачи и методы реализации. – М.: Гелиос АРВ, 2009. – 208 с.</mixed-citation><mixed-citation xml:lang="en">Shtul`berg B.M., Vvedenskij V.G. Regional Policy of Russia: Theoretical Foundations, Tasks and Methods of Implementation. M.: Gelios ARV, 2009: 208. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Marshall A. Principles of Economics. Variorum edition overseen be C. Guillebaud. – L.: McMillan Press, 1961. – 450 p.</mixed-citation><mixed-citation xml:lang="en">Marshall A. Principles of Economics. Variorum edition overseen be C. Guillebaud. L.: McMillan Press, 1961: 450.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Porter M.E. On Competition. – Boston: Harvard Business School Press, 1998. – 485 p.</mixed-citation><mixed-citation xml:lang="en">Porter M.E. On Competition. Boston: Harvard Business School Press, 1998: 485.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Albert R., Barabasi A. Statistical mechanics of complex networks // Reviews of Modern Physics. – 2002. – Vol. 74. – P. 47– 97.</mixed-citation><mixed-citation xml:lang="en">Albert R., Barabasi A. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002; 74: 47–97.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Aggarwal C.C. Social Network Data Analytics. – Kluwer Academic Publishers, 2011. – 502 p.</mixed-citation><mixed-citation xml:lang="en">Aggarwal C.C. Social Network Data Analytics. Kluwer Academic Publishers, 2011: 502.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Everton S.F. Disrupting Dark Networks (Structural Analysis in the Social Sciences). – Cambridge University Press, 2012. – 482 p.</mixed-citation><mixed-citation xml:lang="en">Everton S.F. Disrupting Dark Networks (Structural Analysis in the Social Sciences). Cambridge University Press, 2012: 482.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Асаул А.А. Организация предпринимательской деятельности. – Москва: Проспект, 2016. – 400 с.</mixed-citation><mixed-citation xml:lang="en">Asaul A.A. Organization of entrepreneurial activity. Moskva: Prospekt, 2016. 400 p. (In Russ)</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Tsitsiashvili G., Bulgakov V., Osipova M., Losev A., Kharchenko Yu. Construction of subgraph from graph shortest way//Applied Mathematical Sciences. – 2015. – Vol. 79(9). – P. 3911–3918.</mixed-citation><mixed-citation xml:lang="en">Tsitsiashvili G., Bulgakov V., Osipova M., Losev A., Kharchenko Yu. Construction of subgraph from graph shortest way. Applied Mathematical Sciences, 2015; 79(9): 3911–3918.</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>
