The Delta Routing Project Low-loss Routing for Hybrid Private Networks George Porter (UCB) Minwen Ji, Ph.D. (SRC - HP Labs)

Slides:



Advertisements
Similar presentations
Chapter 9 Introduction to MAN and WAN
Advertisements

CS4550: Computer Networks II network layer basics 3 routing & congestion control.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011.
15-441: Computer Networking Lecture 26: Networking Future.
Wide Area Networks School of Business Eastern Illinois University © Abdou Illia, Spring 2007 (Week 11, Thursday 3/22/2007)
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
1 Indirect Adaptive Routing on Large Scale Interconnection Networks Nan Jiang, William J. Dally Computer System Laboratory Stanford University John Kim.
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
CSE 461: Link State Routing. Link State Routing  Same assumptions/goals, but different idea than DV:  Tell all routers the topology and have each compute.
1 Chapter 10 Introduction to Metropolitan Area Networks and Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—4-1 LAN Connections Exploring the Functions of Routing.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
WAN Technologies & Topologies Lecture 8 October 4, 2000.
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
CS 453 Computer Networks Lecture 24 IP Routing. See…
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Routing and Routing Protocols Routing Protocols Overview.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
Understanding Routing. Agenda What Is Routing? Network Addressing Routing Protocols.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
The Network Layer.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Lecture 17 November 8Intra-domain routing November 13Internet routing 1 November 15Internet routing 2 November 20End-to-end protocols 1 November 22End-to-end.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Routing and Routing Protocols
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Routing and Routing Protocols PJC CCNA Semester 2 Ver. 3.0 by William Kelly.
Routing Protocols Brandon Wagner.
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
7.1 The Network Layer It provides services to the transport layer. It is concerned with getting packets from the source to the destination, possibly making.
Distance Vector Routing
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
BDTS and Its Evaluation on IGTMD link C. Chen, S. Soudan, M. Pasin, B. Chen, D. Divakaran, P. Primet CC-IN2P3, LIP ENS-Lyon
COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.
Confluent vs. Splittable Flows
Computer Networks Routing Algorithms.
Introduction to Internet Routing
Kevin Lee & Adam Piechowicz 10/10/2009
COS 561: Advanced Computer Networks
Data Communication: Routing algorithms
Presentation transcript:

The Delta Routing Project Low-loss Routing for Hybrid Private Networks George Porter (UCB) Minwen Ji, Ph.D. (SRC - HP Labs)

Outline Motivation/overview of corporate networks Problem Statement Architecture –Two layers: Physical and Overlay –The Delta Protocol –The Delta+TM Protocol Evaluation Conclusions

Corporate Network Construction Network Layer Distributed Locations connected by leased lines due to: –Need for predictable performance –Security –Management and control Fixed initial cost, incremental additional cost due to traffic volume Not necessarily overprovisioned Reprovisioning on the timescale of days (or weeks) Expensive (compared to ISP connectivity SF NYC LON LA DC DFW ALX SEA HOU OSPF

Corporate Network Construction Overlay Layer ISP Connectivity alreay at selected nodes to provide: –Web/ access –VPN access to at-home or distance workers –Business services Per-byte, ISP much cheaper than “Intranet” –But no QoS Intranet corporate network with ISP links is called a ‘Hybrid Private Network’ SF NYC LON LA DC DFW ALX SEA HOU ISP Connectivity

Problem of Congestion Flash traffic (video, backup, data transfer) or steady corporate growth can lead to periodic congestion Problem Statement: –Reduce congestion and packet loss on the Intranet by utilizing ISP connectivity while providing good end- to-end performance SF NYC LON LA DC DFW ALX SEA HOU

Architecture

Overlay Layer: - Need to forward traffic around congested portions of the Intranet - Measurement-based path construction - Intermediate point may be better than “last hop” selection - Metric include measured latency and local queuing delay - Paths are selected on order of seconds or minutes Physical (Intranet) Layer: - Single-domain routing protocol (OSPF) - Dijkstra - Forwarding decision: which packets go to Intranet and which go to the preselected overlay paths? (per packet)

Physical Forwarding Algorithm Ji, Minwen. Dial-controlled Hash: Reducing Path Oscillation in Multipath Networks. Proceedings of the International Conference on Computer Communications and Networks (ICCCN). Oct Current Algorithm: –Prefer physical path, but if physical queue full send to overlay layer.

Overlay Path Selection Algorithms Static –Lasthop –Nexthop –Random Dynamic –Delta Minimize end-to-end delay –Delta+TM Predict and avoid congestion by inferring global traffic matrix

Delta Path Selection Find path to minimize the sum of: –Local Queue delay + WAN delay + Intranet delay Key feature is the use of locally obtained information

Limitation of Delta Algorithm Since Delta uses local information, it might send traffic to an overloaded link: congested Can we avoid this?

Delta+TM (Traffic Matrix) Key idea: –Don’t choose paths that will subject the traffic to congestion Use the original Delta algorithm (minimize end- to-end delay) but throw out paths that will subject packets to congestion But how do we find out about remote congestion? –Given that message flooding will likely be inaccurate and might make the problem worse

Traffic Matrix Estimation Topology Information = Each node measures flows that transit through it Long-term averages are flooded to fill in the entries of the table that a node can’t directly measure

Evaluation 1)Simple Example 2)Algorithm-antagonistic Topologies 3)Large-scale Topology (PlanetLab- based)

Linear Topology

Congestion Event

Evaluation 1)Simple Example 2)Algorithm-antagonistic Topologies 3)Large-scale Topology (PlanetLab- based)

Algorithm-antagonistic Topology Simple topology with traffic flows that should expose a weakness to each topology

Algorithm-antagonistic Topology

Evaluation 1)Simple Example 2)Algorithm-antagonistic Topologies 3)Large-scale Topology (PlanetLab- based)

Planetlab as VPN-network source Large, distributed testbed We modelled the Overlay part of a fictional 43-node corporate network using traces taken over planetlab The Intranet link topology was obtained from 2-level clustering and eyeballing Traffic flows include a “measured flow” and a set of background and disruptive flows

PlanetLab (UCLA->ac.uk) ppnonly4,438 nexthop2,492 lasthop3,469 DeltaTM3,523 Delta4,443 Packet Losses

Conclusions Utilizing ISP connectivity enables balancing packet loss rate –vs- end-to-end delays Dynamic algorithms can adapt to a variety of wide-area conditions Congestion prediction can help in certain environments, however local-only decision making works well Certain “choke points” must be identified so that synchronization effects will not occur Making better use of bandwidth can lower cost of deploying distributed corporate networks