Multicast CommunicationPresenter: Jyoti Islam

Advisor: Dr. Yanqing Zhang

2Outline

• What is multicast communication?

• Application-level multicasting

• Gossip-based data dissemination

• Techniques and applications

• Current Research Works

• Future Research Direction

3 Unicast, Broadcast

versus Multicast

• Unicast• One-to-one• Destination – unique receiver host address

• Broadcast• One-to-all• Destination – address of network

• Multicast• One-to-many• Multicast group must be identified• Destination – address of group

Key:

Unicast transfer

Broadcast transfer

Multicast transfer

4Application-Level Multicasting

5Application-Level Multicasting

• Nodes organize into an overlay network to disseminate data.

• Network routers are not involved in group membership.

Figure: Overlay Network

6Overlay Network

• Tree based design• A unique path for every node pair.

• Mesh network• Multiple neighbors of each node.• Multiple path between every node pair.

7Tree based Overlay Network

8ALM Issues

• A – root of the multicast tree.

• A multicasts a message to other nodes:

• Message traverse <B,Rb>, <Ra,Rb>, <Rc,Rd>, <D,Rd> twice.

• How to improve it???

9ALM Issues

• In stead of overlay link B to D; we need to form it from A to C.

• Double traversal of <Ra,Rb>, <Rc,Rd> would be saved.

10ALM Quality Measurement

11ALM Quality Measurement

Tree Cost:• Minimizing the total link costs.

• Finding a minimum spanning tree with minimal total time for disseminating information to all node.

12Research Problem

• When a new node want to join the multicast group, how to decide it’s parent node?

• Goal: Select the best member that can operate as new node’s parent.

13Multicast Group with Single Source

• Best node is always the source. • Stretch = 1• Star topology with source in middle.

• Source may be easily overloaded.

14Switch-Trees

• Helder and Jamin, 2002.

• Idea: A node P can switch parent.• Drop the link to current parent.

• Establish link to new parent.

• New parent should not have too many immediate children.• To limit the load of forwarding messages by any single node.

• Loop Prevention:• New parent can never be a member of the subtree rooted at P.

15Switch-Trees

• Also used to optimize the route to source.• Minimize delay of message multicasting.• If another node is better parent [in terms of delay], initiate switch.

• To optimize the tree cost- minimize total link cost.

16Node Failure

• If parent fails, simply attach to the root.

• Proceed optimization protocol.

17Gossip-based Data Dissemination

Epidemic Behavior

18Epidemic Protocols

• Rapidly propagate information.

• Large number of nodes.

• Only local information used.

• No central component to coordinate information dissemination.

19Basic Idea

INFECT ALL NODES WITH NEW INFORMATION AS FAST AS POSSIBLE.

20Some Terms

• Infected:• Node holding data and willing to spread it to other nodes.

• Susceptible:• Node that has not seen data yet.

• Removed:• Updated node not wiling or able to spread data.

21Two Forms of Epidemics

22Anti-entropy

23Gossiping

24Gossiping Issues

• Can not guarantee that all nodes will actually be updated.

• Nodes may refrain themselves to spread the information.

• Spreading data deletion information is hard.

25Deleting Values

26Application of Epidemic Protocols

27Multicast application examples

• Financial services• Delivery of news, stock quotes, financial indices, etc

• Remote conferencing/e-learning• Streaming audio and video to many participants

(clients, students)• Interactive communication between participants

• Data distribution• e.g., distribute experimental data from Large Hadron

Collider (LHC) at CERN lab to interested physicists around the world

28Current Research Work

29Multi Server Approach

• Variable number of server to meet user demand.

• Dynamic spilt and merge of server to handle large multicast group.

• Sukumar, R. "Some studies and analysis of secure multicast communication in wireless environment a multi server approach." (2015).

30Multimedia communication networks

• Each of the destination nodes should receive message within a bounded delay.

• Genetic algorithm for solving the delay-bounded multicast problem.

• Fast and superior quality solutions to the delay-bounded multicast problem.

• Ravikumar, C P; Bajpai, Rajneesh, “Source-based delay-bounded multicasting in multimedia”, 2015.

31Key Management

• Secure Multicast.

• Cloud Computing to manage large volume of data in multicast communication.

• Secure-multicast group key management protocol.

• Al Beladi, Shoroq Odah, and Firdous Kausar. "Key Management for Secure Multicast Communication in Sensor Cloud." Proceedings of the International Conference on Security and Management (SAM). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), 2015

32Device-to-device (D2D) Multicast Communication

• Particle swarm optimization (PSO) algorithm based power allocation schemes.

• Gong, Wenrong, and Xiaoxiang Wang. "Particle Swarm Optimization Based Power Allocation Schemes of Device-to-Device Multicast Communication." Wireless Personal Communications (2015): 1-17.

33Energy-Efficient Cooperative Multicast Communication

• Base station broadcasts the same information to a group of users in the first phase.

• Some successful users act as relay to help the failed users in the second phase.

• Shi, Wuyu, Guodong Zhao, and Zhi Chen. "Relay Selection and Power Control for Energy-Efficient Cooperative Multicast Communication." Vehicular Technology Conference (VTC Spring), 2015 IEEE 81st. IEEE, 2015.

34Future Research Direction

35Some Predictions

• Use of Cloud Computing for data storage and processing.

• Incorporate in Internet of Things.

• Multi Server Approach.

• Device to device communication.

• Energy Efficiency for Green Computing.

36Q&A

38References

• Distributed Systems: Principles and Paradigms. Andrew S. Tanenbaum Maarten van Steen.

• Sukumar, R. "Some studies and analysis of secure multicast communication in wireless environment a multi server approach." (2015).

• McCanne, Steven. "Performing multicast communication in computer networks by using overlay routing." U.S. Patent No. 8,667,173. 4 Mar. 2014.

• Zakaria, Omar, Aisha-Hassan A. Hashim, and Wan H. Hassan. "An Efficient Scalable Batch-Rekeying Scheme For Secure Multicast Communication Using Multiple Logical Key Trees." International Journal of Computer Science and Network Security (IJCSNS) 14.11 (2014): 35.

• Vijayakumar, Pandi, Sayan Bose, and Ajaykumar Kannan. "Chinese remainder Theorem based centralised group key management for secure multicast communication." Information Security, IET 8.3 (2014): 179-187.

• Ravikumar, C P; Bajpai, Rajneesh, “Source-based delay-bounded multicasting in multimedia”, 2015.

• Gong, Wenrong, and Xiaoxiang Wang. "Particle Swarm Optimization Based Power Allocation Schemes of Device-to-Device Multicast Communication." Wireless Personal Communications (2015): 1-17.

• Shi, Wuyu, Guodong Zhao, and Zhi Chen. "Relay Selection and Power Control for Energy-Efficient Cooperative Multicast Communication." Vehicular Technology Conference (VTC Spring), 2015 IEEE 81st. IEEE, 2015.