Software defined network-enabled multicast for multi-party video conferencing systems

Zhao, Miao; Jia, Bin; Wu, Mingquan; Yu, Heather; Xu, Yang

doi:10.1109/icc.2014.6883572

Cited by 30 publications

(24 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…; C re f ← C(G t v ); 8 end 9 for each missing NF ( f ) from G v do link nearest NFV node that can host f to P c,t, f , and remove unnecessary edges; 10 for path from f i to f i+1 for each t in G v do 11 success ← false; 12 for j = 1 : J do 13 Find temp = min{K t i,i+1 , j} paths from G;…”

Section: B Multi-service Scenariomentioning

confidence: 99%

A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks

Alhussein

Thinh

et al. 2020

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The paradigm of network function virtualization (NFV) with the support of software defined networking (SDN) emerges as a promising approach for customizing network services in fifth generation (5G) networks. In this paper, a multicast service orchestration framework is presented, where joint traffic routing and virtual network function (NF) placement are studied for accommodating multicast services over an NFVenabled physical substrate network. First, we investigate a joint routing and NF placement problem for a single multicast request accommodated over a physical substrate network, with both single-path and multipath traffic routing. The joint problem is formulated as a mixed integer linear programming (MILP) problem to minimize the function and link provisioning costs, under the physical network resource constraints, flow conservation constraints, and NF placement rules; Second, we develop an MILP formulation that jointly handles the static embedding of multiple service requests over the physical substrate network, where we determine the optimal combination of multiple services for embedding and their joint routing and placement configurations, such that the aggregate throughput of the physical substrate is maximized, while the function and link provisioning costs are minimized. Since the presented problem formulations are NPhard, low complexity heuristic algorithms are proposed to find an efficient solution for both single-path and multipath routing scenarios. Simulation results are presented to demonstrate the effectiveness and accuracy of the proposed heuristic algorithms.

show abstract

Section: B Multi-service Scenariomentioning

confidence: 99%

A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks

Alhussein

Thinh

et al. 2020

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…It is worth mentioning that we have studied constrained ST based on tree growth for a multicast routing problem with quality-of-service requirements. [33][34][35][36] To the best of our knowledge, there has been no research on disaster backup with multicast in SDN. 28 Fortunately, the emergence of SDN makes it possible to realize novel multicast protocols, including the heuristic ST. For SDN multicasting, this distributed mechanism can be concentrated in the SDN controller, leading to simpler implementation of multicast.…”

Section: Disaster Backup Among Mutiple Dcsmentioning

confidence: 99%

“…31,32 For multiple bulk data transfers with a multicast mechanism in SDN, some new researches have emerged in recent years, mainly about video streaming multicast. [33][34][35][36] To the best of our knowledge, there has been no research on disaster backup with multicast in SDN. In this paper, we leverage SDN to realize customized bandwidth allocation and flow control for bandwidth-efficient data transmission in disaster backup.…”

Section: Disaster Backup Among Mutiple Dcsmentioning

confidence: 99%

Cost‐efficient disaster backup for multiple data centers using capacity‐constrained multicast

Wang

Shen

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

To leverage periodic disaster backup in a cloud data center (DC) network, previous studies employ disjoint unicast paths for bulk data transfers among multiple geographically distributed DCs, causing massive unnecessary traffic duplication. This not only adds the overhead but also may result in severe network congestion. With flexible network resource management in software-defined networks and powerful traffic aggregation capability of multicast, we propose capacity-constrained multicast to realize cost-efficient disaster backup. First, considering limited backup storage capacity and essential redundancy guarantee, we construct a capacity-constrained multicasting backup model. Then, we formulate the disaster backup problem as capacity-constrained multiple Steiner tree problem, which is NP-hard. To solve this problem, we design a new multicasting backup ant colony optimization algorithm based on requirement-aware growth. It directly optimizes every disaster-backup multicast tree (DBMT) from its root node to cover enough destination nodes guaranteeing sufficient redundancy and then expands them into the forest under the guidance of a multicast tree shared degree, the ratio of available storage capacity, and backup load distribution offset. We introduce unique edge fitness evaluation and pheromones for every DBMT to reduce mutual influences among multiple trees. Extensive simulations demonstrate that our strategy performs with less bandwidth consumption cost and relatively good backup load distribution fairness simultaneously. KEYWORDScapacity-constrained, cost-efficient, disaster backup, multiple Steiner tree INTRODUCTIONWith more and more frequent occurrence of natural disasters and human-made intentional attacks on application data centers (DCs), 1,2 a large number of data face the risk of failure. Therefore, people need to leverage periodic backup among multiple geographically distributed (geo-distributed) DCs. 3 To improve the fault-tolerant performance and obtain sufficient data redundancy, terabytes to petabytes of data produced during a period are regularly replicated and assigned to three or more other remote DCs, 4 called disaster backup. Due to the huge amount of data transfers, disaster backup activity always consumes huge bandwidth and imposes a heavy load to the links between DCs and may even cause network congestion. Therefore, to support quality-of-service requirements of various real-time applications in network, the traffic engineering problem for disaster backup among multiple DCs is of significant importance.It is noteworthy that in the research area of traffic engineering for multiple disaster-backup transfers, unicast routing has been studied widely, while multicast routing attracts much less attention. Multicast is designed to deliver contents to a large number of destinations and benefits DC group communications in three aspects. By saving network traffic, it can increase the throughput of bandwidth-hungry computations. By releasing the sender from sending multiple copies of packets to diffe...

show abstract

“…Some researchers [10][11][12][13][14][15][16][17][18] in this field proposed similar reroute scheme for video transmission via SDN-based approach. In, 10 the authors assume that the amount of video traffic in the network is much smaller than the best effort traffic and exploit linear programming technique to determine the QoS flow routes for video streams.…”

Section: Related Workmentioning

confidence: 99%

Genetic algorithm‐based routing method for enhanced video delivery over software defined networks

2017

Int J Communication

View full text Add to dashboard Cite

SummaryVideo streaming has emerged as a killer application in today's Internet, delivering a tremendous amount of media contents to millions of users at any given time. Such a heavy traffic load demands an effective routing method. In this paper, an effective routing method, named GA-SDN, is developed based on software defined network (SDN) technique. To facilitate the researchers in this field to evaluate the video delivery quality over SDN, an evaluation framework and its associated source codes are provided. The framework integrates the H.264 Scalable Video coding streaming Evaluation Framework (SVEF) with the Mininet emulator. Through this framework, video processing researchers can evaluate their proposed coding algorithms in an SDN-enabled network emulator, while network operators or executives can evaluate the impact of real video streams on the developing network architectures or protocols. Experiment results demonstrate the usefulness of myEvalSVC_SDN and prove that GA-SDN outperforms traditional Bellman-Ford routing algorithm in terms of packet drop rate, throughput, and average peak signal-to-noise ratio.

show abstract

Software defined network-enabled multicast for multi-party video conferencing systems

Cited by 30 publications

References 3 publications

A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks

A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks

Cost‐efficient disaster backup for multiple data centers using capacity‐constrained multicast

Genetic algorithm‐based routing method for enhanced video delivery over software defined networks

Contact Info

Product

Resources

About