Analysis and Taxonomy of Congestion Control Mechanisms for Internet Reliable Multicast

The research of congestion control for Internet reliable multicast is one of the most active fields in reliable multicast protocol research. Many reliable multicast congestion control mechanisms have been put forward. In this paper we present principal problems of congestion control for Internet reliable multicast, analyze solutions and difficulties of solving these problems, and then give a classification of some reliable multicast congestion control mechanisms. Lastly the future work is proposed.

Efficient network coding-based retransmission algorithm for reliable wireless multicast

Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to code the composite pack- channels efficiently. For the composite fading environ- ment with muhiple receivers, receivers experience different fading at any time. It＇ s very important to code the composite packet so that intended receivers are in good channel qualities, because in- tended receivers in deep fading have little opportunity to receive the composite packet correctly. Hence, we propose a novel composite packet coding principle of maximizing the total SNR of intend- ed receivers. Since the proposed principle is an NP-complete problem, an efficient heuristic algo- rithm with low complexity is given for finding a suboptimal solution. Simulation results show the heu- ristic based scheme achieves higher transmission efficiency than other network coding-based schemes due to the multi-user diversity gain.

IPv4 Based Reliable Mobile Multicast Technology

The mobile multicast technology has been a research hotspot in the wireless Internet field in recent years.Quite a large part of its applications requires the reliability in a mobile environment to be equivalent to that provided by wireline links.However,the inherent features of a mobile environment,that is,high error rate of links and dynamically changing multicast members’ locations,are great difficulties for mobile multicast,let alone reliable mobile multicast.The IPv4-based reliable mobile multicast algorithms come with two different design philosophies.A part of the algorithms is to be improved for better reliability by solving existing algorithm-related problems;while other algorithms are to implement reliable mobile multicast with new function entities introduced to guarantee reliability.

RMAC： A Reliable MAC Protocol Supporting Multicast for Wireless Ad Hoc Networks

This paper presents a new reliable MAC protocol called “RMAC”supporting reliable multicast for wireless ad hoc networks. By utilizing the busy tones to realize the multicast reliability, RMAC has three novelties： （1） it uses a variablelength control frame to stipulate an order for the receivers to respond, thus solving the feedback collision problem; （2） it extends the usage of busy tone for preventing data frame collisions into the multicast scenario; and （3） it introduces a new usage of busy tone for acknowledging data frames positively. In addition, RMAC is generalized into a comprehensive MAC protocol that provides both reliable and unreliable services for all the three modes of communications： unicast, multicast, and broadcast, making it capable of supporting various upper-layer protocols. The evaluation shows that RMAC achieves high reliability with very limited overhead. RMAC is also compared with other reliable MAC protocols, showing that RMAC not only provides higher reliability but also involves lower cost.

Performance study on Gossip-based group key distribution protocal

Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast protocol can not deal with them fully. Gossip-based group key distribution idea for wide-area dissemination was provided. It is based on an gossip-based loss recovery control mechanism. It can provide a probabilistic reliable guarantee for a information dissemination to reach every group member, which can achieve scalability and reliability. To achieve full reliability, three layers protocol model in group key distribution was provided. One is best effect layer, which provides unreliable dissemination. Other is gossip-based loss recovery layer, which provides probabilistic reliable guarantee. Last is vsync-based layer, which provide deterministic loss recovery. We integrate probabilistic loss recovery method with deterministic one. The model possess scalability that probabilistic method has and full reliability prosthesis by vsync-based. To evaluate the effectiveness of gossip technique in scalable and reliable multicast protocols. We have compared gossip protocol with other reliable multicast protocols. Experimental result shows that gossip protocol has better scalability than other.

Efficient wireless multicast retransmission using network coding

In wireless multicast, network coding has recently attracted attentions as a substantial improvement to packet retransmission schemes. However, the problem of finding the optimal network code which minimizes the retransmissions is hard to solve or approximate. This paper presents two schemes to reduce the number of retransmissions for reliable multicast efficiently. One is retransmission using network coding based on improved Vandermonde matrix （VRNC）, the other is retransmission using network coding based on adaptive improved Vandermonde matrix （AVRNC）. Using VRNC scheme the sender selects the packets all receivers have lost and encodes them with improved Vandermonde matrix; when receivers receive enough encoded retransmission packets, all the lost packets can be recovered. With AVRNC scheme, the sender can obtain the recovery information from all the receivers after sending out per retransmission packet, and then the improved Vandermonde matrix can be updated, thus reducing the complexity of encoding and decoding. Our proposed schemes can achieve the theoretical lower bound assuming retransmission packets lossless, and approach the theoretical lower bound considering retransmission packets loss. Simulation results show that the proposed algorithms can efficiently reduce the number ofretransmissions, thus improving transmission efficiency.

A PROBABILISTIC CHARACTERIZATION OF A FAULT-TOLERANT GOSSIPING ALGORITHM

Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.