1 / 12

R outing A rchitecture for the N ext- G eneration I nternet (RANGI) draft-xu-rangi-01.txt

R outing A rchitecture for the N ext- G eneration I nternet (RANGI) draft-xu-rangi-01.txt. Xiaohu Xu ( xuxh@huawei.com ) IETF76 Hiroshima. Design Goals for RANGI. Mobility and Multi-homing Routing Scalability. ID/locator split. IPv4/IPv6 Coexistence and Transition

scout
Télécharger la présentation

R outing A rchitecture for the N ext- G eneration I nternet (RANGI) draft-xu-rangi-01.txt

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing Architecture for the Next-Generation Internet (RANGI) draft-xu-rangi-01.txt Xiaohu Xu (xuxh@huawei.com) IETF76 Hiroshima

  2. Design Goals for RANGI • Mobility and Multi-homing • Routing Scalability ID/locator split • IPv4/IPv6 Coexistence and Transition • Transition Mechanism for RANGI Hierarchical Management New Internet Architecture Deployable • Reasonable Business Model • Clear Trust Boundary • Business-friendly • Cryptographic Host Identifier Security

  3. RANGI Protocol Stack Demo Transport Transport Transport Flat Host ID (128bit) Hierarchical Host ID (128bit) Network Locator (128bit) IPv4-embeded IPv6 Address (128bit) Data Link Data Link Data Link HIP RANGI IP

  4. Host ID Host ID n bits (n=64) 128-n bits AD ID Local Host ID Country ID Authority ID Region ID 层次化 主机ID • AD（Administrative Domain）ID • Organizational semantics and trust boundaries． • Reasonable business model for the ID to locator mapping system． • Local Host ID • The hash over the AD ID and the public key of the host. • Secure the ID ownership. • Use CGA (RFC3972) as host ID in our implementation for simplicity (example)

  5. Locator 层次化 Locator Locator 96 bits 32 bits • LD（Locator Domain）ID • Globally identify each LD (e.g., site network). • LDID isactually PA (Provider Assigned) /96 IPv6prefix. • LL (Local Locator) • Each LD uses independent IPv4 address space (e.g., private address). • When ISP changed,only LDID changes, local locator unchanged. • GL (Global Locator)= LDID + LL • Use ISATAP (RFC5214) address as GL in our implementation for simplicity LD ID LL(IPv4)

  6. ID to LocatorResolution 层次化 路由系统 Mapping System DHT DHT DHT DHT • Hierarchical DHT based Mapping System • Reasonable business model and clear trust boundary. • Use reverse-DNS as mapping system in our current implementation for simplicity Root Routing based on the AD ID Country 1 Country 2 Country n City 1 City 2 City 3 City n Routing based on the local host ID (i.e. Hash value)

  7. Routing and Forwarding Routing System • Use ISATAP like mechanism in site (edge) networks • Use Softwire [RFC5565]mechanism in provider ASes • Either intra-AS softwire or inter-AS softwire mechanism works well. Payload Payload Payload HI(A)->HI(B) HI(A)->HI(B) HI(A)->HI(B) IPv6(A)->IPv6(B) IPv6(A)->IPv6(B) IPv6(A)->IPv6(B) IPv4(A) ->IPv4(BR1) IPv4(BR2) -> IPv4(BR3) IPv4(BR4) -> IPv4(B) Host A Host B LD #1 (Pub/Pri IPv4) LD #3 (Pub/Pri IPv4) BR4 BR1 BR2(AFBR) BR3(AFBR) IPv4 Internet

  8. Site Multi-homing LDID_1+LL(A)->GL(B) LDID_1+LL(A)->GL(B) LDID_1+LL(A)->GL(B) Routing System LDID_1+LL(A)->GL(B) • Multiple PA LDIDs are allocated to a multi-homed site network • Routing system scales well due to the usage of multiple PA locators. BR2 ISP #1 Host A BR1 Host B LD #1 Source LD ID based policy routing LDID_1assigned by ISP #1 BR3 ISP #2 LDID_2assigned by ISP #2

  9. Site-controlled Traffic-Engineering Routing System LDID_1+LL(A)->GL(B) LDID_2+LL(A)->GL(B) LDID_2+LL(A)->GL(B) LDID_2+LL(A)->GL(B) • Site LDBR rewrites source LDIDs of the outgoing packets before performing source-based policy routing. • Borrow ideas from GSE, Six/One. BR1rewrites the source LDID before performing source-based policy routing BR2 ISP #1 Host A BR1 Host B LD #1 BR3 LDID_1assigned by ISP #1 ISP #2 LDID_2assigned by ISP #2

  10. Site-controlled Traffic-Engineering Routing System BR2 ISP #1 Host A BR1 Host B LD #1 GL(B) -> LDID_2+LL(A) GL(B) -> LDID_2+LL(A) GL(B) -> LDID_2+LL(A) GL(B) -> LDID_2+LL(A) LDID_1分配自ISP #1 BR3 ISP #2 LDID_2分配自ISP #2 • Return packets follow the same path as the outgoing packets travel along.

  11. How RANGI Matches the RRG Design Goals Mobility Desired Routing Scalability ID/locator Split Route Security Deployable Strong desired Multi-homing Traffic-Engineering Simplified Renumbering Route Stability Required

  12. Next Steps • Implement and verify this architecture • Funded by China National High-Tech Program (863). • Optimize it according to feedbacks and experiments • Solicit more participants who are interested in this architecture

More Related