1. 1 Sonia FahmyPurdue University Multi-rate Multicast Congestion Control for the Internet: Challenges, Approaches, and the RLC Algorithm Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu http://www.cs.purdue.edu/homes/fahmy/

2. 2 Sonia FahmyPurdue University q IP Multicast q History and Current Status q Challenges q The RLC Algorithm q Main innovations and open problems Overview

3. 3 Sonia FahmyPurdue University Multicast q Multipoint communication = exchange of information among one or more senders and multiple receivers (multicast group) q Popular applications requiring multipoint support include: q conferencing, distance learning, software distribution, searching, server and database synchronization q ffnet.com: Architecture for TV-quality streaming q Complicated by variation in group size and dynamics and bandwidth requirements = group member

4. 4 Sonia FahmyPurdue University IP Multicast: Design Principles q Single address per group q Members located anywhere q Members can join and leave at will  Senders need not be aware of memberships Like a TV channel  Scalable q Sender need not be a member  Soft connections  periodic renewal

5. 5 Sonia FahmyPurdue University IGMP q Internet Group Management Protocol q Used by hosts to report multicast membership q Join-IP-Multicast Group (address, interface) q Leave-IP-Multicast Group (address, interface) q "Leave group" message (version 2) to reduce leave latency Sent only if the host that responded to the last query leaves q Querier then issues a "membership query" with a short response time q Ref: RFC 1112 (Version 1), RFC 2236 (Version 2), Version 3 Routers Hosts

6. 6 Sonia FahmyPurdue University Multipoint Routing Algorithms q Flooding q Spanning Trees q Reverse Path Forwarding q Flood and Prune q Steiner Trees q Center-Based Trees, e.g., core-based trees Most routing protocol standards are combination of these algorithms. Ref: Semeria and Maufer on 3Com page AC E BD

7. 7 Sonia FahmyPurdue University MCC Components Data Organization Group Management: -Subgroup splitting -Membership decisions Error Control Traffic Regulation: -Rate or Window? -Regulation Algorithm Intra-session Organization Of Tasks: -Scalability -Robustness -Communication Overhead Ref: Golestani, INFOCOM 1999

8. 8 Sonia FahmyPurdue University Multi-rate CC: History and References q RLM (McCanne): receivers join appropriate layers (groups), shared learning, detection and join timers q Grouping (GA Tech): e.g., DSG, LVMR q Sender can use feedback to determine number and rates of layers (UCI/Rutgers: SAMM, AT&T) q Differential drop: AT&T, Shenker q Playback and caching: USC/UCLA, Feng at Ohio State q -------------- RLC -------------- first appeared in INFOCOM 1998 q digitalfountain.com: DLCC, FLID q See IETF rmt draft [Luby2000], rmt and RMRG minutes, proceedings, and mailing lists, for latest discussions

9. 9 Sonia FahmyPurdue University Goals and Challenges q TCP friendliness q Receiver heterogeneity q High utilization of resources q Low loss and delay q Stability and fast transient response q Inter-receiver fairness q Data organization for both bulk data (transfer time) and streaming (quality index) q Scalability q Simplicity and generality q Ease of deployment S Rcv1 Rcv2 Rcv4 Rcv3

10. 10 Sonia FahmyPurdue University TCP Friendliness and Layering q R = Packet Size  constant / RTT   loss rate q Does not consider timeouts, so only holds for small loss rates q How to mimic TCP? Which RTT? q Cumulative layering: no duplication, as opposed to simulcast q Number of layers: small to scale and avoid high join/leave rates

11. 11 Sonia FahmyPurdue University What is RLC? q Based on RLM q A different layer hopping rule, i.e., when to join a layer, leave a layer, or remain at current level? q If loss, decrease q If no loss for t p (i), increase q B(i) and t p (i) double with the increase of i  TCP friendliness q Synchronization points to coordinate receivers behind the same bottleneck q Sender-initiated probes to combat long leave latency after join experiments q Deaf period to avoid cascading leaves: After leave, do not react to congestion for some time slightly larger than leave delay

12. 12 Sonia FahmyPurdue University Receiver Coordination q Avoids mismatch of receivers with the same bottleneck and inter- receiver unfairness q A receiver can only make a join attempt right after a synchronization point (SP) (special sender packet) based on inter-SP events only q SPs at each level are always a subset (half) of SPs at previous level. Thus: (1) lower levels get more chances, (2) everyone at same or lower level gets a chance when they receive the same packet

13. 13 Sonia FahmyPurdue University Sender Probes q Periodically generate short bursts of packets, followed by relaxation period to simulate a join attempt q Doubles rate for each layer, but is later silent to compensate q Congestion during burst means do not increase Burst Relax

14. 14 Sonia FahmyPurdue University Performance Evaluation q Assume one packet lost per cycle (since we use FRR TCP model) q Average throughput is proportional to 1/  loss rate: q No dependence on RTT q Rate-based q Coarse granularity of rates q Minimum rate may be larger than bottleneck bandwidth q Ns simulations and experiments between Pisa and London with data and streaming applications show that: (1) model for average throughput is valid with RED and slightly high with drop-tail, (2) TCP-friendly (goodputs), (3) fast startup to optimal level with staggered sources q For more results, see INFOCOM 1998 paper

15. 15 Sonia FahmyPurdue University Key Points q Main innovations: q Synchronization points q TCP-friendliness q Sender probes q Deaf periods q Questions: q RTT effects q Rates of layers and number of layers q Differential drop q Receiver complexity and reliance on well-behaved receivers

16. 16 Sonia FahmyPurdue University Thank You! Questions?