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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
R. L. Smelyanskii, “Software-configurable networks,” Otkryt. Sist., No. 9 (2012).
N. McKeown, T. Anderson, H. Balakrishnan, et al., “OpenFlow: enabling innovation in campus networks,” ACM SIGCOMM Comput. Commun. Rev. 38, 69–74 (2008).
A. Tootoonchian and Y. Ganjali, “HyperFlow: a distributed control plane for OpenFlow,” in Proceedings of the Internet Network Management Conference on Research on Enterprise Networking (San Jose, USA, 2010), pp. 3–9.
R. Wang, D. Butnariu, and J. Rexford, “OpenFlow-based server load balancing gone wild,” in Proceedings of the Hot-ICE (Boston, 2011), Vol. 11, pp. 12–18.
Routing Information Protocol (RIP) specification. www.ietf.org/rfc/rfc1058.txt.
Open Shortest Path First (OSPF) specification. www.ietf.org/rfc/rfc2328.txt.
Spanning Tree Protocol (STP) Application of the Inter-Chassis Communication Protocol (ICCP). https://tools.ietf.org/html/rfc7727.
A. Shalimov, D. Morkovnik, R. Smeliansky, et al., “The RunOS openFlow controller,” in Proceedings of the 4th European Workshop on Software Defined Networks (Bilbao, Spain, 2015), pp. 103–104.
D. Farinacci, C. Liu, and S. Deering, “Protocol independent multicast-sparse mode (PIM-SM),” Protocol Specification (1998).
M. Imase and B. Waxman, “Dynamic steiner tree problem,” SIAM Discrete Math. 4, 369–384 (1991).
P. Winter, “Steiner problem in networks: a survey,” Networks 17, 129–167 (1987).
F. K. Hwang and D. S. Richards, “Steiner tree problems,” Networks 22, 55–89 (1992).
C. A. S. Oliveira and P. M. Pardalos, “A survey of combinatorial optimization problems in multicast routing,” Comput. Operat. Res. 32, 1953–1981 (2005).
X. Wang, C. Yu, H. Schulzrinne, et al., “IP multicast fault recovery in PIM over OSPF,” in Proceedings of the International Conference on Network Protocols (Vancouver, Canada, 2000), pp. 116–125.
Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches. https://tools.ietf.org/html/rfc4541.
R. Pallos, J. Farkas, I. Moldovan, et al., “Performance of rapid spanning tree protocol in access and metro networks,” in Proceedings of the International Conference on Access Nets (Ottawa, Canada, 2007), pp. 1–8.
L. Bondan, L. F. Muller, and M. Kist, “Multiflow: multicast clean-slate with anticipated route calculation on OpenFlow programmable networks,” Appl. Comput. Res. 2 (2), 68–74 (2013).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979), Vol. 29, p.270.
A. Iyer, P. Kumar, and V. Mann, “Avalanche: data center multicast using software defined networking,” in Proceedings of the 6th International Conference on Communication Systems and Networks COMSNETS (Santa Barbara, USA, 2014), pp. 1–8.
J. Medved, R. Varga, A. Tkacik, et al., “OpenDaylight: towards a model-driven SDN controller architecture,” in Proceedings of the Conference on A World of Wireless, Mobile and Multimedia Networks WoWMoM (Boston, USA, 2014), pp. 1–6.
L. Huang, L. Huang, H. Hung, C. Lin, et al., “Scalable steiner tree for multicast communications in softwaredefined networking,” arXiv:1404.3453 (2014).
T. Cormen, C. Leiserson, R. Rivest, et al., Introduction to Algorithms (MIT Press, Cambridge, 2001), Vol.6.
B. M. Waxman, “Routing of multipoint connections,” IEEE J. Sel. Areas Commun. 6, 1617–1622 (1988).
L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for Steiner trees,” Acta Inform. 15, 141–145 (1981).
RunOS OpenFlow Controller. https://github.com/ARCCN/runos.
OpenFlow Switch Specification Version 1.3.2, Open Networking Foundation, CA, USA, 2013.
Mininet: Emulator for Rapid Prototyping of Software Defined Networks. https://github.com/mininet/mininet.
Open vSwitch. https://github.com/openvswitch/ovs.
Iperf: A TCP, UDP, and SCTP Network Bandwidth Measurement Tool. https://github.com/esnet/iperf.
R. Albert and A. L. Barabási, “Statistical mechanics of complex networks,” Rev. Mod. Phys. 74, 47 (2002).
Enterprise Campus 3.0 Architecture: Overview and Framework. http://www.cisco.com/c/en/us/td/docs/solutions/ Enterprise/Campus/campover.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © I.S. Petrov, R.L. Smeliansky, 2018, published in Izvestiya Akademii Nauk, Teoriya i Sistemy Upravleniya, 2018, No. 3, pp. 64–75.
Rights and permissions
About this article
Cite this article
Petrov, I.S., Smeliansky, R.L. Minimization of Multicast Traffic and Ensuring Its Fault Tolerance in Software-Defined Networks. J. Comput. Syst. Sci. Int. 57, 407–419 (2018). https://doi.org/10.1134/S1064230718030085
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230718030085