Minimization of Multicast Traffic and Ensuring Its Fault Tolerance in Software-Defined Networks
- Authors: Petrov I.S.1, Smeliansky R.L.1
-
Affiliations:
- Moscow State University
- Issue: Vol 57, No 3 (2018)
- Pages: 407-419
- Section: Computer Methods
- URL: https://journals.rcsi.science/1064-2307/article/view/220118
- DOI: https://doi.org/10.1134/S1064230718030085
- ID: 220118
Cite item
Abstract
In recent years, the widespread TCP/IP computer network model has been replaced by the software-defined network model, where the control plane is separated from the data plane and is logically centralized. The new model requires a revision of traditional network control protocols. One group of such revised protocols consists of multicast routing protocols. In this paper, the multicast routing protocols used in traditional TCP/IP networks are analyzed, and their basic disadvantages and difficulties in their application in software-defined networks are revealed. Multicast routing algorithms that use the capabilities of software-defined networks and ensure the optimization and reliability of routes in multicast routing are described. These algorithms are exempt from the drawbacks of traditional networks. The proposed algorithms are implemented as an application for the RunOS controller. This experimental study shows that the delays due to the use of the proposed algorithms for restructuring routes satisfy the requirements of telecommunications operators of large regional networks.
About the authors
I. S. Petrov
Moscow State University
Author for correspondence.
Email: ipetrov@cs.msu.ru
Russian Federation, Moscow, 119991
R. L. Smeliansky
Moscow State University
Email: ipetrov@cs.msu.ru
Russian Federation, Moscow, 119991