Reliability Issues of the Multicast-Based Mediacommunication

Author(s):  
Gábor Hosszú

The multimedia applications generally support one-tomany group communication. Multicasting decreases the communication costs for applications, which send the same data to multiple receivers. Table 1 summarizes the types of the communication among the hosts. Currently, there is an increasing need for scalable and efficient group communication. Theoretically, multicasting is optimal for such purposes. Therefore, this technology is an emerging media dissemination technology, instead of the traditional unicast communication. It has two important types: the networklevel, namely IP-multicast, and the Application-Layer, host-multicast. In the former one, the data packets are delivered by the IP protocol, from one host to many hosts that are member of a multicast group. The routers run an IP-multicast routing protocol in order to construct a multicast tree. Along this tree, the data is forwarded to each host. Special IP addresses (224.0.0.0 - 239.255.255.255 address range) are used, which do not belong to hosts, but rather define multicast channels. In the case of Application-Layer Multicast (ALM), the hosts use unicast IP delivery, and the routers do not play any special role. Reliability is one of the most important features of all multimedia applications, independently from the multicast technology in use. This requirement is especially critical in the case of multicast, where the large volume of data is to be transferred, and correction or resending of lost data is even more difficult in time. In the multicast technology, the maintenance of the group membership information is also an important question from the point of view of the robustness of the so-called multicast delivery tree. The root of the tree is the sender, the leaves are the receivers, and the intermediate nodes are the routers in case of the IP-multicast. In the following sections, the reliability properties of different multicast technologies are overviewed.

2000 ◽  
Vol 32 (1) ◽  
pp. 35-60 ◽  
Author(s):  
Sudhir Aggarwal ◽  
Sanjoy Paul ◽  
Daniel Massey ◽  
Daniela Caldararu

2012 ◽  
Vol 17 (1-2) ◽  
pp. 19-31
Author(s):  
Krzysztof Stachowiak ◽  
Tytus Pawlak ◽  
Maciej Piechowiak

Abstract For almost three decades the multicast communication has been a subject of a dynamic research. It came to the world of the packet switching networks rather late and still has not become a fist class citizen of the Internet, yet the demand for such services is growing and thus the relevant technologies evolve persistently providing increasing quality and availability of the means of the group communication. The overlay approach to the multicast is an application layer realization which came to life due to certain deficiencies at the lower layers. In general the gain from using multicast for group communication instead of duplicated unicast links is that we avoid sending the same data many times through a single link. Such gain may be achieved wit the use of the router level mulitcast solution. The overlay solutions tend to approach his level of efficiency with a different degree of success. Therefore one of the main characteristics that is interesting when evaluating a particular overlay protocol is how well does it achieve the aforementioned gain. There are several metrics that allow for objective comparison of protocols in this regard. However this is not the only point of view to provide a valuable evaluation of the multicast overlay solutions. One of the important aspects of the modern group communication such as the IPTV or teleconferencing is the dynamic nature of the users’ participation. A particular group may be joined and left by multiple users at a very frequent rate which is critical to the resources management as well as to maintaining the integrity of the abstract communication structure, e.g. a tree spanning all the participants. In such case two major classes of the evaluation criteria emerge: the statical and the dynamical ones. They’re both very important and interdependent, however the means to measure them may differ significantly. In this article a wide variety of the multicast overlay protocols have been analysed and two of them have been chosen to be compared. The stress of the evaluation has been put on the dynamic aspects of the multicast overlay protocols operation.


2017 ◽  
Vol 13 (10) ◽  
pp. 6563-6569
Author(s):  
SUMA N ◽  
GOPINATH S

In Mobile Ad hoc network (MANET), link quality and stability of links as well as nodes play a major role. In ad hoc network, links are often changing which could affect the node mobility and integrity of data packets. In this research work, Network Reliability based Secure Multicast Routing Protocol (NRSMRP) is proposed to achieve network reliability by means of creation of reliable multicast tree. This multicast tree is constructed based on link quality and reliability trust metric. In first phase, node categorization and reliability metric calculation are implemented with the help of link quality. In second phase, reliable multicast tree is formed based on parent node and child node. Parent node must have god capacity and signal strength to communicate with child node. In last phase, authentication based multicast routes are established based on the calculation of direct reputation of mobile nodes. From the results, proposed protocol achieves better performance than existing schemes.


2020 ◽  
pp. 26-32
Author(s):  
R.Pandi Selvam ◽  

A MANET is a self-conFigureuring system of mobile hosts connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Routing is the process of exchanging information from one station to the other stations of the network. Multicasting is a popular mechanism for supporting group communication. In a multicast session, the sender transmits only one copy of each message that is replicated within the network and delivered to multiple recipients. This multicast routing is highly deal with self-organized network in recent days due to its broadcast characteristics. However, devising multicast protocols to provide group communications in mobile ad-hoc networks is significantly more complicated, because of the wireless medium, changing topology, battery power and available bandwidth as well. This paper, evaluates two prominent on-demand multicast routing protocols for group communication, namely, Multicast Ad hoc On-Demand Distance Vector (MAODV) and On-Demand Multicast Routing Protocol(ODMRP) as increasing number of multicast sources and receivers in both single-active multicast group and multi-active multicast group in the network.


Author(s):  
Gopi Arepalli ◽  
Suresh Babu Erukula

An Ad-hoc Network covers a set of autonomous mobile nodes that communicates through wireless communication in an infrastructure-less environment. Mostly MANETs are used in group communication mechanisms like military applications, emergency search, rescue operations, vehicular ad-hoc communications and mining operations etc. In such type of networks, group communication is takes place by multicasting technique. Communication and collaboration is necessary among the nodes in the groups in multicast protocols. PUMA has the best multicast routing protocol compared to tree and mesh based multicast protocols although it suffers from security issues. PUMA mainly suffers from Man In The middle attack. MITM attack generates traffic flow, drop the packets and miscommunicate the neighbor nodes with false hop count. So defending from MITM attack we designed a new mechanism called Elliptic Curve Group Diffie-Hellman (ECGDH). This paper compares results of PUMA [1] routing protocol with legitimate, under attack and after providing security against attack. Finally we observed ECGDH [2] gives efficient results even attack has happened.


Author(s):  
Gábor Hosszú

Collaborating and media-handling applications demand efficient and scalable methods for media streaming and group communication; however, such mechanisms have still not been deployed widely in the Internet. Network-level multicasting (in the Internet it is called IP-multicast) gives a bandwidth-saving solution for the one-to-many and many-to-many group communication, since it provides an efficient network mechanism through which senders can transmit their information to a large number of receivers without having to send multiple copies of the same data over a physical link (Hosszú, 2001). The IP-multicast has been realized for research purposes on multicast-capable networks (so-called multicast islands) within the Internet, but wide-scale deployment has not been reached due to some unresolved issues. That is why recent efforts are in the development of multicasting protocols at the application layer instead of the network layer. Most of these Application-Layer Multicast (ALM) protocols address the case of a single-source streaming media to a large number of receivers in applications such as video on demand or live broadcast. In the following sections, the main properties of the ALM protocols are overviewed, then some typical ALM solutions and a new approach are presented.


Author(s):  
Gopi Arepalli ◽  
Suresh Babu Erukula

An Ad-hoc Network covers a set of autonomous mobile nodes that communicates through wireless communication in an infrastructure-less environment. Mostly MANETs are used in group communication mechanisms like military applications, emergency search, rescue operations, vehicular ad-hoc communications and mining operations etc. In such type of networks, group communication is takes place by multicasting technique. Communication and collaboration is necessary among the nodes in the groups in multicast protocols. PUMA has the best multicast routing protocol compared to tree and mesh based multicast protocols although it suffers from security issues. PUMA mainly suffers from Man In The middle attack. MITM attack generates traffic flow, drop the packets and miscommunicate the neighbor nodes with false hop count. So defending from MITM attack we designed a new mechanism called Elliptic Curve Group Diffie-Hellman (ECGDH). This paper compares results of PUMA [1] routing protocol with legitimate, under attack and after providing security against attack. Finally we observed ECGDH [2] gives efficient results even attack has happened.


Sign in / Sign up

Export Citation Format

Share Document