1 Path Splicing Author: Murtaza Motiwala, Megan Elmore, Nick Feamster and Santosh Vempala Publisher: SIGCOMM’08 Presenter: Hsin-Mao Chen Date:2009/12/09.

Slides:



Advertisements
Similar presentations
Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
Advertisements

Grand Challenges in Networking Nick Feamster CS 7001.
Path Splicing with Network Slicing
Improving Internet Availability with Path Splicing Nick Feamster Georgia Tech Joint work with Murtaza Motiwala and Santosh Vempala.
Improving Internet Availability with Path Splicing Murtaza Motiwala Nick Feamster Santosh Vempala.
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Data-Plane Accountability with In-Band Path Diagnosis Murtaza Motiwala, Nick Feamster Georgia Tech Andy Bavier Princeton University.
Using VINI to Test New Network Protocols Murtaza Motiwala, Georgia Tech Andy Bavier, Princeton University Nick Feamster, Georgia Tech Santosh Vempala,
Path Splicing Nick Feamster, Murtaza Motiwala, Megan Elmore, Santosh Vempala.
Improving Internet Availability with Path Splicing Nick Feamster Georgia Tech.
Nick Feamster Research: Network security and operations –Helping network operators run the network better –Helping users help themselves Lab meetings:
Nick Feamster Research: Network security and operations –Helping network operators run the network better –Helping users help themselves Lab meetings:
Nick Feamster Research: Network security and operations –Helping network operators run the network better –Helping users help themselves Lab meetings:
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Nick Feamster Georgia Tech
A Narrow Waist for Multipath Routing Murtaza Motiwala Bilal Anwer, Mukarram bin Tariq David Andersen, Nick Feamster.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 Internet Path Inflation Xenofontas Dimitropoulos.
Computer Networks: Global Internet Global Internet.
Exploration of Path Space using Sensor Network Geometry Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Zeng, Jie Gao, Xianfeng David Gu Stony Brook University.
TIE Breaking: Tunable Interdomain Egress Selection Renata Teixeira Laboratoire d’Informatique de Paris 6 Université Pierre et Marie Curie with Tim Griffin.
1 Greedy Prefix Cache for IP Routing Lookups Author: Zhuo Huang, Gang Liu, Jih-Kwon Peir Publisher: I-SPAN 2009 Presenter: Hsin-Mao Chen Date:2010/03/10.
Traffic Engineering With Traditional IP Routing Protocols
© 2003 By Default! A Free sample background from Slide 1 SAVE: Source Address Validity Enforcement Protocol Authors: Li,
Wen Xu and Jennifer Rexford Princeton University MIRO : Multi-path Interdomain ROuting.
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Computer Networks Layering and Routing Dina Katabi
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
Quantifying the Causes of Path Inflation Neil Spring, Ratul Mahajan, and Thomas Anderson Presented by Luv Kohli COMP November 24, 2003.
Multi-path Interdomain ROuting by Xu and Rexford Alan Dunn Topics in Network Protocol Design March 5, 2010.
MPLS Forwarder Preliminary 1 Outline MPLS Overview MPLS Overview MPLS MRD MPLS Data Path HLD 48K MPLS Fwder HLD IPE MPLS Fwder HLD Issues Summary.
1 GIRO: Geographically Informed Inter-domain Routing Ricardo Oliveira, Mohit Lad, Beichuan Zhang, Lixia Zhang.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
SIGCOMM 2012 (August 16, 2012) Private and Verifiable Interdomain Routing Decisions Mingchen Zhao * Wenchao Zhou * Alexander Gurney * Andreas Haeberlen.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Networking and internetworking devices. Repeater.
Network Layer by peterl. forwarding table routing protocols path selection RIP, OSPF, BGP IP protocol addressing conventions datagram format packet handling.
Fast recovery in IP networks using Multiple Routing Configurations Amund Kvalbein Simula Research Laboratory.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Author: Haoyu Song, Murali Kodialam, Fang Hao and T.V. Lakshman Publisher/Conf. : IEEE International Conference on Network Protocols (ICNP), 2009 Speaker:
Chapter 20 Unicast Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Routing Protocols Brandon Wagner.
Ch 22. Routing Direct and Indirect Delivery.
Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
Fall, 2001CS 6401 Switching and Routing Outline Routing overview Store-and-Forward switches Virtual circuits vs. Datagram switching.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
ROUTING.
Autonomous Systems An autonomous system is a region of the Internet that is administered by a single entity. Examples of autonomous regions are: UVA’s.
COMP 3270 Computer Networks
CS 457 – Lecture 12 Routing Spring 2012.
Introduction to Internet Routing
Autonomous Systems An autonomous system is a region of the Internet that is administered by a single entity. Examples of autonomous regions are: UVA’s.
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Chapter 22. Network Layer: Routing
Backbone Traffic Engineering
2019/5/2 Using Path Label Routing in Wide Area Software-Defined Networks with OpenFlow ICNP = International Conference on Network Protocols Presenter:Hung-Yen.
BGP Instability Jennifer Rexford
CS 381: Introduction to Computer Networks
Achieving Resilient Routing in the Internet
Chapter 1 Introduction Networking Architecture Overview.
Presentation transcript:

1 Path Splicing Author: Murtaza Motiwala, Megan Elmore, Nick Feamster and Santosh Vempala Publisher: SIGCOMM’08 Presenter: Hsin-Mao Chen Date:2009/12/09

2 Outline Introduction Design Goals Path Splicing Main Idea Intradomain Path Splicing Interdomain Path Splicing Evaluation

3 Introduction Single path routing. Multipath routing provides nodes access to multiple paths for each destination. Two obstacles have hindered many multipath routing solution. 1.Scalability 2.Control

4 Design Goals High reliability Fast recovery Small stretch Control to end systems

5 Path Splicing Main Idea A new routing primitive called path splicing. 1.Generate many alternate paths by running multiple routing protocol instances. 2.Allow traffic to switch between paths at intermediate hop. 3.Give end systems the control to switch paths.

6 Intradomain Path Splicing Conventional shortest paths routing is designed to route traffic along low-cast. Path splicing creates routing trees that are base on random link-weight perturbation. Degree-base perturbations of link weights

7 Intradomain Path Splicing

8 End systems insert a “shim” splicing header in between the network and transport headers. The size of the splicing header is n ‧ lg(k) k is the number of slices. n is the number of the hops along the network path.

9 Interdomain Path Splicing BGP select only a single best route for each destination prefix. Instead, a router could select the best k routers and push them into the forwarding table. An n-hop AS path requires 2n ‧ lg(k) routing bit.

10 Interdomain Path Splicing

11 Evaluation Reliability Intradomain Sprint backbone network topology inferred from Rocketfuel[29]

12 Evaluation Reliability Interdomain C-BGP[25]

13 Evaluation Recovery Intradomain

14 Evaluation Recovery Interdomain

15 Evaluation Stretch Intradomain

16 Evaluation Novelty Intradomain

17 Evaluation Comparison to Routing Deflections[32]

18 Evaluation Incremental Deployability

19 Evaluation Minimal Disruption to Traffic Abilene network(11 nodes, 14 links)