A Clustering Model of the Application-Level Multicast
نویسندگان
چکیده
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 a typical 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, NetSim, and the implementation of the TMC, PardedeCAST, are also presented as the tools of this research.
منابع مشابه
Interference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملAn Evaluation of Preference Clustering in Large-Scale Multicast Applications
The efficiency of using multicast in multi-party applications is constrained by preference heterogeneity, where receivers range in their preferences for application data. We examine an approach in which approximately similar sources and receivers are clustered into multicast groups. The goal is to maximize preference overlap within each group while satisfying the constraint of limited network r...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملSpatial Clustering for IP Multicast: Algorithms and an Application
We introduce spatial clustering of multicast group members as a mechanism to scale wide-area multicast-based applications. To motivate the use of such structures, we present a clustering based re-keying scheme for secure multicast. Using amortized analysis, we show that the communication, processing, and storage costs for this scheme to distribute keys upon membership changes is of constant ord...
متن کاملA Preference Clustering Protocol for Large-Scale Multicast Applications
IP Multicast has enabled a variety of large-scale applications on the Internet which would otherwise bombard the network and the content servers if unicast communication was used. However, the eeciency of multicast is often constrained by preference heterogeneity, where receivers range in their preferences for application data. We examine an approach in which approximately similar preferences a...
متن کاملThe Application of Combined Fuzzy Clustering Model and Neural Networks to Measure Valuably of Bank Customers
Currently, acquisition of resources in banks is subject to attraction of the resources of banking customers. Meanwhile, the Bank’s valuable customers are one of the best resources to make profit for banks. Several different models are introduced for evaluation of profitability of the customers; but most of them are classical models and they are unable to evaluate the customers in complete and o...
متن کامل