2-Phased Mapping for Internet Core/Edge Split Scheme

Slides:



Advertisements
Similar presentations
© Antônio M. Alberti 2011 Host Identification and Location Decoupling: A Comparison of Approaches Bruno Magalhães Martins Antônio Marcos Alberti.
Advertisements

LISP Mobile Node LISP Mobile Node draft-meyer-lisp-mn-00.txt Dino Farinacci, Vince Fuller, Darrel Lewis and David Meyer IETF StockholmHiroshima LISP Working.
Why do current IP semantics cause scaling issues? −Today, “addressing follows topology,” which limits route aggregation compactness −Overloaded IP address.
Hierarchical Routing Architecture Introduction draft-xu-rrg-hra-00.txt Routing Research Group Xiaohu XU
IETF 72 – July 2008 Vince Fuller, Darrel Lewis, Eliot Lear, Scott Brim, Dave Oran, Noel Chiappa, John Curran, Dino Farinacci, and David Meyer LISP Deployment.
IPv4 and IPv6 Mobility Support Using MPLS and MP-BGP draft-berzin-malis-mpls-mobility-00 Oleg Berzin, Andy Malis {oleg.berzin,
COM555: Mobile Technologies Location-Identifier Separation.
1 Towards Secure Interdomain Routing For Dr. Aggarwal Win 2004.
A Framework for Scalable Global IP-Anycast Sigcomm 2000, Dina Katabi Presented by Wei Yu.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 4: More Routing, DNS True or False? T F  Path-vector based distance vector.
A Scalable, Commodity Data Center Network Architecture.
Petteri Sirén. Content Preface Locator/ID Separation Protocol (LISP) How LISP works Methods how LISP was studied Test cases Result Summary.
Research on IP Anycast Secure Group Management Wang Yue Network & Distribution Lab, Peking University Network.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 4: Addressing in an Enterprise Network Introducing Routing and Switching in the.
Session 5C, 16 June 2011 Future Network & Mobile Summit 2011 Copyright 2011 Mobile Oriented Future Internet HINLO: An ID/LOC Split Scheme for Mobile Oriented.
Host Mobility for IP Networks CSCI 6704 Group Presentation presented by Ye Liang, ChongZhi Wang, XueHai Wang March 13, 2004.
RRG Recommendation IETF77 March 26, 2010.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Addressing in an Enterprise Network Introducing Routing and Switching in the.
NAGing about LISP LISP Designers/Implementors: Dave Meyer, Vince Fuller, Darrel Lewis, Eliot Lear, Scott Brim, Dave Oran, Dana Blair, Noel Chiappa, John.
IDRM: Inter-Domain Routing Protocol for Mobile Ad Hoc Networks C.-K. Chau, J. Crowcroft, K.-W. Lee, S. H.Y. Wong.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
Sharing a single IPv4 address among many broadband customers
HAIR: Hierarchical Architecture for Internet Routing Anja Feldmann TU-Berlin / Deutsche Telekom Laboratories Randy Bush, Luca Cittadini, Olaf Maennel,
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Addressing in an Enterprise Network Introducing Routing and Switching in the.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 4: Addressing in an Enterprise Network Introducing Routing and Switching in the.
LISP BOF, IETF Dublin, July, 2008 Vince Fuller (for the LISP crew) LISP+ALT Mapping System.
Management for IP-based Applications Mike Fisher BTexaCT Research
Cisco Global Routing Summit, August, 2008 Vince Fuller (for the LISP crew) Introduction to LISP+ALT.
RIPE Berlin – May, 2008 Vince Fuller (for Dino, Dave, Darrel, et al) LISP: Intro and Update
1 Route Optimization for Large Scale Network Mobility Assisted by BGP Feriel Mimoune, Farid Nait-Abdesselam, Tarik Taleb and Kazuo Hashimoto GLOBECOM 2007.
Copyright 1999, S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 34 Routing Algorithms Ref: Tanenbaum pp ;
LISP Deployment Scenarios Darrel Lewis and Margaret Wasserman IETF 76, Hiroshima, Japan.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
1 Lecture, November 20, 2002 Message Delivery to Processes Internet Addressing Address resolution protocol (ARP) Dynamic host reconfiguration protocol.
1 Lecture 11 Routing in Virtual Circuit Networks Internet Addressing.
Bringing External Connectivity and Experimenters to GENI Nick Feamster Georgia Tech.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—1-1 Planning Routing Services Lab 1-1 Debrief.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Shrinking and Controlling Routing Table Size Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.
: MobileIP. : r Goal: Allow machines to roam around and maintain IP connectivity r Problem: IP addresses => location m This is important for efficient.
Deploying Dual-Stack Lite in IPv6 Network draft-boucadair-dslite-interco-v4v6-04 Mohamed Boucadair
Lightweight 4over6: An Extension to DS-Lite Architecture draft-cui-softwire-b4-translated-ds-lite-09 Y. Cui, Q. Sun, M. Boucadair, T. Tsou, Y. Lee and.
COM594: Mobile Technologies Location-Identifier Separation.
Mobility With IP, implicit assumption that there is no mobility. Addresses -- network part, host part -- so routers determine how to get to correct network.
Communicating Prefix Cost to Mobile Nodes (draft-mccann-dmm-prefixcost-02) IETF 94 Yokohama.
IDR WG, IETF Dublin, August, 2008 Vince Fuller (for the LISP crew) LISP+ALT Mapping System.
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 and Addressing in Next-Generation EnteRprises (RANGER)
LISP Implementation Report
Boarder Gateway Protocol (BGP)
LISP BOF, IETF 72 Dublin, July, 2008 Darrel Lewis (for the LISP crew)
IP for Mobile hosts.
Introduction to Load Balancing:
Evolution Towards Global Routing Scalability
Instructor Materials Chapter 9: NAT for IPv4
Goals of soBGP Verify the origin of advertisements
COMP 3270 Computer Networks
NETLMM protocol proposal draft-akiyoshi-netlmm-protocol-00.txt
with distributed anchor routers
Running Multiple PLATs in 464XLAT
Global Locator, Local Locator, and Identifier Split (GLI-Split)
Routing and Switching Essentials v6.0
Plethora: Infrastructure and System Design
IDR WG, IETF Dublin, July, 2008 Vince Fuller (for the LISP crew)
Juniper Networks IPv6 Implementation
Instructor Materials Chapter 9: NAT for IPv4
An Update on Multihoming in IPv6 Report on IETF Activity
Chapter 11: Network Address Translation for IPv4
Using Service Function Chaining for In-Network Computation
Presentation transcript:

2-Phased Mapping for Internet Core/Edge Split Scheme Wei Zhang Tsinghua University

Background RRG Tasks Next generation Internet routing architecture Focuses: Routing Concerns: Scalability problem Solutions: Hierarchical routing Core/Edge split (LISP,eFIT,IVIP,SIX/ONE...) Proposals: Common necessity: Mapping from Edge/EID to Core/RLoc Where we are going !

Motives Mapping from EID to RLoc in core/edge schemes may not be scalable if the dynamics of (prefix,ETR) binding is high. In order to make the routing system really scalable and reduce the overhead on updating, we need to design a relatively more stable mapping mechanism than any EID topology or routing policy changes.

A 2-phased mapping model Phase I Phase II Prefixes AS# ETRs An M:1:M mapping model Introduce AS# in the middle can prevent too much detailed topology/policy changing information from getting into the mapping system.

Assumptions all ASes know better their local prefixes (in the IGP) than others. ASes also know better their ETRs. So all mapping information can be collected locally.

Implements Phase I mapping system (register/resolve prefix to AS#) Each AS should have at least one agent to register its local prefixes (range of IP addresses). May be hierarchical like DNS, or centralized like whois. Phase II mapping (AS# to ETRs) XTRs advertise their AS# bindings with each other through BGP extension.

Deployments Core Phase I mapping servers Updated border routers (XTRs) Edge Register agents

Phase I Updating Internet Core Phase I mapping server Edge AS1 Prefix register agent Prefix register agent 1.1.0.0/17 1.1.128.0/17 2.2.0.0/16

Phase II Updating Internet Core BGP advertisement Edge AS1 Edge AS2 XTR3 XTR1 XTR2 AS1 has ETR1 AS2 has ETR2,ETR3 AS1 has ETR1 Edge AS1 Edge AS2 XTR=ITR/ETR

Phase I Lookup Internet Core Phase I mapping server Edge AS1 Edge AS2 Where is 2.2.2.2 2.2.2.2 in AS 2 AS1:ITR1 AS2:ETR3 AS2:ETR2 Edge AS1 Edge AS2 Host A 2.2.2.2

Phase II Lookup Internet Core Edge AS1 Edge AS2 Tunnel packets to ETR2 ITR1 will Check which ETR is the closest to AS2 AS2:ETR3 AS2:ETR2 Edge AS1 Edge AS2 Host A 2.2.2.2

Gains Any prefixes reconfiguration (aggregation/ deaggregation) within an AS will not be notified to mapping system. Possible highly efficient aggregation of the local prefixes (a range of IP space). Both phase I and phase II mapping can be stable. A stable mapping system will reduce the update overhead introduced by topology change/routing policy dynamics.

Summary The 2-phased mapping scheme introduces AS# between the mapping prefixes and ETRs. The decoupling of direct mapping makes highly dynamic updates stable, therefore it can be more scalable than any direct mapping designs. The 2-phased mapping scheme is adaptable to any core/edge split proposals.