Control Systems and Computers

DOI: https://doi.org/10.15407/usim.2018.02.003

Upr. sist. maš., 2018, Issue 2 (274), pp. 3-11.

UDC 519.1

Marina Semeniuta, PhD in Phys.-Math. Sciences, associate professor Department of Physics and Mathematics Sciences of the Flight Academy of the National Aviation University, st. Dobrovolsky, 1, Kropivnitsky, 25005, Ukraine, marina_semenyuta@ukr.net

Dmytro Gryshmanov, Captain-inspector, Limited liability company Aircompany Atlasjet Ukraine, Stolychne Hwy. 103, Business Center “Europe”, 5th Floor Kyiv, 03131, Ukraine, di-sorry@ukr.net

ON THE APPLICATION OF GRACEFUL LABELLING IN MPLS NETWORKS

Introduction. There are different approaches to optimizing the process of traffic transmission over a network with MPLS functions. For example, at the design level of networks with MPLS technology, it is important to take into account the multilevel structure of the telecommunication systems. With multicast routing, the task of minimizing the maximum congestion of communication channels used in logical connections is of current interest. In this paper, we consider the problem of optimizing the process of IP packet transmission using MPLS technology.

Purpose. To conduct studies to optimize the process of traffic transmission over the network with MPLS functions.

Methods. Based on the complete topological map of the network, modeled by the graph G=(V, E), a spanning tree of minimum weight is calculated. For this purpose, the OSPF protocol can be applied, which determines the route of the lowest cost in the given metric – the minimum delay. Next comes the graceful labelling algorithm, which assigns tags to the routers, which in their turn generate the labels of the communication channels. Joining or deleting members of a group with multicast routing is implemented using the algorithm of renumbering vertices of a graceful caterpillar.

Results. Development of an effective packet forwarding method that would improve the packet lifetime parameters and increase the reliability of the network operation.

Conclusion. The considered method provides the reliable transportation of packages for safe realization and virtual private networks convenient work. These properties are associated with the use of the different labels for each equivalence class of the network layer. The resulting actions result in a simpler counting of the number of transitions, and also affect the improvement of the packet lifetime parameters and increase the reliability of the network operation.

Download full text! (In Russian).

Keywords: graceful labelling, spanning tree, MPLS–technology.

REFERENCES

1. 1. Gallian, J.A., 2017. A dynamic survey of graph labeling. The electronic journal of combinatorics, DS6, 415 p.
   2. Bloom, G.S., Golomb, S.W., 1977. “Applications of numbered undirected graphs”. Proc. of the IEEE, 4 (65), pp. 562–570.
   https://doi.org/10.1109/PROC.1977.10517
   3. DONETS, G.P., PETRENYUK, D.A., 2017. Graceful numbering of trees: Monograph. Kiev, S.N., 144 p. (In Ukrainin).
   4. Olvein, V., 2004. Structure and implementation of modern MPLS technology: Trans. from English, Moscow, St. Petersburg, Kiev: Williams, 480 p. (In Russian).
   5. TANENBAUM, A., WETHERALL, D., 2012. Computer networks. 5 th ed., SPb.: Peter, 960 p. (In Russian).
   6. Goldstein, A.B., Goldstein, B.S., 2014. MPLS Technology and protocols. St. Petersburg: BKhV-Petersburg, 304 p. (In Russian).
   7. Arkut, I.C., Arkut, R.C., Chani, N., 2000. “Graceful label numbering in optical MPLS networks”, Proceedings of the SPIE, 423, pp. 1–8.
   8. Dahl, G., Martin, A., Stoer, M., 1999. “Routing through virtual paths in layered telecommunication Networks”. Operations Research. 47, pp. 693–702.
   https://doi.org/10.1287/opre.47.5.693
   9. Knippel, A., Lardeux, B., 2007. “The Multi-layered network design problem”, Europ. J. of Operational Research, 138 (1), pp. 87–99.
   https://doi.org/10.1016/j.ejor.2006.07.046
   10. AGEEV, D.V., 2012. “Structural and parametric synthesis of a superimposed network IP MPLS over a network using a model represented as a multilayer graph”, Electronic scientific specialized journal Problems of telecommunications, 3 (8), pp. 3–23.
   11. Belotti, P., Capone, A., Carello, G. et al., 2006. “MPLS over transport network: two layers approach to network design with statistical multiplexing”. Conf. Next Generation Internet Design and Engineering (NGI 2006), Valencia, pp. 308–318.
   12. DE MAESSCHALCK, S., PICKAVET, M., 2003. “Multi-layer traffic grooming in networks with an IP MPLS layer on top of a meshed optical layer”, Global Telecommunications Conf., GLOBECOM’03, Washington: IEEE, pp. 2750–2754.
   https://doi.org/10.1109/GLOCOM.2003.1258736
   13. GOUVEIA, L., PATRICIO, P., DE SOUSA, A.F., VALADAS, R., 2003. “MPLS over WDM network design with packet level QoS constraints based on ILP models”, IEEE INFOCOM, 1, pp. 576–586.
   https://doi.org/10.1109/INFCOM.2003.1208708
   14. Chen, S., Gunluk, O., Yener, B., 2000. “The multicast packing problem”. IEEE ACM Trans. on Networking, 2000, 8 (3), pp. 311–318.
   https://doi.org/10.1109/90.851977
   15. CHARIKAR, M., NAOR, J., SCHIEBER, B., 2000. “Resource optimization in QoS multicast routing of real-time multimedia”, IEEE INFOCOM, 12 (2), pp. 1518–1527.
   https://doi.org/10.1109/INFCOM.2000.832550
   16. GOLDSTEIN, A.B., 2004. Investigation of the tunneling mechanism for multimedia traffic in the MPLS network. PhD thesis. St. Petersburg, 128 p. (In Russian).
   17. Timofieva, N.K., 2005. “On optimization of the design of the coordinate switch”, Mathematical machines and systems, 1, pp. 84–92. (In Ukrainin).
   18. Alishov, N.I., Alishov, A.N., Boyko, A.J., Boyko, N.A. et al., 2016. “Technology of system integration of hardware and software protection means of streaming date based of unbreakable ciphers”. Information processing systems, pp. 7–10. (In Ukrainin).
   19. RINGEL G. Problem 25, 1964. “Theory of graphs and its applications”, Proc. Symp. Smolenice 1963, Nakl. CSAV, Praha, pp. 162.
   20. Rosa A., 1967. “On certain valuations of the vertices of a graph. Theory of Graphs”, Int. Symp., Rome, Gordon and Breach, N.Y. and Dunod Paris, pp. 349–355.
   21. Golomb S.W., 1972. “How to number a graph. Graph Theory and Computing”. Acad. Press, New York, pp.23–37.
   https://doi.org/10.1016/B978-1-4832-3187-7.50008-8
   22. Wang Z., Crowcroft J., 1996. “Quality of service routing for supporting multimedia applications”, IEEE J. on Selected Areas in Communications, 14, 7, pp. 1228–1234.
   https://doi.org/10.1109/49.536364
   23. THOMAS M. THOMAS II., 2004. The structure and implementation of networks based on the protocol OSPF: Trans. from English, M.: Williams, 816 p. (In Russian).
   24. ARKUT, I.C., ARKUT,R.C., BASAK,A., 2003.”Topology constrained label switching for multicast routing”. Proc. of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003. 3 July 2003, Turkey, v.1. pp. 453 – 459. DOI: 10.1109/ISCC.2003.1214160.
   https://doi.org/10.1109/ISCC.2003.1214160

Received 08.05.2018