Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks

DOI10.1134/S1064230718030085zbMath1484.68024OpenAlexW2809155264WikidataQ129577882 ScholiaQ129577882MaRDI QIDQ1792411

I. S. Petrov, R. L. Smeliansky

Publication date: 11 October 2018

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230718030085

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (1)

Algorithm for Reducing the Number of Forwarding Rules Created by SDN Applications

Uses Software

• Mininet
• GitHub
• iperf
• Open vSwitch
• RUNOS
• HyperFlow

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• A survey of combinatorial optimization problems in multicast routing
• Statistical mechanics of complex networks
• Steiner problem in networks: A survey
• Dynamic Steiner Tree Problem
• Steiner tree problems

This page was built for publication: Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks