Fault Isolation in Multicast Trees Anoop Reddy, Ramesh Govindan, Deborah Estrin. USC/Information Sciences Institute Presented by: Srikrishna Gurugubelli.

Slides:



Advertisements
Similar presentations
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast Pavlin Radoslavov Christos Papadopoulos Ramesh Govindan.
A Presentation by: Noman Shahreyar
Impact Analysis of Cheating in Application Level Multicast s 1090176 Masayuki Higuchi.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
Detecting Traffic Differentiation in Backbone ISPs with NetPolice Ying Zhang Zhuoqing Morley Mao Ming Zhang.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
CSE 561 – Multicast Applications David Wetherall Spring 2000.
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz HIIT Short Course August 18-20, 2003.
Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.
IP Multicast Channels: EXPRESS Support for Large-scale Single-source Applications Authors: Hugh W. Holbrook and David R. Cheriton Presenter: Mridul Sharma.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
PROMISE: Peer-to-Peer Media Streaming Using CollectCast M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. Bhargava ACM Multimedia 2003, November 2003.
1 Cooperative Inter-stream Rate Control Scheme for Layered Multicast Masato KAWADA, Hiroyuki MORIKAWA, Tomonori AOYAMA, School of Engineering, The University.
Multiple Sender Distributed Video Streaming Thinh Nguyen (IEEE Member) Avideh Zakhor (IEEE Fellow) IEEE Transactions on multimedia 2004.
Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva Mobicom 2000.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
An Evaluation of Scalable Application-level Multicast Using Peer-to-peer Overlays Miguel Castro, Michael B. Jones, Anne-Marie Kermarrec, Antony Rowstron,
QoS-Aware Path Protection in MPLS Networks Ashish Gupta Ashish Gupta Bijendra Jain Indian Institute of Technology Delhi Satish Tripathi University of California.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Presented by: Randeep Singh Gakhal CMPT 886, July 2004.
CSE679: Multicast and Multimedia r Basics r Addressing r Routing r Hierarchical multicast r QoS multicast.
Internet Traffic Management Prafull Suryawanshi Roll No - 04IT6008.
The Zone Routing Protocol (ZRP)
1 Computer Networks IP Multicast. 2 Recall Unicast Broadcast Multicast sends to a specific group.
Semester 1 Module 8 Ethernet Switching Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
Internet Traffic Management. Basic Concept of Traffic Need of Traffic Management Measuring Traffic Traffic Control and Management Quality and Pricing.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
COMPUTING AGGREGATES FOR MONITORING WIRELESS SENSOR NETWORKS Jerry Zhao, Ramesh Govindan, Deborah Estrin Presented by Hiren Shah.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Measurement and Modeling of Packet Loss in the Internet Maya Yajnik.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Computer Science 6390 – Advanced Computer Networks Dr. Jorge A. Cobb Deering, Estrin, Farinacci, Jacobson, Liu, Wei SIGCOMM 94 An Architecture for Wide-Area.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
Computer Networks Dr. Jorge A. Cobb The Performance of Query Control Schemes for the Zone Routing Protocol.
2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Magellan: A Tool for Unicast Fault Isolation Cengiz Alaettinoglu Packet Design LLC Ramesh Govindan Information Sciences Institute John Mehringer Information.
Security Kim Soo Jin. 2 Contents Background Introduction Secure multicast using clustering Spatial Clustering Simulation Experiment Conclusions.
Communication Chapter 2.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast Part 2 of the paper Pavlin Radoslavov, Christos Papadopoulos,
Structure-Free Data Aggregation in Sensor Networks.
Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
17 th -21 st July nd APAN Meeting in Singapore ’06 Forwarding State Reduction for One-to-Many Group Communications Sahar A. Al-Talib (PhD. Candidate)
Topology Discovery Using an Address Prefix Stopping Rule Benoit Donnet Joint work with Timur Friedman Eunice 2005 – Madrid (Spain)
A CIDR Prefix Stopping Rule for Topology Discovery Benoit Donnet joint work with Timur Friedman Algotel 2005 – Presqu'Ile de Giens.
Improved Algorithms for Network Topology Discovery
Controlling the Cost of Reliability in Peer-to-Peer Overlays
RSVP: A New Resource ReSerVation Protocol
Trajectory Based Forwarding
Coverage and Connectivity in Sensor Networks
Advanced Computer Networks
Implementing Multicast
Presentation transcript:

Fault Isolation in Multicast Trees Anoop Reddy, Ramesh Govindan, Deborah Estrin. USC/Information Sciences Institute Presented by: Srikrishna Gurugubelli

Motivation Multicasting is used for streaming video and audio. Any route change or packet loss will affect the quality. Need a method to efficiently track the fault and correct it.

Introduction Fault isolation in the context of large multicast distribution trees. Focus is on single source trees. Problem: locating on-tree router or link which is the origin of a fault. Fault: link with significant packet loss or origin of a route change resulting in the change of path from source to receiver.

Methodology of Fault Isolation A session watcher at each receiver Session watcher sends periodic probes Keeps a history of the probe responses Coordinates with other session watchers to minimize overhead and probe load.

Naïve Technique Each session watcher (w a ) periodically traces its path to the source(using mtrace) and maintains history of these traces. Using this information it can identify the link responsible for significant loss. Locating router responsible for a route change is not possible without querying other session watchers on the path. Most links are monitored by more than one session watcher Scaling problem: closer the source of distribution tree, greater the overhead of mtrace requests.

Subcast-Based Fault Isolation Relies on two capabilities –Ability of a session watcher W a to specify a hop limit h on an mtrace request. The request terminates at a router R which is h hops away from the receiver. This turnaround router generates the mtrace response. –Subcast: router support to allow a sender to specify that a packet be multicast to the subtree rooted at the specified router.

Overview If path to source overlaps, only one of the session watchers needs to monitor the overlapped segment. A session watcher W a which is at a longer distance from the common ancestor goes beyond it. The other session watcher W b will terminate its request at the common ancestor. The identity of the common ancestor is obtained by analyzing the history of responses.

Overview (contd..) If W a fails, W b will not get mtrace responses from W a. When this happens W b will extend its mtrace request all the way to the source. If W a returns to the tree, both the session watchers will monitor some links for a short time. When W b sees the mtrace responses from W a, it backs off.

Other Methods Fault Isolation Using Directed Multicast Fault Isolation Using Scoped Multicast Fault Isolation Based on Limited Multicast

Evaluation Measurements made on full n-ary trees –Maximum overhead –Average overhead –Expected error Evaluation for irregular trees –Study is made using sample trees from a random tree generator –Performance averaged across several samples

Conclusions Explored and gave a receiver-driven path probing primitive. Explored router-assisted schemes for selective forwarding of probe responses Schemes using router-assist outperform other alternatives.