Reliable Multicast Revisited Reliable Multicast –One-to-many and many-to-many communication –Dynamic group membership –Reliability in the transmission.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Reliable Multicasting –IP-multicast is unreliable. Need a reliable multicast layer to simplify the software design. –Like in reliable unicast (PAR), we.
Fault Tolerance CSCI 4780/6780. Reliable Group Communication Reliable multicasting is important for several applications Transport layer protocols rarely.
1 CS 194: Distributed Systems Process resilience, Reliable Group Communication Scott Shenker and Ion Stoica Computer Science Division Department of Electrical.
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast Pavlin Radoslavov Christos Papadopoulos Ramesh Govindan.
Jump to first page A. Patwardhan, CSE Digital Fountains Main Ideas : n Distribution of bulk data n Reliable multicast, broadcast n Ideal digital.
Optimizing Buffer Management for Reliable Multicast Zhen Xiao AT&T Labs – Research Joint work with Ken Birman and Robbert van Renesse.
An Interest-Driven Approach to Integrated Unicast and Multicast Routing in MANETs Rolando Menchaca-Mendez J.J. Garcia-Luna-Aceves 280N Seminar: 4/28/2008.
Reliable Group Communication Quanzeng You & Haoliang Wang.
Scalable Reliable Multicast in Wide Area Networks Sneha Kumar Kasera Department of Computer Science University of Massachusetts, Amherst.
Router Buffer Sizing and Reliability Challenges in Multicast Aditya Akella 02/28.
15-744: Computer Networking L-17 Multicast Reliability and Congestion Control.
L-21 Multicast. L -15; © Srinivasan Seshan, Overview What/Why Multicast IP Multicast Service Basics Multicast Routing Basics DVMRP Overlay.
Computer Networking Multicast (some slides borrowed from Srini Seshan)
A Reliable Multicast Framework For Light-Weight Sessions and Application Level Framing Sally Floyd, Van Jacobson, Ching-Gung Liu, Steven McCanne, Lixia.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
A loss detection Service for Active Reliable Multicast Protocols Moufida MAIMOUR & C. D. PHAM INRIA-RESO RESAM UCB-Lyon – ENS Lyon INC’02, Plymouth Tuesday,
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.
Distributed Systems Distributed Algorithms 1 Brendan Tangney Distributed Systems (Distributed Algorithms – A Problem Based Learning Approach)
EE 122: Error detection and reliable transmission Ion Stoica September 16, 2002.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Network Multicast Prakash Linga. Last Class COReL: Algorithm for totally-ordered multicast in an asynchronous environment, in face of network partitions.
Reliable WDM Multicast in Optical Burst-Switched Networks Myoungki Jeong, Chunming Qiao and Yijun Xiong Dep. Of EE and CSE State University of New York.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Internet and Intranet Protocols and Applications Section V: Network Application Performance Lecture 11: Why the World Wide Wait? 4/11/2000 Arthur P. Goldberg.
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
Resilient Multicast Support for Continuous-Media Applications X. Xu, A. Myers, H. Zhang and R. Yavatkar CMU and Intel Corp NOSSDAV, 1997.
On Multicast CS614 - March 7, 2000 Tibor Jánosi ?.
CS 268: Multicast Transport Kevin Lai April 24, 2001.
An Active Reliable Multicast Framework for the Grids M. Maimour & C. Pham ICCS 2002, Amsterdam Network Support and Services for Computational Grids Sunday,
Multicast Transport Protocols: A Survey and Taxonomy Author: Katia Obraczka University of Southern California Presenter: Venkatesh Prabhakar.
IGMP and MLD Optimizations in Wireless and Mobile Networks 1 draft-liu-multimob-igmp-mld-wireless-mobile-02 Liu Hui Mike McBride.
IGMP and MLD Optimization in Wireless and Mobile Networks 1 draft-liu-multimob-igmp-mld-wireless-mobile-00.
Ad Hoc Wireless Routing COS 461: Computer Networks
Timing-sync Protocol for Sensor Networks (TPSN) Presenter: Ke Gao Instructor: Yingshu Li.
Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.
Communication (II) Chapter 4
An Overlay Architecture for High Quality VoIP Streams IEEE Trans. on Multimedia 2006 R 翁郁婷 R 周克遠.
Hierarchical agent-based secure and reliable multicast in wireless mesh networks Yinan LI, Ing-Ray Chen Robert Weikel, Virginia Sistrunk, Hung-Yuan Chung.
Dec 4, 2007 Reliable Multicast Group Neelofer T. CMSC 621.
Presented by Chaitanya Nemallapudi Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks Lap Kong.
Group Communication A group is a collection of users sharing some common interest.Group-based activities are steadily increasing. There are many types.
Group Communication Group oriented activities are steadily increasing. There are many types of groups:  Open and Closed groups  Peer-to-peer and hierarchical.
Presentation slides prepared by Ramakrishnan.V LMS: A Router Assisted Scheme for Reliable Multicast Christos Papadopoulos, University of Southern California.
2007/1/15http:// Lightweight Probabilistic Broadcast M2 Tatsuya Shirai M1 Dai Saito.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
IETF77 Multimob California1 Proposal for Tuning IGMPv3/MLDv2 Protocol Behavior in Wireless and Mobile networks draft-wu-multimob-igmp-mld-tuning-00 Qin.
Page 1 The department of Information & Communications Engineering Dong-uk, kim A Survey of Packet Loss Recovery Techniques for Streaming.
Video Multicast over the Internet Presented by: Liang-Yuh Wu Lung-Yuan Wu Hao-Hsiang Ku 12 / 6 / 2001 Bell Lab. And Georgia Institute of Technologies IEEE.
EE689 Lecture 13 Review of Last Lecture Reliable Multicast.
Slingshot: Time-Critical Multicast for Clustered Applications Mahesh Balakrishnan Stefan Pleisch Ken Birman Cornell University.
Fault Isolation in Multicast Trees Anoop Reddy, Ramesh Govindan, Deborah Estrin. USC/Information Sciences Institute Presented by: Srikrishna Gurugubelli.
15-744: Computer Networking L-15 Multicast Address Allocation and Reliability.
1 Modeling and Analyzing Fault-Tolerant, Real-Time Communication Protocols Nancy Lynch Theory of Distributed Systems MIT Second MURI Workshop Berkeley,
1 Highlight 1: AER/NCA. 2 Active Multicast Repair Services Receiver Sender Conventional Routers Repair latency is a complete round trip time Link causing.
Reliable Adaptive Lightweight Multicast Protocol Ken Tang, Scalable Network Technologies Katia Obraczka, UC Santa Cruz Sung-Ju Lee, Hewlett-Packard Laboratories.
Revisiting Transport Congestion Control Jian He UT Austin 1.
CMPE Wireless and Mobile Networking 1 Reliable Mutlicast in MANETs.
Reliable multicast Tolerates process crashes. The additional requirements are: Only correct processes will receive multicasts from all correct processes.
CMPE 252A: Computer Networks
Internet Networking recitation #12
Reliable group communication
Reliable Multicast Group
Aggregate Block-ACK definition
Seminar Mobilkommunikation Reliable Multicast in Wireless Networks
Group Block Acknowledgements for Multicast Traffic
Aggregate Block-ACK definition
Feedback-jamming ARQ mechanisms
Presentation transcript:

Reliable Multicast Revisited Reliable Multicast –One-to-many and many-to-many communication –Dynamic group membership –Reliability in the transmission of packets –Trade-off between recovery latency and overhead Research Objective –Design novel reliable multicast protocol –Formally analyze protocol’s performance

Scalable Reliable Multicast [Floyd, et. al.] Application layer – uses IP multicast as primitive Based on NACKs and retransmissions All members share in loss recovery overhead Limits duplicate packet requests/replies using: –Deterministic suppression Scheme for allowing ancestors to suppress descendants Schedule requests/replies proportionately to distance to source –Probabilistic suppression Scheme for allowing siblings to suppress each other Spread out scheduling of requests/replies

Our Reliable Multicast Protocol Objective: Exploit locality in packet losses [Bolot, et. al., Yajnik, et. al., Handley] Protocol: Inspired by SRM (w/ archiving) –Adopt deterministic suppression –Use caching scheme to suppress siblings Cache optimal requestor/replier pair Optimistically predict the location of future losses Build a hierarchy of requestor/replier pairs

Illustration the Caching Scheme Leader selected based on: Distance to source Order of identifiers

Protocol Performance Rationale Save latency incurred by probabilistic suppression Following the election of requestor/replier pairs –Minimize recovery latency by utilizing optimal requestor/replier pairs –Obtain single requests/replies Cost of building and maintaining leader hierarchy –Duplicate messages during first round losses –Duplicate messages upon cache misses

Protocol Performance Analysis Performance metrics –Loss recovery latency: Time b/w detection of packet loss and reception of first retransmission –Loss recovery overhead: # of messages multicast pertaining to the recovery of a particular loss Assumptions: –No recovery packet losses –Inter-host delay estimates accurate in the sense of receiver ordering

Performance Analysis Approach I. Absolute Performance Analysis –State recovery latency claims for cache hits/misses –Measure cache hit/miss rates –State overall performance claims II. Comparative Performance Analysis –State performance claims wrt SRM

I. Absolute Performance Analysis Recovery Latency: t recovery < c t SA * + t AB + d t AB * + t BA where S = source, A = requestor, B = replier c,d : delay parameters of deterministic suppression t SA *, t AB * : inter-host delay estimates t AB,, t BA : actual inter-host delays Optimal requestor/replier pair given by: –Choosing requestor closer to loss location (source) –Choosing replier closer to loss location (requestor)

Optimal Requestor/Replier Pair S A B (A,B) – optimal requestor/replier pair

Cache Hit Performance All requestors, e.g., C,D, incur latency of optimal requestor/replier pair (A,B): t recovery ~ c t SA * + t AB + d t AB * + t BA S A B CD

Cache Miss Performance Types of miss depends on loss location –Higher:Leader competes for sending request –Lower:Non-leaders must time-out waiting for the request of their leader If deterministic suppression delay > delay in receiving leader request then no extra delay else additional delay incurred What is the cost of this additional delay? How often is it incurred? How does the worst case cache miss compare to SRM?

Cache Hit/Miss Rate Cache hit rate measurements for available multicast traces by Yajnik, et. al.

II. Comparative Performance Analysis Compare the recovery latency and overhead to those of SRM –Probabilistic suppression latency saved –Cache hits result in single request/reply –Cache hits ensure optimal delay for all receivers sharing hit –Cache misses? How do they affect performance?

Future Work Complete our performance analysis work –Analyze the performance of the leader-hierarchy –Evaluate/measure the effect of the cache hit/miss rate Do cache hit savings outweigh miss delays? –Analyze performance in terms of message overhead –How do losses pertaining to recovery affect performance Condition analysis on the # of losses

Future Protocol Directions Optimistic/Expedited recovery –Leader requestor immediately unicasts request to leader replier Local error recovery – Subcasting? Application of caching to router-assisted protocols