A Survey on Multicasting in Software-Defined Networking

Islam, Salekul; Muslim, Nasif; Atwood, J. William

doi:10.1109/comst.2017.2776213

Cited by 70 publications

(33 citation statements)

References 91 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Because multicast can avoid unnecessary duplicated transmissions among a set of independent unicast paths towards multiple destinations by multiplexing a shared multicast tree. 29 However, the multicast problem in SDNs still attracts much less attention from both academia and industry. It is worth mentioning that we have studied constrained ST based on tree growth for a multicast routing problem with quality-of-service requirements.…”

Section: Disaster Backup Among Mutiple Dcsmentioning

confidence: 99%

“…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. 29 However, the multicast problem in SDNs still attracts much less attention from both academia and industry. Despite such bandwidth superiority, multicast in the Internet suffers many deploying obstacles during the past decades.…”

Section: Disaster Backup Among Mutiple Dcsmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Disaster Backup Among Mutiple Dcsmentioning

confidence: 99%

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

show abstract

“…This method needs some modifications in IGMP and also consider that the CBT gets deployed. In CBT, intermediate routers directly deliver the packets to the group members while transferring the packets to the Routing Protocol (RP) [31]. This SMKD method depends on the fundamental multicast RP and believes the intermediate routers that every node receives similar key same as that of the group controller.…”

Section: Scalable Multicast Key Distributionmentioning

confidence: 99%

Multicast Communication using Different Group Key Managements

S¹,

Aithal²,

Shetty³

2019

IJRTE

View full text Add to dashboard Cite

Abstract: The most appropriate communication mechanism for transfer of packets from one source to another is multicast IPv6 communication. Nowadays, multicast communication plays a major role in a large number of communication applications. In this multicast communication, the message privacy attains a highest position. The members of multicast are dynamic so they permit the host members to enter and depart the cluster without the permission of remaining group members and, it can't provide any transfer without the interference of host, this may reduce the performance. For security enhancement in multicast communication Group Key Management (GKM) was introduced.There are three different approaches in GKM and they were mainly involved to overcome the issues of host mobility in multicast communication. The challenges that are encountered by these GKM approaches their requirements and challenges was also discussed in this paper. Finally, some questions and their explanations were provided along with it. These GKM approaches will improve the privacy of multicast communication. So, the packets can deliver to the group members without any interference.

show abstract

“…Multicast has been broadly studied in the context of widearea networks [43]. EDC, however, differs in many ways from the wide-area profile given that a single administrative domain has control over the entire topology and it is no longer needed to run the decentralized protocols like IGMP and PIM.…”

Section: Multicast Communicationmentioning

confidence: 99%

RDNA: Residue-Defined Networking Architecture Enabling Ultra-Reliable Low-Latency Datacenters

Liberato

Martinello

Gomes

et al. 2018

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

General rightsThis document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: http://www.bristol.ac.uk/pure/userguides/explore-bristol-research/ebr-terms/ 1932-4537 (c)Abstract-Datacenter (DC) design has been moved towards the edge computing paradigm motivated by the need of bringing cloud resources closer to end users. However, the Software Defined Networking (SDN) architecture offers no clue to the design of Micro Datacenters (MDC) for meeting complex and stringent requirements from next generation 5G networks. This is because canonical SDN lacks a clear distinction between functional network parts, such as core and edge elements. Besides, there is no decoupling between the routing and the network policy. In this paper, we introduce Residue Defined Networking Architecture (RDNA) as a new approach for enabling key features like ultra-reliable and low-latency communication in MDC networks. RDNA explores the programmability of Residues Number System (RNS) as a fundamental concept to define a minimalist forwarding model for core nodes. Instead of forwarding packets based on classical table lookup operations, core nodes are tableless switches that forward packets using merely remainder of the division (modulo) operations. By solving a residue congruence system representing a network topology, we found out the algorithms and their mathematical properties to design RDNA's routing system that (i) supports unicast and multicast communication, (ii) provides resilient routes with protection for the entire route, and (iii) is scalable for 2-tier Clos topologies. Experimental implementations on Mininet and NetFPGA SUME show that RDNA achieves 600 ns switching latency per hop with virtually no jitter at core nodes and submillisecond failure recovery time.

show abstract

A Survey on Multicasting in Software-Defined Networking

Cited by 70 publications

References 91 publications

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

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

Multicast Communication using Different Group Key Managements

RDNA: Residue-Defined Networking Architecture Enabling Ultra-Reliable Low-Latency Datacenters

Contact Info

Product

Resources

About