I. Matta1 On the Cost of Supporting Mobility and Multihoming Vatche Ishakian, Ibrahim Matta, Joseph Akinwumi Computer Science Boston University.

Slides:



Advertisements
Similar presentations
Routing Routing in an internetwork is the process of directing the transmission of data across two connected networks. Bridges seem to do this function.
Advertisements

© Antônio M. Alberti 2011 Host Identification and Location Decoupling: A Comparison of Approaches Bruno Magalhães Martins Antônio Marcos Alberti.
Why do current IP semantics cause scaling issues? −Today, “addressing follows topology,” which limits route aggregation compactness −Overloaded IP address.
1 Internet Protocol Version 6 (IPv6) What the caterpillar calls the end of the world, nature calls a butterfly. - Anonymous.
6.033: Intro to Computer Networks Layering & Routing Dina Katabi & Sam Madden Some slides are contributed by N. McKewon, J. Rexford, I. Stoica.
Introduction to TCP/IP TCP / IP –including 2 protocols Protocol : = a set of rules that govern the communication between different devices Protocol : =
IST 201 Chapter 9. TCP/IP Model Application Transport Internet Network Access.
COM555: Mobile Technologies Location-Identifier Separation.
Chapter 2 Network Models.
15-441: Computer Networking Lecture 26: Networking Future.
1 Internet Networking Spring 2004 Tutorial 7 Multicast Routing Protocols.
MOBILITY SUPPORT IN IPv6
Routing So how does the network layer do its business?
The OSI Model and the TCP/IP Protocol Suite
BA 471 – Telecommunications and Networking Dr. V.T. Raja Oregon State University
BA 471 – Telecommunications and Networking Dr. V.T. Raja Oregon State University
Introduction to Management Information Systems Chapter 5 Data Communications and Internet Technology HTM 304 Fall 07.
Term Paper Phase-I is Due on Tuesday, February 19 in class timing —Submit a Hard Copy of your paper (MS word Document) —Follow the instructions in “Term.
BA Telecommunications and Networking Dr. V.T. Raja Oregon State University
7/3/2015 Unit-3 : Network Layer 1 CS 1302 Computer Networks — Unit - 3 — — Network Layer — Text Book Behrouz.A. Forouzan, “Data communication and Networking”,
I. Matta 1 On the Cost of Supporting Multihoming and Mobility Ibrahim Matta Computer Science Boston University Joint work with Vatche Ishakian, Joseph.
Network Layer IS250 Spring 2010
1 TCP/IP architecture A set of protocols allowing communication across diverse networks Out of ARPANET Emphasize on robustness regarding to failure Emphasize.
Host Identity Protocol
NETWORK LAYER (2) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
IPv6 Network Mobility on Ad hoc network for Transportation System Assoc. Prof. Lee Bu Sung, Francis.
1 26-Aug-15 Addressing the network using IPv4 Lecture # 2 Engr. Orland G. Basas Prepared by: Engr. Orland G. Basas IT Lecturer.
1Group 07 IPv6 2 1.ET/06/ ET/06/ ET/06/ EE/06/ EE/06/ EE/06/6473 Group 07 IPv6.
Resolving the Transport “Tussle” Recursive InterNetwork Computer Science Boston U. 1.
G64INC Introduction to Network Communications Ho Sooi Hock Internet Protocol.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Protocol Layering Chapter 10. Looked at: Architectural foundations of internetworking Architectural foundations of internetworking Forwarding of datagrams.
November 29, 2004 Prof. Paul Lin 1 CPET Internetworking, Addressing, and Routing Paul I-Hai Lin, Professor Electrical and Computer Engineering.
Cisco 1 - Networking Basics Perrine. J Page 19/17/2015 Chapter 9 What transport layer protocol does TFTP use? 1.TCP 2.IP 3.UDP 4.CFTP.
TCP/IP: Basics1 User Datagram Protocol (UDP) Another protocol at transport layer is UDP. It is Connectionless protocol i.e. no need to establish & terminate.
Networks – Network Architecture Network architecture is specification of design principles (including data formats and procedures) for creating a network.
11 NETWORK LAYER PROTOCOLS Chapter 5 IP IPX NetBEUI AppleTalk.
Fundamentals of Computer Networks ECE 478/578 Lecture #19: Transport Layer Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Unreliable inter process communication in Ethernet: Migrating to RINA with the shim DIF Sander Vrijders, Dimitri Staessens, Didier Colle, Mario Pickavet.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Network Layer COM211 Communications and Networks CDA College Theodoros Christophides
IP Multicast COSC Addressing Class D address Ethernet broadcast address (all 1’s) IP multicast using –Link-layer (Ethernet) broadcast –Link-layer.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
IPv6 Routing Milo Liu SW2 R&D ZyXEL Communications, Inc.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
Master Thesis Presentation “Simulating mobility in a realistic networking environment” Supervisor : George Polyzos Examiner : George Xylomenos Student.
Chapter 2 Protocols and the TCP/IP Suite 1 Chapter 2 Protocols and the TCP/IP Suite.
Presented by Rebecca Meinhold But How Does the Internet Work?
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
IP addresses IPv4 and IPv6. IP addresses (IP=Internet Protocol) Each computer connected to the Internet must have a unique IP address.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
Network Layer (OSI and TCP/IP) Lecture 9, May 2, 2003 Data Communications and Networks Mr. Greg Vogl Uganda Martyrs University.
1 12-Jan-16 OSI network layer CCNA Exploration Semester 1 Chapter 5.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Network Layer PART IV.
ProtoRINA over ProtoGENI What is RINA? [1][2] References [1] John Day. “Patterns in Network Architecture: A Return to Fundamentals”. Prentice Hall, 2008.
IT 210: Web-based IT Fall 2012 Lecture: Network Basics, OSI, & Internet Architecture.
Delivery and Forwarding Chapter 18 COMP 3270 Computer Networks Computing Science Thompson Rivers University.
Fabric: A Retrospective on Evolving SDN Presented by: Tarek Elgamal.
This courseware is copyrighted © 2016 gtslearning. No part of this courseware or any training material supplied by gtslearning International Limited to.
UNIT 4 NETWORK LAYER. Position of network layer 7/8/2016 UNIT-3 : NETWORK LAYER 2.
Network Layer, and Logical Addresses
A quick intro to networking
Distributed Systems.
Scaling the Network: The Internet Protocol
PART IV Network Layer.
TCP/IP Explored Jun Wu 11/11/2018.
Scaling the Network: The Internet Protocol
IP Multicast COSC /5/2019.
Presentation transcript:

I. Matta1 On the Cost of Supporting Mobility and Multihoming Vatche Ishakian, Ibrahim Matta, Joseph Akinwumi Computer Science Boston University

I. Matta Mobility = Dynamic Multihoming  Hosts / ASes became increasingly multihomed  Multihoming is a special case of mobility  RINA (Recursive InterNetwork Architecture) is a clean-slate design –  RINA routing is based on node addresses m Late binding of node address to point-of-attachment  Compare to LISP (early binding) and Mobile-IP  Average-case communication cost analysis  Simulation over Internet-like topologies

What’s wrong today? one big, flat, open net Network Transport Data Link Physical Applications Network Transport Data Link Physical Applications Network DL PHY Web, , ftp, …  There’s no building block  We named and addressed the wrong things (i.e. interfaces)  We exposed addresses to applications TCP, UDP, … IP protocol

RINA offers better scoping Network Transport Data Link Physical Applications Network Transport Data Link Physical Applications Network DL PHY TCP, UDP, … IP Web, , ftp, … IPC Layer  The IPC Layer is the building block and can be composed m An IPC Layer has all what is needed to manage a “private” network, i.e. it integrates routing, transport and management  E2E (end-to-end principle) is not relevant m Each IPC Layer provides (transport) service / QoS over its scope  IPv6 is/was a waste of time! m We can have many layers without too many addresses per layer

5 RINA: Good Addressing – private mgmt  Destination application is identified by “name”  Each IPC Layer is privately managed m It assigns private node addresses to IPC processes m It internally maps app/service name to node address BA I1I1 I2I2 want to send message to “Bob” IPC Layer To: B “Bob”  B Bob IPC Layer

6 RINA: Good Addressing - late binding  Addressing is relative: node address is name for lower IPC Layer, and point-of-attachment (PoA) for higher IPC Layer  Late binding of node name to a PoA address  A machine subscribes to different IPC Layers BA I1I1 I2I2 want to send message to “Bob” BI2BI2 To: B Bob IPC Layer B,, are IPC processes on same machine I1I1 I2I2

I. Matta7 RINA: Good Routing  Back to naming-addressing basics [Saltzer ’82] m Service name (location-independent)  node name (location-dependent)  PoA address (path-dependent)  path  We clearly distinguish the last 2 mappings  Route: sequence of node names (addresses)  Late binding: map next-hop’s node name to PoA at lower IPC level sourcedestination

8 Mobility is Inherent  Mobile joins new IPC Layers and leaves old ones  Local movement results in local routing updates CHMH

9 Mobility is Inherent  Mobile joins new IPC Layers and leaves old ones  Local movement results in local routing updates CH

10 Mobility is Inherent  Mobile joins new IPC Layers and leaves old ones  Local movement results in local routing updates CH

I. Matta Compare to loc/id split (1)  Basis of solutions to the multihoming issue  Claim: the IP address semantics are overloaded as both location and identifier  LISP (Location ID Separation Protocol) ’06 EID x  EID y EID x -> EID y EID x  EID y RLOC 1x  RLOC 2y Mapping: EID y  RLOC 2y 11

Compare to loc/id split (2)  Ingress Border Router maps ID to loc, which is the location of destination Egress BR  Problem: loc is path-dependent, does not name the ultimate destination EID x -> EID y EID x  EID y RLOC 1x RLOC 2y Mapping: EID y  RLOC 2y 12

I. Matta LISP vs. RINA vs. …  Total Cost per loc / interface change = Cost of Loc / Routing Update +   [ P cons *DeliveryCost + (1-P cons )*InconsistencyCost ]  : expected packets per loc change P cons: probability of no loc change since last pkt delivery  RINA’s routing modeled over a binary tree of IPC Layers: update at top level involves route propagation over the whole network diameter D; update at leaf involves route propagation over D/2 h, h is tree height 13

I. Matta LISP 14

I. Matta LISP 15

I. Matta RINA 16

I. Matta RINA 17

I. Matta RINA 18

I. Matta MobileIP 19

I. Matta LISP vs. RINA vs. … RINA 8x8 Grid Topology RINA uses 5 IPC levels; on average, 3 levels get affected per move LISP 20

Simulation: Packet Delivery Ratio  BRITE generated 2- level topology  Average path length 14 hops  Random walk mobility model  Download BRITE from I. Matta21 RINA LISP

Simulation: Packet Delay I. Matta22 LISP RINA

I. Matta Bottom Line: RINA is less costly  RINA inherently limits the scope of location update & inconsistency  RINA uses “direct” routing to destination node  More work: prototyping 23

I. Matta RINA Thank You Questions? 24