Online Multicast Traffic Engineering for Software-Defined Networks

Abstract

Previous research on SDN traffic engineering mostly focuses on static traffic, whereas dynamic traffic, though more practical, has drawn much less attention. Especially, online SDN multicast that supports IETF dynamic group membership (i.e., any user can join or leave at any time) has not been explored. Different from traditional shortest-path trees (SPT) and graph theoretical Steiner trees (ST), which concentrate on routing one tree at any instant, online SDN multicast traffic engineering is more challenging because it needs to support dynamic group membership and optimize a sequence of correlated trees without the knowledge of future join and leave, whereas the scalability of SDN due to limited TCAM is also crucial. In this paper, therefore, we formulate a new optimization problem, named Online Branch-aware Steiner Tree (OBST), to jointly consider the bandwidth consumption, SDN multicast scalability, and rerouting overhead. We prove that OBST is NP-hard and does not have a |Dmax| 1− -competitive algorithm for any > 0, where |Dmax| is the largest group size at any time. We design a |Dmax|competitive algorithm equipped with the notion of the budget, the deposit, and Reference Tree to achieve the tightest bound. The simulations and implementation on real SDNs with YouTube traffic manifest that the total cost can be reduced by at least 25% compared with SPT and ST, and the computation time is small for massive SDN.

Deadline-Aware Fast One-to-Many Bulk Transfers over Inter-Datacenter Networks

“…Multicasting: The demand pattern of one-to-many data transfers is similar to that of network-layer multicasting [39], [40], [41], [42], as both copy data from a sender to multiple receivers. The one-to-many data transfers among datacenters actually can be considered as a particular type of multicast traffic with unique characteristics.…”

QoS-Based Multicast Routing in Network Function Virtualization-Enabled Software-Defined Mobile Edge Computing Networks

“…Network traffic engineering has regained much attention due to the opportunities introduced by SDN [9,16,17]. Many studies are devoted to finding the optimal placement of VNFs [14,15,18,19].…”

“…Provisioning multicasting service with a specific network function chain in software-defined MEC is a promising technique and poses many challenges. Firstly, most of the studies on multicasting in MEC or SDN are based on classic IP multicast [9][10][11][12], which is not negligible to face those basic issues [13]. e applicability is necessary to be concerned before designing multicasting mechanism.…”

Research on scheduling method based on traffic matrix for IoT security

“…Huang et al 18 proposed Multi-Tree Routing and State Assignment Algorithm (MTRSA) to effectively find the routing of multiple multicast trees and assign the branch state nodes in order to reduce the total bandwidth cost. Chiang 19 proposed Online Branchaware Steiner Tree (OBST), to jointly minimize the bandwidth consumption, SDN multicast scalability, and rerouting overhead. Wang and Hua 20 propose an adaptive broadcast and multicast traffic cutting framework to reduce unnecessary broadcast and multicast packets and improve Ethernet efficiency, not only reduces ARP broadcast traffic, especially when there exist traditional switches in the LAN, but also saves the controller's overhead, as compared with other SDN-based approaches such as SEASDN and ETF.…”