Infokommunikacionnye tehnologiiInfokommunikacionnye tehnologii2073-3909Povolzhskiy State University of Telecommunications and Informatics5625510.18469/ikt.2017.15.1.06Research ArticleSTUDY OF BOUNDARY VALUES OF VPN TRAFFIC DELAYS CONSIDERING CROSS FLOWSLysikovAndrey Aleksandrovichlysikov_inc@mail.ruPovolzhskiy State University of Telecommunications and Informatics15032017151404920122020Copyright © 2017, Lysikov A.A.2017Virtual private networks are one of the most popular services in next generation networks. When implemented in a network operator a large number of VPNs there is a conflict over the resources of the network. The paper proposes a VPN model based on Network Calculus theory, allowing to define the least upper delay bound for flow of planned VPN considering cross flow other VPNs in nested and non-nested tandems. Considered the results of a study of the proposed model. According to the results of experiments found that the greatest impact on the delay of the proposed VPN flow will have bursts of cross flows in medium and large batches route nodes. The rate competing flows will have a noticeable effect on the delay of the planned VPN flow at high loads routes nodes. Are given the recommendations for operators on the use of results in practice when planning a VPN. This model can be used as a basis for the development of specialized software package planning and allocation of network resources.virtual private networksoptimal distribution network resources of telecommunication operatorboundary values of delaysnetwork calculus theoryвиртуальные частные сетиоптимальное распределение ресурсов сети оператора связиграничные значения задержектеория сетевого исчисления[Росляков А.В. Виртуальные частные сети. Основы построения и применения. М.: Эко-Трендз, 2006. - 304 с.][Cruz R. L. A calculus for network delay. Part I, II. IEEE Transactions on Information Theory, 1991. V. 37(1). - Р. 114-141.][Литвинов Г.Л. Деквантование Маслова, идемпотентная и тропическая математика: краткое введение // Теория представлений, динамические системы, комбинаторные и алгоритмические методы, XIII. Записки научных семинаров ПОМИ. Т. 326, 2005. - С.145-182.][Baccelli, F. Cohen, G. Olsder, G.J. Quadrat, J.P. Synchronization and Linearity: An algebra for discrete event systems. John Wiley & Sons Ltd, 1992. - 485 p.][Le Boudec J.-Y., Thiran P. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag, 2012. - 263 p.][Jiang, Y., Yong L. Stochastic Network Calculus. Springer-Verlag, 2008. - 240 p.][Lenzini L., Mingozzi E., Stea G. A Methodology for Computing End-to-end Delay Bounds in FIFO-multiplexing Tandems. Elsevier Performance Evaluation, 2008. V. 65. PP. 922-943.][Lenzini L., Martorini L., Mingozzi Е., Stea G. Tight End-to-end Per-flow Delay Bounds in FIFO Multiplexing Sink-tree Networks. Performance Evaluation, V. 63, 2006, PP. 956-987.][Bisti L., Lenzini L., Mingozzi E., Stea G. Numerical analysis of worst-case and-to-end delay bounds in FIFO tandem networks. Real-Time Systems, V. 48, I. 5, 2012, PP. 527-569.][Website of the Computer Networking Group at the University of Pisa // URL: http://cng1.iet.unipi.it/wiki/index.php/Deborah, continuously updated (д.о. 15.12.2016).]