Reliable Multicast: Where to use FEC
53
Citation
19
Reference
10
Related Paper
Citation Trend
Keywords:
IP multicast
Multicast group communications are essential for armed forces to effectively coordinate and execute missions in live theater, and given all the dynamics that a network can be subjected to in mission-critical situations (i.e., any combination of fast fading, slow fading, frequency jamming, network congestion, mobility), ensuring an appropriate level of network fidelity for supporting reliable communications becomes a difficult wireless networking problem. We argue for designing tunable reliability more explicitly into the act of topology construction based on the severity of forecasted dynamics in the network. This paper studies the number of nodes in the network supporting multicast traffic for a group of nodes, with more nodes supporting multicast traffic, the number of available redundant paths increases, enhancing reliability. We investigate the fundamental tradeoff of the amount of nodes supporting multicast communications and the gains in the number of node-disjoint paths among nodes in the multicast group. Traditionally, wired and wireless approaches to multicast focus on constructing some sort of tree-based topology with the benefit of having the minimum amount of resources allocated and a simplified routing protocol without redundant paths. Others have argued for ring-based topologies, augmented trees or rings allowing for alternate paths, and others have explored the mesh-based routing problem for multicast. We formulate a set of mixed integer linear programs (MILPs) for determining the nodes participating in the multicast group, we denote the set of nodes supporting multicast traffic as the multicast cloud. We investigate the fundamental tradeoffs of the fidelity of the cloud over a wide-range of parameters, accounting for various types of multicast topology allocation strategies (e.g. tree- and meshed-based approaches). We find that many nodes are needed to construct a single path among all nodes in a multicast group, but the cost for an additional node-disjoint path requires a fraction of additional nodes. We characterize this sublinear cost growth in terms of the number of nodes needed to provide connectivity to the cloud, and we characterize how the diameter of the cloud (i.e., hop across) decreases as more nodes participate in group communications.
IP multicast
Cite
Citations (1)
IP multicast
Cite
Citations (67)
IP multicast
Cite
Citations (8)
Base station multicast is an important enabling service for the current and future Internet. With the explosive growth of the Internet, a challenging issue facing Base Station multicast is scalability, in particular, the problem of multicast forwarding state and control explosion. In this paper, we propose a new methodology to address the multicast scalability problem for backbone domains - distributed message copying multicast (DMCM). This multicast scheme is designed for the wireless network, and is independent of any underlying intra-domain multicast protocols. The feasibility and performance of our algorithm is demonstrated through analysis and simulations.
IP multicast
Cite
Citations (1)
In this paper, we present a new multicast architecture and the corresponding multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast protocols construct and update the multicast tree in a distributed manner, which may cause two problems: first, since each node has only local or partial information on the network topology and group membership, it is difficult to build an efficient multicast tree; second, due to lack of complete information, broadcast is often used for sending control packets and data packets, which consumes a great deal of network bandwidth. In the newly proposed multicast architecture, a few powerful routers, called m-routers, collect multicast-related information and process multicast requests based on the information collected. The m-routers handle most of multicast related tasks, while other routers in the network only need to perform minimum functions for routing. The m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called the Service Centric Multicast Protocol (SCMP), builds a shared multicast tree rooted at the m-router for each group. The multicast tree is computed in the m-router by employing the Delay Constrained Dynamic Multicast (DCDM) algorithm which dynamically builds a delay constrained multicast tree and minimizes the tree cost as well. The physical construction of the multicast tree over the Internet is performed by a special type of self-routing packets in order to minimize the protocol overhead. Our simulation results on NS-2 demonstrate that the new SCMP protocol outperforms other existing protocols and is a promising alternative for providing efficient and flexible multicast services over the Internet.
IP multicast
Cite
Citations (39)
A typical multicast network consists of a single tree, in which only a few internal nodes contribute most resources and are involved in performing the multicast functionality. This leads to an uneven and inefficient utilization of network resources. The problem is more pronounced in mobile ad hoc networks (MANETs), where network resources are limited. One solution is to split the multicast content over a number of trees. This provides several paths for the multicast content and would involve more nodes in implementing multicast functionality. Although this approach improves network utilization, overall multicast latency increases. This paper presents a distributed algorithm to construct multiple edge-sharing trees (MESTs) for small group multicast. MESTs balance the resource allocation and delay constraints by choosing to overlap certain edges that have low weight. Simulation results show that MESTs can generate multicast networks that have low delays and fair resource utilization. MESTs are designed to work with any form of multicast in both wired and wireless networks.
IP multicast
Cite
Citations (8)
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.
IP multicast
Chord (peer-to-peer)
Cite
Citations (1)
Source specific multicast(SSM) can solve the access control problem,this transport mode can guarantee the security of multicasting in a certain extent.A new distributed multicast protocol for SSM named SDRMP was proposed.This protocol was based on the idea of domain and distributed data storage.The information taken by SSM join datagram determines which domain a receiver belongs to.Within the domain,a node guaranteed the reliability of the multicast transport with its direct lower node.Among the domain,the master node of every domain stored parts of the entire datagram.Simulation results show that SDRMP can guarantee the reliability of SSM multicast transport and it is TCP-friendly because it can control the bandwidth occupancies of reliable multicast data stream through the feedback datagram.
Datagram
IP multicast
Cite
Citations (0)
Providing multicast support for mobile hosts in an IP inter-network must face many challenging problems, such as compatibility with existing multicast protocols (implicitly assume static hosts), mobility management, scalability, etc. This paper, we propose a new mobile multicast protocol, called Mobile Scalable Recursive Multicast (MoSReM). MoSReM is based on the concept of dynamic branching node-based tree (DBT), setting up multicast tree gradually and dynamically. In MoSReM, only branching nodes router (BNRs) keep the multicast state about their next BNRs and mobility information (if any) about destinations, and the process of join/leave and mobility management of members of a multicast session is always carried out locally. MoSReM has many positive features such as fixed size control message, being scalable and low join/leave latency.
IP multicast
Cite
Citations (2)
Despite the fact that global multicast is still not possible in today's Internet, many local networks are already multicast-capable (the so-called multicast “islands”). However, most application-layer multicast (ALM) protocols for streaming have not taken advantage of the underlying IP multicast capability. As IP multicast is more efficient, it would be beneficial if ALM can take advantage of such capability in building overlay trees. In this paper, we propose a fully distributed protocol called scalable island multicast (SIM) , which effectively integrates IP multicast and ALM. Hosts in SIM first form an overlay tree using a scalable protocol. They then detect IP multicast islands and employ IP multicast whenever possible. We study the key issues in the design, including overlay tree construction, island management, and system resilience. Through simulations on Internet-like topologies, we show that SIM achieves lower end-to-end delay, lower link stress, and lower resource usage than traditional ALM protocols.
IP multicast
Overlay multicast
Cite
Citations (10)