WINLAB Comparing Alternative Approaches for Networking of Named Objects in the Future Internet Akash Baid, Tam Vu, Dipankar Raychaudhuri WINLAB, Rutgers.

Slides:



Advertisements
Similar presentations
Internet Indirection Infrastructure (i3 ) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002 Presented by:
Advertisements

Scalable Content-Addressable Network Lintao Liu
1 Mobile IPv6-Based Ad Hoc Networks: Its Development and Application Advisor: Dr. Kai-Wei Ke Speaker: Wei-Ying Huang.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
IPv4 and IPv6 Mobility Support Using MPLS and MP-BGP draft-berzin-malis-mpls-mobility-00 Oleg Berzin, Andy Malis {oleg.berzin,
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian* Matthew Caesar* Cheng Tien Ee*, Mark Handley° Morley Maoª, Scott Shenker*
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
1 Name Directory Service based on MAODV and Multicast DNS for IPv6 MANET Jaehoon Jeong, ETRI VTC 2004.
14 – Inter/Intra-AS Routing
1 Attribute Based Communications University of California, Irvine Presented By : Ala Khalifeh (Note: Presented)
An Active Reliable Multicast Framework for the Grids M. Maimour & C. Pham ICCS 2002, Amsterdam Network Support and Services for Computational Grids Sunday,
Backbone Support for Host Mobility: A Joint ORBIT/VINI Experiment Jennifer Rexford Princeton University Joint work with the ORBIT team (Rutgers) and Andy.
Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002.
Computer Networks Layering and Routing Dina Katabi
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
14 – Inter/Intra-AS Routing Network Layer Hierarchical Routing scale: with > 200 million destinations: can’t store all dest’s in routing tables!
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
RSC Part II: Network Layer 6. Routing in the Internet (2 nd Part) Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are,
Introduction 1 Lecture 19 Network Layer (Routing Protocols) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science &
DMAP : Global Name Resolution Services Through Direct Mapping Tam Vu, Akash Baid WINLAB, Rutgers University (Joint.
CS 3830 Day 29 Introduction 1-1. Announcements r Quiz 4 this Friday r Signup to demo prog4 (all group members must be present) r Written homework on chapter.
Sato Lab G lobal I nformation and T elecommunication S tudies Waseda University 2014/06/19 ICN Based Disaster Information Sharing Service(DISS) Zheng Wen,
HAIR: Hierarchical Architecture for Internet Routing Anja Feldmann TU-Berlin / Deutsche Telekom Laboratories Randy Bush, Luca Cittadini, Olaf Maennel,
Scalable Ad Hoc Routing the Case for Dynamic Addressing.
Floodless in SEATTLE : A Scalable Ethernet ArchiTecTure for Large Enterprises. Changhoon Kim, Matthew Caesar and Jenifer Rexford. Princeton University.
Network Layer4-1 Distance Vector Algorithm Bellman-Ford Equation (dynamic programming) Define d x (y) := cost of least-cost path from x to y Then d x (y)
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
The Network Layer.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
Multimedia & Mobile Communications Lab.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
APPLICATION LAYER MULTICASTING
Routing and Routing Protocols
Introduction to Mobile IPv6
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
IP Routing Principles. Network-Layer Protocol Operations Each router provides network layer (routing) services X Y A B C Application Presentation Session.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Network Layer4-1 Routing Algorithm Classification Global or decentralized information? Global: r all routers have complete topology, link cost info r “link.
Peter R Pietzuch and Jean Bacon Peer-to-Peer Overlay Networks in an Event-Based Middleware DEBS’03, San Diego, CA, USA,
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee, Mark Handley, Morley Mao, Scott Shenker,
Inter-domain Routing Outline Border Gateway Protocol.
Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
IDR WG, IETF Dublin, August, 2008 Vince Fuller (for the LISP crew) LISP+ALT Mapping System.
Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.
Internet Indirection Infrastructure (i3)
Implementation of GPU based CCN Router
HLP-A Next Generation Inter-Domain Routing Protocol
Plethora: Infrastructure and System Design
Early Measurements of a Cluster-based Architecture for P2P Systems
Overlay Networking Overview.
COMP/ELEC 429/556 Introduction to Computer Networks
Computer Networks Protocols
Presentation transcript:

WINLAB Comparing Alternative Approaches for Networking of Named Objects in the Future Internet Akash Baid, Tam Vu, Dipankar Raychaudhuri WINLAB, Rutgers University, NJ, USA

WINLAB Motivation Increasing consensus on: – Rethinking Internet design around named data – Separating naming & addressing functionalities But implementation details under a lot of debate: – How to name content and hosts ? – Whether to route directly on names ? – How integrated should caching and CDNs be ? –... This work: Comparing two major naming and layering approaches through big picture analysis and back-of-the- envelope numbers

WINLAB Layering Alternatives CCN Approach: - Hierarchical names - Used for routing packets - Used for caching at routers Hybrid GUID-Name (HGN) Approach: - Use flat GUIDs for caching - Use topological addresses for routing

WINLAB CCN & HGN Routing/forwarding GUID-Address Mapping Routing Table GUIDNA xz1756..Net 1194 Dest NAPath Net 123Net1,Net2,.. GUID –based forwarding (slow path) Network Address Based Routing (fast path) GUIDContent x1122 Video File Cache Name-forwarding table NameFace /winlab/vids/ 1 Name-based Interest forwarding Name Content /winlab/video1/ Video File Cache Using an instance of HGN routing, as per the design in the MobilityFirst project 1 1 MobilityFirst Future Internet Architecture Project, CCN RoutingHGN Routing

WINLAB Comparison Points Routing Table Size Routing Update Overhead Infrastructure Requirements Use Case Scenarios: – Content Retrieval – Unicast Push/Pull – Mobile Receivers/Senders

WINLAB Routing Table Size HGN: Routing decoupled from the content names – Can be designed to contain network specific prefix – Thus routing table bounded by no. of networks CCN: Name based routing – Routing table size depends on name aggregation – Which depends on mapping between the naming tree and the topological structure of the network

WINLAB A simple naming abstraction levels of hierarchy; prefix at level having sub- level prefixes. Define which indicates the prefix level below which the naming tree starts being influenced by the network topology

WINLAB Routing Table Size Key message: Hierarchy in name reduces the table size only when the name prefixes have some degree of dependence on the physical network topology.

WINLAB Routing Update Overhead HGN: Network reachability through routing protocol and content reachability through GNRS – content additions/deletions and changes in its hosting location do not effect the network CCN: Content movement is reflected in the routing – content movements are propagated to maintain reachability How much is the routing overhead for changes in content ?

WINLAB Update overhead study Using AS-level topology generator and BGP simulator 2 – generates realistic topologies with 3 kinds of nodes: tier-1 (T), mid-level (M), customer (C) – 3 simulations with total nodes A = {1K, 5K, 10K} Event under consideration: – Withdraw a name prefix – Wait for table convergence – Re-announce the prefix from another network Metric: Total number of name update messages passed between all nodes 2 A. Elmokashfi, A. Kvalbein, and C. Dovrolis, “On the Scalability of BGP: The Role of Topology Growth,” IEEE Journal on Selected Areas in Comm., vol. 28, no. 8, 2010

WINLAB Total no. of update messages Name based routing could burden the network with large number of updates when there is dynamism in where the content is advertised from

WINLAB Infrastructure Requirements Scalability properties of HGN in terms of routing table & overhead comes at the cost of a global name resolution infrastructure The GUID  NA mapping incurs a resolution latency – how much is this latency ? – how can we make this small ? MobilityFirst approach 3 : – distribute the mapping between the routers – use a single-hop DHT to insert/query the mappings 3 T. Vu et al., “DMap: A Shared Hosting Scheme for Dynamic Identifier to Locator Mappings in the Global Internet,” in Proceedings of ICDCS, 2012

WINLAB Name resolution response time Results from a large-scale measurement drive simulation – uses real inter-AS & intra-AS latencies measured through DIMES project – measures response times for 1 million queries sourced from randomly selected end-hosts distributed uniformly across all ASs.

WINLAB Conclusions While extremely efficient for content retrieval, the baseline CCN can suffer from scalability issues in terms of: – Routing table size – Update traffic overhead – Unicast push message overhead – Mobile source latency A hybrid approach with an additional level of indirection can mitigate some of the scaling challenges