Thematic-Based Group Communication

2011 ◽  
pp. 1636-1642
Author(s):  
Raymond Pardede ◽  
Gábor Hosszú ◽  
Ferenc Kovács
Keyword(s):  
Relative Density ◽  
Group Communication ◽  
Ip Multicast ◽  
Transport Protocol ◽  
Analysis Tool ◽  
Physical Network ◽  
Slow Pace ◽  
Application Level Multicast ◽  
Novel Concept ◽  
Network Scalability

In the network level computer group-communication (one-to-many) technology, IP-multicast contributes significant roles in enhancing the physical network scalability by replicating identical packets at routers. However, since its initial proposal the IP-multicast has not been widely enabled due to the slow pace of its deployment. Hence, the application-level multicast (ALM) concept emerged to solve this deployment issue by shifting the multicast support from routers to end-systems. The article reviews the most important facts of the Application-Level Multicast and its proposed models. Furthermore, the article describes a novel concept of modeling relative density of members called bunched mode and a proposed host-end multicast transport protocol called shortest tunnel first (STF). The bunched mode is based on the thematic multicast concept (TMC), which means that it is a typical multicast scenario where there are a lot of interested hosts in certain institutes and these institutes are relatively far from each other. The developed analysis tool NetSim and the implementation of the TMC called PardedeCAST are also presented as the tools of this research.

A Clustering Model of the Application-Level Multicast

2008 ◽  
pp. 86-92
Author(s):  
Gábor Hosszú ◽  
Raymond Pardede
Keyword(s):  
Relative Density ◽  
Routing Protocol ◽  
Multicast Routing ◽  
Analysis Tool ◽  
Multicast Group ◽  
Clustering Model ◽  
Multicast Routing Protocol ◽  
Application Level Multicast ◽  
Novel Concept

This chapter reviews the most important fact of the application-level multicast (ALM) and then describes a novel concept of modeling relative density of members called bunched mode and a proposed host-end multicast routing protocol called shortest tunnel first(STF). The bunched mode is based on the thematic multicast concept (TMC), which means that it is atypical multicast scenario where there are a lot of interested hosts in certain institutions, relatively far from each other. This situation is called bunched mode, in which the members of a multicast group are locally in the dense mode, and globally their situation is similar to the sparse mode because these spots are far from each other. The developed analysis tool, Net Sim, and the implementation of the TMC, Pardede CAST, are also presented as the tools of this research.

Thematic-Based Group Communication

2011 ◽  
pp. 624-630
Author(s):  
Raymond Pardede ◽  
Gábor Hosszú ◽  
Ferenc Kovács
Keyword(s):  
Ad Hoc Networks ◽  
Relative Density ◽  
Ad Hoc ◽  
Group Communication ◽  
Transport Protocol ◽  
Multicast Group ◽  
Hoc Networks ◽  
Novel Concept

This article reviews the most important fact of the ALM and introduces to the emerging area of the multicasting, namely the multicast over ad hoc networks, including geocast. After these a novel concept of modeling relative density of members called bunched mode and a proposed ALM multicast transport protocol called shortest tunnel first (STF) are described. The bunched mode is based on the thematic multicast concept (TMC), which means that it is a typical multicast scenario where there are many interested hosts in certain institutes and these institutes are relatively far from each other. This situation is called bunched mode, in which the members of a multicast group are locally in the dense mode, and globally their situation similar to the sparse mode because these spots are far from each other. This article also presents a simple chatting program called PardedeCAST as the tools of STF and TMC research.

BAM-Chord

2013 ◽  
Vol 4 (1) ◽  
pp. 43-55 ◽  
Author(s):  
Hoai Son Nguyen ◽  
Ngoc Anh Nguyen ◽  
Huong Bui Thi Lan
Keyword(s):  
Multicast Tree ◽  
Effective Bandwidth ◽  
Bandwidth Utilization ◽  
Hash Tables ◽  
Application Level Multicast ◽  
Technical Issues ◽  
Adaptive Multicast ◽  
Bandwidth Capacity ◽  
Node Identifier ◽  
Network Scalability

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.

A NEW APPROACH FOR CENTRALIZED END-SYSTEM MULTICAST PROTOCOL

2006 ◽  
Vol 03 (01) ◽  
pp. 77-84 ◽  
Author(s):  
AYMAN EL-SAYED
Keyword(s):  
Load Balance ◽  
Multicast Routing ◽  
Group Communication ◽  
Communication Service ◽  
New Approach ◽  
Multicast Protocol ◽  
Group Control ◽  
Application Level Multicast ◽  
Single Host ◽  
Group Members

In this paper we propose a new approach of application-level multicast protocol providing a group communication service. This protocol, called End-System Multicast (ESM), and can be used when native multicast routing is not available. ESM is a centralized protocol where everything is being controlled by a single host called Rendez-vous point (RPL1), connected indirectly to the group members via some hosts called secondary Rendez-vous Point (RPL2). Each RPL2 has some group members that constitute a cluster, and each cluster is controlled by its RPL2. Since the group control is divided among some RPL2 and a main controller (RPL1) manages the relation among RPL2 s and between itself and RPL2 s , we found that the scalability is improved and it also avoids the bottleneck problem near the RPL1, or there is a load balance.

Reliability Issues of the Multicast-Based Mediacommunication

2009 ◽  
pp. 1215-1223
Author(s):  
Gábor Hosszú
Keyword(s):  
Multicast Routing ◽  
Group Communication ◽  
Multimedia Applications ◽  
Point Of View ◽  
Multicast Tree ◽  
Ip Multicast ◽  
Special Role ◽  
Application Layer ◽  
Emerging Media ◽  
Multicast Routing Protocol

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.

Sign in / Sign up

Export Citation Format

Share Document