Network Research at Avaya Labs Research The ExpertNet and Chatter Teams Akshay Adhikari Mark Bearden Lorraine Denby Bengi Karacali Jean Meloche Balaji.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Courtesy: Nick McKeown, Stanford
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Temporally-Ordered Routing Algorithm (TORA) IEEE INFOCOM 112/4/20031Authors.
Next Step In Signaling (NSIS) and Internet Routing Dynamics Charles Shen and Henning Columbia University in the City of New York Internet.
15-441: Computer Networking Lecture 26: Networking Future.
Traffic Engineering With Traditional IP Routing Protocols
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
OSD Metadata Management
CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.
RD-CSY /09 Distance Vector Routing Protocols.
Routing.
Chapter 5 TCP/IP: Routing – Part 1 Dr. V.T. Raja Oregon State University.
Understanding Network Failures in Data Centers: Measurement, Analysis and Implications Phillipa Gill University of Toronto Navendu Jain & Nachiappan Nagappan.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Link-State and Balanced Hybrid Routing.
INTERNET TOPOLOGY MAPPING INTERNET MAPPING PROBING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Introduction to Routing and Routing Protocols By Ashar Anwar.
CCNA – Cisco Certified Network Associates Routing and Static Routes By Roshan Chaudhary Lecturer Islington College.
CCNA2 v3 Module 4 v3 CCNA 2 Module 4 JEOPARDY K. Martin.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Internet Traffic Management. Basic Concept of Traffic Need of Traffic Management Measuring Traffic Traffic Control and Management Quality and Pricing.
Introduction to Dynamic Routing Protocol
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Mobile Networking Challenges1 5.6 Mobile Ad Hoc Networks  Ad hoc network does not have any preexisting centralized server nodes to perform packet routing,
PC1 LAN GW SP RTR1 SP RTR2 DST 4 * 25 ms 21 ms dst [ ] 4. A third packet is sent with TTL=3, which decrements at each hop, and expires after RTR2,
Static versus Dynamic Routes Static Route Uses a protocol route that a network administrators enters into the router Static Route Uses a protocol route.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
The Network Layer.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
CCNA 2 Week 9 Router Troubleshooting. Copyright © 2005 University of Bolton Topics Routing Table Overview Network Testing Troubleshooting Router Issues.
© 2005 Avaya Inc. All rights reserved. Avaya – Proprietary & Confidential. For Internal Use Only. “CHATTER” Agent-Based Network Monitoring in Converged.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
Netprog: Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
Copyright 1999, S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 34 Routing Algorithms Ref: Tanenbaum pp ;
Distance Vector Routing Protocols Dynamic Routing.
Routing and Routing Protocols
Visualizing QoS. Background(1/2) A tremendous growth in the development and deployment of networked applications such as video streaming, IP telephony,
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Masking Failures Using Anti Entropy and Redundant Independent Paths Rebecca Braynard and Amin Vahdat Internet Systems and Storage Group Duke University.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs Michigan altech Fujitsu 2006.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
CS440 Computer Networks 1 Link State Routing and OSPF Neil Tang 10/31/2008.
HP Openview NNM: Scalability and Distribution. Reference  “HP Openview NNM: A Guide to Scalability and Distribution”,
IETF 62 NSIS WG1 Porgress Report: Metering NSLP (M-NSLP) Georg Carle, Falko Dressler, Changpeng Fan, Ali Fessi, Cornelia Kappler, Andreas Klenk, Juergen.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
Introduction to Dynamic Routing Protocol
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Routing.
Dynamic Routing Protocols II OSPF
Routing and the Network Layer (ref: Interconnections by Perlman
Routing.
Presentation transcript:

Network Research at Avaya Labs Research The ExpertNet and Chatter Teams Akshay Adhikari Mark Bearden Lorraine Denby Bengi Karacali Jean Meloche Balaji Rao David Stott Among many others

Challenges Network topology discovery Heisenberg –Probes load the network at the worst time –Path or end to end performance but not both Visualizations for paths –Topology and paths –Route changes Synchronization and One way delay Load balancing and packet loss Missing values and clean up Complexity of networks Volume of data (GB per day)

Discovery via the fusion of multiple data sources SNMP IP RR Traceroute I/O octet count correlation Delay distance End to end shadow of network events

Synchronization

Link level network delay via TTL flood Multiple packets with IP RR for a range of TTL are sent between endpoints ICMP messages are received from routers along the way Results are used to estimate link level delays

Network Sampling Design Where to place the probes –Minimize the number of probes needed –Minimize the degeneracy –Subject to many constraints Where to measure QoS attributes and covariates –Minimize the footprint –Minimize the time to blame Dynamic sampling programs

Chatter Distributed network monitor Lives on cheap 100 MHz box Online root cause analysis Seeks failure patterns among arbitrary covariates that are not specified a priori Uses adaptive control charts on important QoS attributes to identify interesting conditions

Compression Compression is needed to prevent the transmission and storage of uninteresting data The data are highly dimensional The collection is distributed How should the compression be distributed

Localization Data collection is distributed What methods are local (analysis requiring only the local data) or near local (analysis requiring limited exchange of information between neighbors)? Are there sampling design that affect localization?