Efficient Capacity-Constrained Multicast in RC-Based P2P Networks

Application level multicast is independent of router infrastructure unlike router-based IP multicast. The existing DHT-based application level multicast protocols work efficiently as long as there is almost no churn; otherwise, their performances start degrading drastically, because DHT – based architecture cannot handle churn effectively. Besides, most of DHT-based multicast protocols consider single data source and do not consider peer heterogeneity. In this work, we have considered an existing non-DHT based P2P architecture, viz., Residue Class based (RC-based) architecture which has already been shown to perform much better than some well-known DHT-based architectures from the viewpoints of speed of unicast communication and churn handling. We have presented a highly efficient capacity-constrained and any source multicast protocol suitable for the RC-based P2P architecture as mentioned above.

A Generic Review of Messenger Application: Wechat And Whatsapp

Over the Internet today, communication environment is more easy and interesting to the citizen. There are much interesting in modern technology when they provided a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. The important objective of this article is getting information about comparison of two distributed system in messenger application. Messenger application is known as a tool communication that can get any information. The distributed system is one of the independent and single coherent systems it was built an application that will be informed that section is being fixed or replaces to serve more applications or users. The distributed system for this article about the comparison of two distributed system in messenger application for WeChat and Whatsapp, it is also known as the famous application for this generations nowadays.

Topology Optimization for Heterogeneous DHT-Based Multicast

Since the deployment of IP multicast remains restricted due to many practical and political issues, researchers have shifted focus to exploiting application-layer multicast for multicast data delivery. Recently there has been considerable interest in applying DHT routing algorithms to application-level multicast. However, early DHT-based multicast protocols are insufficient in addressing a number of technical issues such as heterogeneous capacity of nodes or node churn. In this chapter, the author describes a solution called BAM-Chord (i.e., Bandwidth Adaptive Multicast over Chord) that optimizes the topology of a multicast tree based on node bandwidth. In the proposed solution, node position (i.e., node identifier) on a BAM-Chord ring will be decided based on node bandwidth capacity such that it can build a wide and balanced multicast tree rooted at the source node. As a result, BAM-Chord protocol can utilize network resources of every node to reduce the depth of the multicast tree and take advantages of DHTs in maintaining the multicast tree.

The Application Level Multicast Technique Algorithms Oriented to P2P Video

Firstly challenges in P2P media streaming applications were pointed out, then some recent research results such as application-level multicast tree, heterogeneity of network and incentive mechanism and so on were introduced. This paper has proposed a new model of application level multicast named DHCM (density-based hierarchical clustering multicast)which has improved IHC arithmetic．DHCM divides the hosts into many hierarchies according to their density，and constructs a density tree to realize the shortest routing．The tree delivers the content of video server to each host in density tree and uses a P2P scheme in data transmission．By this way the application-level multicast has been realized．This density tree has the homogeneity and monotonic properties．The experiment result has proved that DHCM can transmit the video stream efficiently and robustly.

BAM-Chord

In recent years, there has been considerable interest in applying Distributed Hash Tables (DHTs) to application-level multicast since DHTs have many advantages that are good for multicast applications: decentralization, scalability, fault tolerance, load balancing, and good routing performances. However, an effective bandwidth utilization method is required for DHT-based multicast systems because of a number of technical issues such as heterogeneous node capacity and dynamic membership. In this paper, the authors propose their BAM-Chord (i.e., Bandwidth Adaptive Multicast over Chord), a DHT-based multicast system that focuses on host heterogeneity, network scalability and effective bandwidth utilization. In the authors’ system, when a node joins into the system, it will find out an appropriate position (i.e., node identifier) on a BAM-Chord ring and create links to neighbor nodes based on node’s bandwidth capacity such that the multicast tree can be built efficiently and balanced. Therefore, their system can utilize bandwidth of every node efficiently to reduce the depth of the multicast tree, increase network scalability and take advantages of DHTs in maintaining the multicast tree.