This paper describes the design of a reliable multicast framework which integrates FEC and receiverinitiated retransmit to ensure reliability. A dynamically elected control tree is used to aggregate the NAKs and tackle the NAK implosion problem. Both techniques support flow and congestion control to enable efficient, high data rate multicast data transfer as performance measurements with our pr...

While WiFi has been proposed for multimedia content distribution, its lack of adequate support for multicast services hinders its ability to provide multimedia content distribution to a large number of devices. In our recent papers we proposed AMuSe, a scalable and adaptive system for WiFi multicast which is based on accurate receiver feedback and that incurs a small control overhead. Specifica...

Reliable sender-based one-to-many protocols do not scale well due mainly to implosion caused by excessive rate of feedback packets arriving from receivers. We show that this problem can be circumvented by making the sender poll the receivers at carefully planned timing instants, so that the arrival rate of feedback packets is not large enough to cause implosion. We describe a generic end-to-end...

An increasing number of distributed applications require a speci c form of multicast called dissemination, in which a single source reliably transfers data to multiple receivers. Reliability requires that data packets are acknowledged positively or negatively, which leads for large groups of receivers (100s or 1000s of participants) to the problem of feedback implosion. Among the approaches try...

The IP multicast architecture enabled large-scale applications of multicasting on the Internet. Many of these applications require reliable dissemination of a stream of data (e.g., software distribution or stock updates) to a large number of receivers. They face, however, a scaling limitation, known as the feedback implosion problem: the sender is overwhelmed by feedback packets, leading to pac...

We propose MCA, a rate-based end-to-end multicast congestion avoidance scheme. Congestion avoidance [6] is different from congestion control in the sense that our scheme detects and responds to network congestion without necessarily inducing packet loss. Our scheme is a single-rate scheme and operates endto-end, i.e., it goes at the rate allowed by the worst congested receiver and does not expe...

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of μ messages to several receivers. The sender can broadcast a single message or a combination of messages at each timestep, through separate erasure channels. Receivers provide feedback as to whether the transmission was received. If, at some time step,...

Computer network is the essential part of the networking. Multicasting is used to send the information from one to group of receivers. It is a big issue because of more data demand of receivers is known as congestion. In this paper we are going to develop a single rate approach which provides congestion control. In this approach two congestion techniques are considered i.e. TFMCC (TCP Friendly ...

This paper introduces source-channel adaptive rate control (SARC), a new congestion control algorithm for layered video transmission in large multicast groups. In order to solve the well-known feedback implosion problem in large multicast groups, we first present a mechanism for filtering RTCP receiver reports sent from receivers to the whole session. The proposed filtering mechanism provides a...