RESEARCH OF ENGINEERING TRAFFIC IN COMPUTER UZ NETWORK USING MPLS TE TECHNOLOGY

V. M. Pakhomova

doi:10.15802/stp2015/38262

Authors

V. M. Pakhomova Dnipropetrovsk National University of Railway Transport named after Academician V. Lazaryan, Ukraine https://orcid.org/0000-0001-8346-0405

DOI:

https://doi.org/10.15802/stp2015/38262

Keywords:

MPLS TE technology, traffic engineering, flow rate, bandwidth utilization, TE-tunnel

Abstract

Purpose. In railway transport of Ukraine one requires the use of computer networks of different technologies: Ethernet, Token Bus, Token Ring, FDDI and others. In combined computer networks on the railway transport it is necessary to use packet switching technology in multiprotocol networks MPLS (MultiProtocol Label Switching) more effectively. They are based on the use of tags. Packet network must transmit different types of traffic with a given quality of service. The purpose of the research is development a methodology for determining the sequence of destination flows for the considered fragment of computer network of UZ. Methodology. When optimizing traffic management in MPLS networks has the important role of technology traffic engineering (Traffic Engineering, TE). The main mechanism of TE in MPLS is the use of unidirectional tunnels (MPLS TE tunnel) to specify the path of the specified traffic. The mathematical model of the problem of traffic engineering in computer network of UZ technology MPLS TE was made. Computer UZ network is represented with the directed graph, their vertices are routers of computer network, and each arc simulates communication between nodes. As an optimization criterion serves the minimum value of the maximum utilization of the TE-tunnel. Findings. The six options destination flows were determined; rational sequence of flows was found, at which the maximum utilization of TE-tunnels considered a simplified fragment of a computer UZ network does not exceed 0.5. Originality. The method of solving the problem of traffic engineering in Multiprotocol network UZ technology MPLS TE was proposed; for different classes its own way is laid, depending on the bandwidth and channel loading. Practical value. Ability to determine the values of the maximum coefficient of use of TE-tunnels in computer UZ networks based on developed software model «TraffEng». The input parameters of the model: number of routers, channel capacity, the number of streams, the average flow velocity. As a result of the model «TraffEng» choices variants of TE-tunnels with the corresponding values of the maximum coefficient of their use are presented.

Author Biography

V. M. Pakhomova, Dnipropetrovsk National University of Railway Transport named after Academician V. Lazaryan

Dep. «Electronic Computing Machines»

References

Budyldina N.V., Shuvalov V.P Telekommunikatsionnyye seti s mnogoprotokolnoy kommutatsiey po metkam. Postroeniye i optimizatsiya [Telecommunication network with multiprotocol switched labels. Design and optimization]. Ekaterinburg Publ., 2006. 287 p.

Goldshteyn A.B. Mekhanizm effektivnogo tunnelirovaniya v seti MPLS [The mechanism of effective tunneling in MPLS network]. Vestnik svyazi – Bulletin of communication, 2004, no. 2, 12 p.

Zaychenko Yu.P., Sharadka A.A.M. Zadacha raspredeleniya potokov razlichnykh klassov v seti s tekhnologiey MPLS [The task of distribution of different classes in the network with MPLS technology]. Visnyk NTUU «KPI» – Bulletin of NTUU «KPI», 2005, no. 43, pp. 113-23.

KucheryavyyYe.A. Upravleniye trafikom i kachestvo obsluzhivaniya v seti Internet [Traffic management and quality of service in the Internet]. Sant-Petersburg, Nauka i Tekhnika Publ., 2004. 336 p.

Olveyn V. Struktura i realizatsiya sovremennoy tekhnologii MPLS [The design and implementation of modern technologies MPLS]. Sant-Petersburg, Piter Publ., 2004, 480 p.

Olifer, V.G., Olifer N.A. Kompyuternye seti. Printsipy, tekhnologii, protokoly [Computer network. Principles, technologies and protocols]. Sant-Peterburg, Piter Publ., 2010. 944 p.

Pakhomova V.M., Povod V.V. Lohichna strukturyzatsiia informatsiinykh merezh zaliznychnoho transportu na osnovi komutatoriv Ethernet [Logical structuring of information networks of railway transport on the basis of Ethernet switches]. Zbirnyk naukovykh prats Donetskoho instytutu zaliznychnoho transportu [Proc. of Donetsk Institute of Railway Transport], 2012, no. 29, pp. 11-18.

Pakhomova V.M., Skaballanovych T.I., Liakhov D.A. Mozhlyvist vykorystannia tekhnolohii 100VG-AnyLAN v informatsiinykh systemakh zaliznychnoho transportu [The possibility of the use of technology 100VG-AnyLAN in the information systems of railway transport]. Vіsnyk Dnіpropetrovskoho natsіonalnoho unіversytetu zalіznichnoho transportu іmenі akademіka V. Lazariana [Bulletin of Dniproperovsk National University named after Academician V. Lazaryan], 2012, issue 2 (41), pp. 199-204.

Pakhomova V.M., Strybulevych L.V. Modyfikovana imitatsiina model lokalnoi merezhi za markernym metodom dostupu do shyny [Modified network simulation model with token method of bus access]. Nauka ta prohres transportu. Vіsnyk Dnіpropetrovskoho natsіonalnoho unіversytetu zalіznichnoho transportu іmenі akademіka V. Lazariana – Science and Transport Progress. Bulletin of Dniproperovsk National University, 2013, no. 4 (46), pp. 90-98.

Stolings V. Sovremennyye kompyuternyye seti [Modern computer networks]. Sant-Petersburg, Piter Publ., 2003. 783 p.

Khandetskyi V.S., Hryhoriev V.M., Khandetskyi P.V. Efektyvnist obminu marshrutnoiu informatsiieiu v iierarkhichnykh strukturakh OSPF-merezh [The efficiency of the exchange of routing information in the hierarchical structures of OSPF networks]. Tezy dopovidi VI mizhnarodnoi naukovoi-praktychnoi konferentsii. «Suchasni problemy i dosiahnennia v haluzi telekomunikatsii ta informatsiinykh tekhnolohii» [Proc. of the VI Intern. Sci and Pract. Conf. «Modern problems and achievements in the field of telecommunications and information technologies»]. Zaporizhia, 2012, pp. 280-281.

Le Gall P. Single server queuing networks with varying service times and renewal input. Journal of Appl. Mathematics and Stochastic Analysis, 2000, no. 13, pp. 429-450. doi: 10.1155/s1048953300000368.

Boxma O.J. On a tandem queuing model with identical service times at both counters. Advances in Applied Probability, 1979, vol. 11, issue 3, pp. 616-643. doi: 10.2307/1426958.