New Directions in Routing

Slides:



Advertisements
Similar presentations
Internetworking II: MPLS, Security, and Traffic Engineering
Advertisements

Chapter 19 Network Layer: Logical Addressing Stephen Kim.
How to Construct a Correct and Scalable iBGP Configuration Mythili Vutukuru Joint work with Paul Valiant, Swastik Kopparty and Hari Balakrishnan.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Announcement  Slides and reference materials available at  Slides and reference materials available.
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian* Matthew Caesar* Cheng Tien Ee*, Mark Handley° Morley Maoª, Scott Shenker*
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
BGP: Inter-Domain Routing Protocol Noah Treuhaft U.C. Berkeley.
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao (UMass-Amherst)
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Tussle in cyberspace: Defining tomorrow ’ s internet D.Clark, J.Wroclawski, K.Sollins & R.Braden Presented by: Ao-Jan Su (Slides in courtesy of: Baoning.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Economic Incentives in Internet Routing Jennifer Rexford Princeton University
Postmodern Internet Architecture Defense Zhaosheng Zhu Kevin Tan.
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
Semester 4 - Chapter 3 – WAN Design Routers within WANs are connection points of a network. Routers determine the most appropriate route or path through.
1 Understanding Route Redistribution ICNP 2007 October 17 th, 2007 Franck Le, Geoffrey G. Xie, Hui Zhang.
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Inter-domain Routing Outline Border Gateway Protocol.
Information-Centric Networks07b-1 Week 7 / Paper 2 NIRA: A New Inter-Domain Routing Architecture –Xiaowei Yang, David Clark, Arthur W. Berger –IEEE/ACM.
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
Lecture 8 Page 1 Advanced Network Security Review of Networking Basics: Internet Architecture, Routing, and Naming Advanced Network Security Peter Reiher.
Information-Centric Networks04a-1 Week 4 / Paper 1 Open issues in Interdomain Routing: a survey –Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure.
MOTIA FINAL CONFERENCE ''Project Presentation” “Interdependency at the Physical and IP Levels” Wp1 and Wp2 With the support of the Prevention, Preparedness.
Module 3: Designing IP Addressing. Module Overview Designing an IPv4 Addressing Scheme Designing DHCP Implementation Designing DHCP Configuration Options.
Efficient Addressing Outline Addressing Subnetting Supernetting CS 640.
Internetworking – What is internetworking? Connect multiple networks of one or more organizations into a large, uniform communication system. The resulting.
HAIR: Hierarchical Architecture for Internet Routing Anja Feldmann TU-Berlin / Deutsche Telekom Laboratories Randy Bush, Luca Cittadini, Olaf Maennel,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Addressing Issues David Conrad Internet Software Consortium.
How to Construct a Correct and Scalable iBGP Configuration Mythili Vutukuru Joint work with Paul Valiant, Swastik Kopparty and Hari Balakrishnan.
Pitch Patarasuk Policy Disputes in Path-Vector Protocol A Safe Path Vector Protocol The Stable Paths Problem and Interdomain routing.
Technical Solution Proposal
Information-Centric Networks Section # 7.2: Evolved Addressing & Forwarding Instructor: George Xylomenos Department: Informatics.
Introduction to Active Directory
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee, Mark Handley, Morley Mao, Scott Shenker,
11 ROUTING IP Chapter 3. Chapter 3: ROUTING IP2 CHAPTER INTRODUCTION  Understand the function of a router.  Understand the structure of a routing table.
Inter-domain Routing Outline Border Gateway Protocol.
Fabric: A Retrospective on Evolving SDN Presented by: Tarek Elgamal.
Computer Network Architecture Lecture 7: OSI Model Layers Examples II 1 26/12/2012.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Routing Scalability Mingwei Hu Tarek Elgamal. Background Routing Scheme A mechanism that can delivers network packets from any node to any other nodes.
Routing and Addressing in Next-Generation EnteRprises (RANGER)
Lecture (2).
Link State Routing protocol
Inferring Autonomous System Relationships in the Internet Lixin Gao Dept. of Electrical and Computer Engineering University of Massachusetts, Amherst.
Towards an Evolvable Internet Architecture
Zueyong Zhu† and J. William Atwood‡
Distributed Systems.
Semester 4 - Chapter 3 – WAN Design
COS 561: Advanced Computer Networks
An IPv4 address is a 32-bit address that uniquely and universally defines the connection of a device (for example, a computer or a router) to the Internet.
Lecture 2 Overview.
CPE 401 / 601 Computer Network Systems
Chapter 8: Subnetting IP Networks
Chapter 3: Dynamic Routing
Dynamic Routing Protocols
Can Economic Incentives Make the ‘Net Work?
Goals Introduce the Windows Server 2003 family of operating systems
COS 561: Advanced Computer Networks
Consideration on IPv6 Address Management
COS 561: Advanced Computer Networks
Dynamic Routing Protocols
COS 561: Advanced Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks
COS 461: Computer Networks
Computer Networks Protocols
Presentation transcript:

New Directions in Routing Papers presented "Towards a Logic for Wide-Area Internet Routing", in ACM SIGCOMM FDNA-03 "Stable Internet routing without global coordination", in Proc. ACM SIGMETRICS, June 2000 "NIRA: A New Internet Routing Architecture", in ACM SIGCOMM FDNA-03

“Towards a Logic for Wide-Area Internet Routing” Goals of the paper Develop a set of rules / properties of wide-area routing Use the rules to prove that a routing system satisfies various properties Paper analyzes various parts of BGP Finds faults in BGP, and proves that certain configurations of BGP are “good” Authors invite routing protocol developers to utilize their logic

Deficiencies of BGP Poor integrity Slow convergence Divergence Unpredictability Poor control of information flow Poor integrity: various attacks; hard to configure properly Slow convergence: instability; route flap dampening Divergence: policies can lead to divergence Unpredictability: hard to predict the effects of changing configuration Poor control of information flow: data can be unintentionally exposed

Routing Properties Considered Validity Visibility Safety Determinism Information-flow control Validity: packet will be delivered (if path exists) Visibility: ability to determine that a path exists for a packet Safety: possibility for conflicting cycles to form Determinism: determination of route ordering is independent of time that information arrives, and other routes Information-flow control: prevention of mistakenly giving away sensitive information

Applying the logic (results) Route reflectors can cause BGP to violate validity BGP is not “safe” BGP can violate information flow policy validity: (slide) not “safe”: paper lists an example sequence of events that leads to a routing contradiction information flow: example in paper shows how BGP gives

Other Applications Configuration analysis Configuration synthesis Develop tools to analyze properties of routing configurations Configuration synthesis Easier configuration with provable properties Protocol Design Authors are planning to design a BGP replacement which utilizes the logic

Conclusion A wide area routing configuration can be analyzed by a set of properties These properties can be used to prove the system operates in a specific manner The properties can be used to: analyze the configuration of current routers synthesize routing configurations design future protocols

“Stable Internet Routing Without Global Coordination” Goals of the paper Develop a set of guidelines to Solve cases where BGP configuration can lead to divergent routing Retain most of BGP's flexibility Utilize the nature of commonly used AS relationships

Inter-AS Relationships Provider-to-Customer A larger ISP provides service to a smaller ISP Private peering Two comparable ISP's agree to share network bandwidth Backup Link An ISP provides backup service for another ISP when it is not running

General Algorithm The guidelines... limit the type of data that is exported based on the relationships of the ISPs limit the connection topology based on the relationships of the ISPs

An Example Problem Scenerio

Hierarchical AS Interconnection Exporting to provider Only give customer details; not peer Exporting to customers Include provider and peer routes Exporting to private peers Includes it's routes, and it's customers routes, but not routes from providers or other private peers

An Example AS Interconnection

Guidelines Guideline A Guideline B Routes via customers are prefered over providers and private peers Guideline B Relaxes guideline A Allows a private peer route to be ranked equivalently to customer routes

Guidelines (continued) Guideline C (adds backup link support) If no backup link exists, then use Guidelines A or B All backup routes should then have lower priority than all other routes This requires community cooperation to agree on the preference numbers used for backup links

Conclusion The authors show that by utilizing the guidelines that they outline, the BGP routing system will converge The guidelines take into account the many complex relationships that ASes generally have The restrictions of the guideline should allow most AS relationships to still be configured

NIRA: A New Internet Routing Architecture Goals of the Paper Allow users to choose their routing Create better competition among ISPs Takes into account the general hierarchical nature of the internet ISP compensation is a requirement Does not require complex compensation such as micropayment

Basic Proposal Packets contains more complex route information more overhead Addressing is constructed hierarchically this helps to minimize overhead in certain cases Routing is specified at the domain level

Route Representation All addresses are 128 bits Addresses are hierarchically assigned The paper uses IPv6 representation But, is otherwise independent of IPv6 Canonical routes Utilizes topology to minimize overhead Routes only require 2 addresses

Example Hierarchy

Sample Routes Canonical route Non-canonical route 400 200 100 300 500 600 src=ae80:1:1::ec & dst=ae80:2:2:2::6c1a Non-canonical route 400 200 300 500 600 Would require ae80:1::/32 be added to route list

Route Discovery Hosts can utilizes 2 services Topology Information Propagation Protocol (TIPP) Allows hosts to learn topology of network Name-to-Route Resolution Service (NRRS) Allows route lookup in “route servers” Inspired by DNS

Provider Compensation Paper concludes that micropayments are not feasible Proposes that users prepay for access to use a domain's bandwidth Risks of exposing routes Paper mentions that a non-cooperative hosts could cause more expensive routes to be used This could end up costing the reciever more

Conclusion NIRA is designed to allow for more competition between ISPs, which hopefully would lead to lower overall ISP rate The paper presents an interesting routing system, but I had some concerns Routing complication? Payment system? Potential for misuse?