???????? ????????????. ???????????????? ??????????????????????, ?????? ???????????????????? ???????????????? ?????????????????????? ?????????????? ?????????????????????? ??????????????, ???? ???????????? ???????????????????? ???????????????????? ???????? ?????????? ???????????? ?? ???????????????????? ???????????????????? ???????????? ????????????. ????????????. ???? ???????????? ???????????? ???????????????????????? ?????????? ????????????, ???? ?????????????????????? ???????????? G=(V, E), ???????????????????????? ?????????????????? ???????????? ?????????????????????? ????????. ?????? ?????????? ???????? ???????? ???????????????????????? ???????????????? OSPF, ???????? ???????????????? ?????????????? ?????????????????? ???????????????? ?? ?????????????? ?????????????? ??? ???????????????????? ????????????????. ???????? ?????????????????????????? ???????????????? ???????????????????? ????????????????, ???? ?????????????????? ?????????????????????????????? ??????????, ?????? ?? ???????? ?????????? ???????????????????? ?????????? ?????????????? ???????????????. ???????????????????? ?????? ?????????????????? ?????????????????? ?????????? ?????? ???????????????????????????? ?????????????????????????? ?????????????????????? ???? ???????????????????????? ?????????????????? ?????????????????????????? ???????????? ???????????????????? ????????????????. ??????????????????. ???????????????????? ???????????????????? ???????????? ?????????????????????????????? ??????????????, ???? ???????????? ???????????????????? ???????????????????? ???????? ?????????? ???????????? ?? ???????????????????? ???????????????????? ???????????? ????????????.

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.

?????????????????????? ???????????????? ???????????? ???? ???????????? ???????????????????? ????????????????, ???????????????????????? ?????? ?????????????? ?????????????????????????????? ?????????? ?? ?????????????????????? ?????????? ???????????????? ????????????.