Multicast Structure Research Articles

Real-Time Streaming Relay Mechanism for P2P Conferences on Hierarchical Overlay Networks

A peer-to-peer (P2P) multimedia conferencing service is operating that users share their resources to each other on the Internet. It can solve the problem in the centralized conferencing architecture, such as the centralized loading, single point error, and expensive infrastructure. However, P2P networks have the problem that a peer has a difference between the physical location and logical location in the overlay network. In the viewpoint of P2P networks, the nearest conference resource may be far away geographically. The P2P-session initiation protocol (P2P-SIP) multimedia conference is to construct an application-based logical multicast network efficiently according to physical network information. Thus, this paper proposes a real-time streaming relay mechanism for P2P conferences on hierarchical overlay networks. The real-time streaming relay mechanism can improve the transportation efficiency of conferencing stream exchange well based on the application-layer multicast (ALM) structure and the hierarchical overlay networks.

A Cluster‐Based Opportunistic Multicast in Multi‐hop Wireless Networks

Multicast has become increasingly important in multi-hop wireless networks for such applications which deliver shared media and data to multiple receivers. However, the existing multicast protocols for wireless network have large control overhead, and cannot adequately take the advantage of broadcast communication mode in multicast structure for sharing the forwarding path. This paper proposes a Cluster-based opportunistic multicast (COM) algorithm, which constructs multicast tree structure based on clusters by utilizing a stability greedy algorithm to achieve the minimum total Cluster-based expected transmission count (CETX). In this multicast tree structure, the edge is created between the kernel sets respectively belonging to two clusters for improving the forwarding efficiency and the stability of this structure. In the process of data distribution, our multi-layer solution combines multicast and opportunistic routing to improve the efficiency of transmission. Simulation results show that COM scheme can achieve the less total number of sending packets, and higher stability than other topology-based solutions and opportunistic multicast.

Hierarchical agent-based secure and reliable multicast in wireless mesh networks

We propose and analyze a hierarchical agent-based secure and reliable multicast (HASRM) algorithm for efficiently supporting secure and reliable mobile multicast in wireless mesh networks, with design considerations given to minimize the overall network cost incurred by reliable multicast packet delivery, mobility management, security key management, and group membership maintenance. HASRM dynamically maintains a group of multicast agents running on mesh routers for integrated mobility and multicast service management and leverages a hierarchical multicast structure for secure and reliable multicast data delivery. The regional service size of each multicast agent is a key design parameter. We show via model-based performance analysis and simulation validation that there exists an optimal regional service size that minimizes the overall communication cost and the optimal regional service size can be dynamically determined. We demonstrate that HASRM under optimal settings significantly outperforms traditional algorithms based on shortest-path multicast trees extended with user mobility, security, and reliability support. We also show that a variant of HASRM is superior to a recently proposed multicast algorithm for secure group communication in wireless mesh networks.

A Dynamic Model of Hierarchical Application Layer Multicast Tree Node Failure Epidemic

Failure Detection periodically detects node validity to maintain application layer network stability. The detection cycle interval value is a key parameter for detection scheme performance; there have been few studies on models of analyzing cycle interval value affecting the scheme. We propose a dynamic model of hierarchical application layer multicast tree node failure epidemic SIRS (NFE-SIRS). The NFE-SIRS analyzes statistical node failure in hierarchical application layer multicast tree structure, and models relationship between cycle interval value and detection scheme repair behavior, finally obtains the expected cycle interval value to improve detection scheme performance. Simulation shows that, the NFE-SIRS can dramatically improve detection scheme performance compared with common fixed cycle interval detection scheme.

Dynamic agent-based hierarchical multicast for wireless mesh networks

We propose and analyze a multicast algorithm named Dynamic Agent-based Hierarchical Multicast (DAHM) for wireless mesh networks that supports user mobility and dynamic group membership. The objective of DAHM is to minimize the overall network cost incurred. DAHM dynamically selects multicast routers serving as multicast agents for integrated mobility and multicast service management, effectively combining backbone multicast routing and local unicast routing into an integrated algorithm. As the name suggests, DAHM employs a two-level hierarchical multicast structure. At the upper level is a backbone multicast tree consisting of mesh routers with multicast agents being the leaves. At the lower level, each multicast agent services those multicast group members within its service region. A multicast group member changes its multicast agent when it moves out of the service region of the current multicast agent. The optimal service region size of a multicast agent is a critical system parameter. We propose a model-based approach to dynamically determine the optimal service region size that achieves network cost minimization. Through a comparative performance study, we show that DAHM significantly outperforms two existing baseline multicast algorithms based on multicast tree structures with dynamic updates upon member movement and group membership changes.

Multicast Routing in Computer Networks considering Quality of Service (QoS) based on Honey Bee Algorithm

The main purpose of multicast routing is minimizing the sources relationship by using multicast structure and the purpose will prepare the routing by minimizing the tree's cost. The Steiner tree's issue is to find a tree the least cost in the network in a way that total weights of the tree should be minimized and connect one or more sources to one or more destinations. The weights which are applied to the edge of the tree could include one or more limitations of quality of service such as bandwidth, delay and cost. It is improved that finding such a tree in the network is a NP-COMPLETE problem. So, a real answer can't be find for that and approximate and discovering solutions are proposed for that. In this paper a suitable answer for mentioned NP-COMPLETE problem is found by presenting a new algorithm according to bee algorithm. Bee algorithm is a collective smart searching algorithm for optimizing the solution of problem. The applied results show that the proposed algorithm with regard to genetic algorithm and practice swarm optimization of Steiner tree with more suitable application percent computers the relation among bandwidth, delay and cost. General Terms

The cost optimal solution of the multi-constrained multicast routing problem

In this paper, we define the cost optimal solution of the multi-constrained multicast routing problem. This problem consists in finding a multicast structure that spans a source node and a set of destinations with respect to a set of constraints, while minimizing a cost function. This optimization is particularly interesting for multicast network communications that require Quality of Service (QoS) guarantees. Finding such a structure that satisfies the set of constraints is an NP-hard problem. To solve the addressed routing problem, most of the proposed algorithms focus on multicast trees. In some cases, the optimal spanning structure (i.e. the optimal multicast route) is neither a tree nor a set of trees nor a set of optimal QoS paths. The main result of our study is the exact identification of this optimal solution. We demonstrate that the optimal connected partial spanning structure that solves the multi-constrained multicast routing problem always corresponds to a hierarchy, a recently proposed generalization of the tree concept. We define the directed partial minimum spanning hierarchies as optimal solutions for the multi-constrained multicast routing problem and analyze their relevant properties. To our knowledge, our paper is the first study that exactly describes the cost optimal solution of this NP-hard problem.

Stateless Multicasting in Mobile Ad Hoc Networks

There are increasing interest and big challenges in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group membership management, multicast packet forwarding, and the maintenance of multicast structure over the dynamic network topology for a large group size or network size. In this paper, we propose a novel Robust and Scalable Geographic Multicast Protocol (RSGM). Several virtual architectures are used in the protocol without need of maintaining state information for more robust and scalable membership management and packet forwarding in the presence of high network dynamics due to unstable wireless channels and node movements. Specifically, scalable and efficient group membership management is performed through a virtual-zone-based structure, and the location service for group members is integrated with the membership management. Both the control messages and data packets are forwarded along efficient tree-like paths, but there is no need to explicitly create and actively maintain a tree structure. The stateless virtual-tree-based structures significantly reduce the tree management overhead, support more efficient transmissions, and make the transmissions much more robust to dynamics. Geographic forwarding is used to achieve further scalability and robustness. To avoid periodic flooding of the source information throughout the network, an efficient source tracking mechanism is designed. Furthermore, we handle the empty-zone problem faced by most zone-based routing protocols. We have studied the protocol performance by performing both quantitative analysis and extensive simulations. Our results demonstrate that RSGM can scale to a large group size and a large network size, and can more efficiently support multiple multicast groups in the network. Compared to existing protocols ODMRP and SPBM, RSGM achieves a significantly higher delivery ratio under all circumstances, with different moving speeds, node densities, group sizes, number of groups, and network sizes. RSGM also has the minimum control overhead and joining delay.

An application layer multicast approach based on topology-aware clustering

Application layer multicast accelerates ubiquitous deployment of the multicast communication, as well as brings unavoidable performance penalties because the group members are dynamic and lack direct knowledge about the underlying topology. A promising approach to improve the multicasting performance is to cluster the nearby nodes in groups. However, it confronts some practical challenges. A challenge is that it is difficult to assign a proximity bound to determine whether some nodes should be clustered or not. Another practical problem is how to organize the corresponding multicast structure. In this paper, we propose a new topology-aware hierarchical clustering model, which implements clustering in different grain sizes. Based on the model, we propose an application layer multicast solution named HCcast, especially for large-scale group applications. HCcast employs a topology-aware approach to choose candidate parents at different levels, and uses distributed depth first searching (DFS) approach to position a host at the same level. The clusters of HCcast are topology-based, therefore cluster split and merge operations are unnecessary, which reduces the maintenance overhead. The results of our simulation experiments show that HCcast can build multicast trees with desirable delivery performance, and the performance keep stable in different join sequences.

Design and implementation of light-weight mobile multicast for fast MIPv6

Mobile multicast is a research hotspot and can provide many applications. Some mobile multicast schemes have been proposed, but most of them introduce new entities and study construction algorithms of the dynamic multicast delivery structure which is heavyweight for wireless devices. In this paper, we propose a light-weight mobile multicast (LMM) scheme for Fast Mobile IPv6 which reduces the redundant operational overhead by simplifying multicast listener discovery (MLD) proxying. The LMM scheme implements simplified MLD proxying function on home agent to reduce the complicated multicast routing protocol and modifies MLD host part function on mobile node to reduce the multicast membership messages interaction. In order to solve the tunnel convergence problem, LMM also introduces a multicast tunnel combination and reconstruction algorithm. We set up a test-bed to evaluate the performance of LMM, and compare it with other mobile multicast schemes. The experimental results show that LMM reduces the multicast disruption time at handover. Based on the experimental results, we analyze the cost of LMM, and the results show that it has lower protocol cost than other schemes.

Adaptive multicast on mobile ad hoc networks using tree-based meshes with variable density of redundant paths

Multicasting has been extensively studied for mobile ad hoc networks (MANETs) because it is fundamental to many ad hoc network applications requiring close collaboration of multiple nodes in a group. A general approach is to construct an overlay structure such as multicast tree or mesh and to deliver a multicast packet to multiple receivers over the overlay structure. However, it either incurs a lot of overhead (multicast mesh) or performs poorly in terms of delivery ratio (multicast tree). This paper proposes an adaptive multicast scheme, called tree-based mesh with k-hop redundant paths (TBM k ), which constructs a multicast tree and adds some additional links/nodes to the multicast structure as needed to support redundancy. It is designed to make a prudent tradeoff between the overhead and the delivery efficiency by adaptively controlling the path redundancy depending on network traffic and mobility. In other words, when the network is unstable with high traffic and high mobility, a large k is chosen to provide more robust delivery of multicast packets. On the other hand, when the network traffic and the mobility are low, a small k is chosen to reduce the overhead. It is observed via simulation that TBM k improves the packet delivery ratio as much as 35% compared to the multicast tree approach. On the other hand, it reduces control overhead by 23–87% depending on the value of k compared to the multicast mesh approach. In general, TBM k with the small value of k offers more robust delivery mechanism but demands less overhead than multicast trees and multicast meshes, respectively.

An Evaluation of Shared Multicast Trees with Multiple Cores

Native multicast routing protocols have been built and deployed using two basic types of trees: single-source, shortest-path trees and shared, core-based trees. Core-based multicast trees use less routing state compared to shortest-path trees, but generally have higher end-to-end delay and poor fault tolerance. In this paper we consider a new type of shared multicast structure that uses multiple, independent, simultaneously-active cores. Our design provides for low end-to-end delay, improved fault tolerance, and low source discovery delay, while balancing bandwidth cost and routing state. These results indicate that shared trees with multiple active cores are a viable alternative to shortest-path trees.

Simulation of a Multicast ATM Switch for High-Speed Networks

In this paper, a new multicast switch structure (called CCRMS) is proposed that can achieve high throughput at low hardware cost. Instead of using two separate parts, copying and routing networks, the CCRMS uses a combined network, called the copying-routing network (CRN). Additionally, a cell management algorithm is developed for the proposed multicast switch. This cell scheduling algorithm allows cells to be duplicated and routed in the CCRMS without suffering any blocking. The proposed switch hardware architecture will be more economical to fabricate than other multicast switches since both copying and routing functions are performed using a single network, yet its throughput is not sacrificed. With this proposed switch architecture executing the proposed efficient cell management algorithm, a high throughput, non-blocking, and low cost multicast switch can be built.