Presentation slides prepared by Ramakrishnan.V LMS: A Router Assisted Scheme for Reliable Multicast Christos Papadopoulos, University of Southern California.

Slides:



Advertisements
Similar presentations
Ethernet Switch Features Important to EtherNet/IP
Advertisements

Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast Pavlin Radoslavov Christos Papadopoulos Ramesh Govindan.
Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
11 TROUBLESHOOTING Chapter 12. Chapter 12: TROUBLESHOOTING2 OVERVIEW  Determine whether a network communications problem is related to TCP/IP.  Understand.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Inter-VLAN Routing Routing & Switching.
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.
1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
Reactive Discovery of Point-to-Point Routes in Low Power and Lossy Networks draft-ietf-roll-p2p-rpl-04 Mukul Goyal University of Wisconsin Milwaukee.
1 Internet Networking Spring 2006 Tutorial 7 DVMRP.
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,
School of Information Technologies Internet Multicasting NETS3303/3603 Week 10.
COS 420 Day 18. Agenda Group Project Discussion Program Requirements Rejected Resubmit by Friday Noon Protocol Definition Due April 12 Assignment 3 Due.
Chapter 4 IP Multicast Professor Rick Han University of Colorado at Boulder
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Network Multicast Prakash Linga. Last Class COReL: Algorithm for totally-ordered multicast in an asynchronous environment, in face of network partitions.
Computer Networking Lecture 24 – Multicast.
Wolfgang EffelsbergUniversity of Mannheim1 Multicast IP Wolfgang Effelsberg University of Mannheim September 2001.
1 Network Layer: Host-to-Host Communication. 2 Network Layer: Motivation Can we built a global network such as Internet by extending LAN segments using.
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 ?.
Multicast Networking 2 References Multicast Networking and Applications Miller, C. Kenneth Addison-Wesley, 1999 Computer Networking:
A Case for End System Multicast Author: Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan and Hui Zhang.
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.
Multicast and Anycast Mike Freedman COS 461: Computer Networks
CSE679: Multicast and Multimedia r Basics r Addressing r Routing r Hierarchical multicast r QoS multicast.
Copyright 2003 CCNA 1 Chapter 7 TCP/IP Protocol Suite and IP Addressing By Your Name.
11 ASSIGNING IP ADDRESSES Chapter 2. Chapter 2: ASSIGNING IP ADDRESSES2 CHAPTER OVERVIEW  Describe the structure of IP addresses and subnet masks. 
CS-590F - Jitesh R. Nair BREADCRUMB FORWARDING SERVICE A synthesis of PGM and EXPRESS to improve and simplify global IP multicast Authors: Koichi Yano,
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
A Randomized Error Recovery Algorithm for Reliable Multicast Zhen Xiao Ken Birman AT&T Labs – Research Cornell University.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Transport Layer Introduction to Networking.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
ECE 544 Project3 Team member. Assumptions and Address Scheme Assumptions End hosts can only connect to routers Same content available at multiple end.
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
CMPT 471 Networking II Address Resolution IPv4 ARP RARP 1© Janice Regan, 2012.
Information-Centric Networks07a-1 Week 7 / Paper 1 Internet Indirection Infrastructure –Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh.
CS 5565 Network Architecture and Protocols Godmar Back Lecture 22.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Content-Based Routing in Mobile Ad Hoc Networks Milenko Petrovic, Vinod Muthusamy, Hans-Arno Jacobsen University of Toronto July 18, 2005 MobiQuitous 2005.
Routers and Routing Basics CCNA 2 Chapter 10.
Interest NACK Junxiao Shi, Introduction Interest NACK, aka "negative acknowledgement", is sent from upstream to downstream to inform that.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
Yallcast Architecture Overview Paul Francis NTT PF Labs
Multimedia & Mobile Communications Lab.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #7 DVMRP.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
15-744: Computer Networking L-15 Multicast Address Allocation and Reliability.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Fault Tolerance (2). Topics r Reliable Group Communication.
Multicasting EECS June Multicast One-to-many, many-to-many communications Applications: – Teleconferencing – Database – Distributed computing.
Communication Networks Recitation 11. Multicast & QoS Routing.
DMET 602: Networks and Media Lab Amr El Mougy Yasmeen EssamAlaa Tarek.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
CMPE 252A: Computer Networks
Viet Nguyen Jianqing Liu Yaqin Tang
Other Routing Protocols
EE 122: Lecture 13 (IP Multicast Routing)
Optional Read Slides: Network Multicast
Presentation transcript:

Presentation slides prepared by Ramakrishnan.V LMS: A Router Assisted Scheme for Reliable Multicast Christos Papadopoulos, University of Southern California Guru Parulkar, Washington University George Varghese, University of California at San Diego

Introduction Internet architecture is largely responsible for the undisputed success of the Internet today. Unfortunately, the end-to-end model which was so successful in the unicast case has proven much harder to apply to multicast. LMS facilitates very efficient solutions (compared to pure end-to-end schemes) to problems like scalable reliable multicast.

Difficulties - Reliable Multicast Implosion Host Exposure Recovery latency Adaptability to dynamicity

Key Feature of LMS (Light-Weight Multicast Service) Separation of forwarding and error control Forwarding (by routers) Error control (by receivers – end to end) No packet storing or processing at routers.

Core Ideas Each router selects a replier (surrogate). Routers steer requests to repliers. Routers help repliers multicast replies to loss sub-tree. LMS restricts the scope of forwarding. LMS achieves the efficiency of the heavy- weight model, but without the weight.

LMS Model R Control messages Router stores packets, receives NACKs and sends retransmissions Heavy-weight model R Router chooses a receiver as a surrogate. Router relays messages from surrogate to the Sub-tree. Receiver acting as a surrogate LMS Router steers all control messages to surrogate.

Idealized Recovery Scenario

LMS: Concepts Replier Provides Retransmission Receiver volunteered to answer requests Turning point Where requests start to move downstream Directed Multicast Multicast to a sub-tree S R R A A AA A P P P Replier Replier link

Selecting a Replier (surrogate) If the router has two or more downstream links it selects one as the replier link. If the router has only one downstream link that becomes the replier link by default. If the source is directly attached to the router the source becomes the replier.

Replier Selection (contd…) Receivers express desire by piggy backing information on the join request. Receivers communicate a cost of their appropriateness as repliers. Selection based on the advertised cost.

Steering Messages to Repliers Each request is multicast, which keeps receiver actions simple. Hop-by-Hop forwarding requires routers to examine each request, which is done via the IP Router Alert option, included in every request.

Request Handling at the Routers LMS avoids request implosion because each router allows only one request to escape upstream - the one coming from the replier link.

Directed Multicast (DMCAST) Its purpose is to enable fine-grain multicast to eliminate exposure.

LMS: Request forwarding Multicast to the group. If a request reaches a turning point, it’s forwarded towards the replier. No request suppression or merging, but scope of requests is limited. S R2 R1 A A AA A P2 P1

LMS: Reply forwarding At turning point, is added into request packet. Replier includes it into its retransmission packet. Routers need not remember anything about requests as they pass through. Routers are not even aware that these recovery messages. S R2 R1 A A AA A P2 P1 turning point

LMS Concepts review Concepts Replier selection. Steering of requests to repliers. Establishing turning points. Directed multicast. These concepts work together to enable receivers to construct an efficient recovery mechanism.

Problem: Exposure Loss at the replier link may result in duplicates Mitigation: Using the cost field to select a replier that advertises the least loss.

Simulations Using 3 Topologies Binary Trees Random Topology Transit-stub topology Using 100’s of nodes and tens of topologies. Compare with PGM and SRM.

Simulation Parameters Loss at the source Test control of NACK implosion. Loss at the receiver Test control of Exposure. Loss at each Link Working in random loss scenario.

Simulation Summary LMS performance improves as the group gets larger because more helpers. LMS and PGM to perform much better than SRM. Comparing LMS and PGM LMS is much simpler to implement, and performance is on par with PGM. Significantly lower recovery latency, while trading very little in terms of exposure.

Late Requests lead to ambiguity

Replier Failure

Selecting Repliers in a LAN So far we have assumed that there was only one receiver at each link. Receivers on a LAN use a simple election mechanism to elect a replier and therefore make a LAN appear as having a single receiver.

Routers with a Large Fan-out

Proxy Directed Multicast The request may arrive after the buffers at the replier have been purged. Note that once a request passes the turning point it contains enough information to uniquely identify the sub-tree that requires the retransmission. Replier can forward the request to another member (LMS again).

Pathological Topologies

Incremental Deployment Use Source Path Messages (SPMs)to create an overlay. Incremental deployment has an effect on exposure.

Other Applications - ANYCAST Grouping servers in a well-known multicast group. Servers tell the routers to advertise the existence of a replier (server) in all links which ensures that routers find the nearest server in any direction.

Summary LMS is simple to implement, does not violate the end-to-end principle. Forwarding and error control are two clearly separable components, and great benefits can be realized by decoupling and placing each one where it is more beneficial.