Information Network 1 Routing (1) - NAIST · 2. send my distance vectors to all neighbor routers 3....

Information Network 1Routing (1)

Youki KadobayashiNAIST

Image: Part of the entire Internet topology based onCAIDA dataset, using NAIST Internet viewer

The Routing Problem

How do I get from source to destination?

163.221.10.10 203.178.136.61

The Routing Problem: add some realistic constraints…

How do I get from source to destination?

Which path is best? In terms of:Number of hopsDelay, bandwidthPolicy constraints, cost…

Who will make decision?Router?Source?

How can we detect failures?How much the overhead will be?

Rogue ISP

500ms 500ms

unreliable

Routing problem can be solved in many ways

Represent network in:a graph, ora matrix

Collect information:across the network, ortoward some routers, oronly locally among neighbors

Compute route at:every router, orsome routers

… solutions are instantiated in routing systems.

Characterization of routing systems

Static routingCompute route a priori

Dynamic routingReflect dynamic state of network

Source-based routingSource node computes path to destination

Hop-by-hop routingEvery node computes next hop

Focus of this lecture: dynamic, hop-by-hop routing

Static routingCompute route a priori

Dynamic routingReflect dynamic state of network

Source-based routingSource node computes path to destination

Hop-by-hop routingEvery node computes next hop

Routing system has many functions

Provision end-to-end reachabilityAutomatically compute best pathDistribute traffic among multiple links

Avoid failing linksIsolate faultsReflect administrative policies

… in one system. Isn’t it awesome.

Routing system can be characterized by…

Representation of networkNetwork topologyAttributes associated with each link

Exchange of informationCommunication overheadPropagation speed

Computation algorithmComputation overheadConvergence speed

Routing system: protocol + information + algorithm

Routing system: its structure

Routing protocoldiscovers neighbor router;exchanges topology information;exchanges link information

Routing algorithmcomputes route (result: RIB - Routing Information Base)

Integrate information from multiple routing protocolsMultiple routing protocols → Multiple RIBsConsolidate Multiple RIBs into single FIB(FIB: Forwarding Information Base)

Typically, routing protocol discovers network topology

Topology: geometric configurations that are unaltered by elastic deformations

∞ 1 31 ∞ 23 2 ∞

Graph representation Matrix representation

Gateway Model: a conceptual model of routing system

FIB(forwarding information base)

Input interfaces Output interfaces

Multiple RIBs(routing information base)

Routing softwareTopology info,Link status info

Topology info,Link status info

Types of Routing Algorithm

1. Distance vector2. Link state3. Path vector

Key difference of these algorithms:Topology representationPropagation range / frequency / timing of link stateAlgorithm for computing shortest path

Design trade-offs:ScalabilityConvergence timeAlgorithm simplicity

Questions?

Distance Vector Routing

Distance vector routing w/ Bellman-Ford algorithm1. assign distance vector to myself 0; for others, assign ∞2. send my distance vectors to all neighbor routers3. router calculates minimum distance vectors by 1) distance vectors advertised by neighbor routers and 2) distance from myself to individual neighbor router

Initial condition

bi(0) ← ∞ (i ≠ D)

bD(0) ← 0

Repetition

bi(m) ← minj ∈ Vi{bj

(m-1) + dij}

Terminal condition

bi(m) = bi

D: destination router, bi(m): distance between router “i” and “D” by m-times iterative

calculation, Vi: neighbor routers of router “i”, dij: distance of link between router “i” and j

DN p.397

RIP: Routing Information Protocol

Distance vector routingRIP-2 (IPv4), RIPng (IPv6)Used in relatively small network

• Due to ease of implementation and operation

Textbook classics

RFC 2453, RFC 2080

Informal description of RIP

Each router sends a list of distance-vectors (route, cost) to each neighbor periodicallyEvery router selects the route with smallest metricMetric: integer of 1..16, where 16 implies infinity

A B Ccost: 2cost: 1

Router metricA 3

Router metricA 1

Router metricB 1

Hands on:

RIP in action via GNS3 software(quick demo by TA)

Hands on task: try to expand your RIP network

Add 4th router to your RIP network and verify connectivityExample topology:

Problems of distance vector routing

Poor scalability. For the given number of routers N,Time complexity: O(N3)Traffic: O(N2)

Slow convergence speed, as it sends distance vector periodically

Slow convergence induces inconsistent and transitional state=> Counting to infinity problem

Counting to infinity problem

Suppose link B-C went down.B thinks: (C, inf)A says: (C, 2)B thinks: (C, 3) via AB says: (C, 3)A thinks: (C, 4) via B…

1 1 → inf

Split Horizon

Suppose link B-C went down.B thinks: (C, inf)A says: (C, 2) to everyone except B…

1 1 → inf

Workaround for counting to infinityRouter doesn’t send learned information to source router

Limitation of split horizon

Suppose link B-C went down.B thinks: (C, inf)A says: (C, 2) to everyone except BD thinks: (C, 3) via AD says: (C, 3)B thinks: (C, 4) via D…

1 1 → inf

Questions?

Lessons from RIP

Bellman-Ford: very simpleBut with many traps and pitfalls…

Guiding principle for using RIP: avoid loops!

Loops can be easily formed, however.Backup linksGuiding principle can be easily forgotten

• OMG!

A better alternative: link state routing.

Link-State Routing

Link-state routing

Collect router and link information→ Directed graph: router as a node, link as an arc

… then create link state database (LSDB)• A network map that collects link state information

Based on LSDB, calculate the shortest path with the Dijkstra’s shortest path algorithm

Time complexity: O(N2)• Can be further optimized by improved data structure

A high level view of link-state routing

Router

LSDB RIBDijkstra

directed graph shortest path tree

fragments ofdirected graph

Graph representation of routers and links

A more complexnetwork

and its directed graphrepresentation

Shortest path tree;rooted at RT6

Questions?

From directed graph to shortest-path trees:Dijkstra Algorithm

Initially,ds ← 0dj ← csj (for every j ∈ V – {s})P ← {s}

Find the next closest node:di ← minj ∈ V – P {dj}P ← P ∪ {i}

Update labels:dk ← mink ∈ V – P {dk, di + cik}

Terminal condition:P = V

V: all routers, s: starting router, cik: link cost between “i” and “k”,dj: least cost between “s” to “j”, P: router with least cost determined

Interconnections p.223

Pros and Cons of Link-State Routing

Traffic increases in proportion to the number of links and routersStorage complexity increases in proportion to the number of links and routersTime complexity: lower than distance vector routing

Convergence time: must be short, for transient loop issueCounting to infinity doesn’t happen(read: fewer traps and pitfalls)Flexible configuration of link cost is possible(no nonsense like 16 = infinity)

OSPF: Open Shortest Path First

The link state routing protocol for the InternetOSPFv2 (IPv4), OSPFv3 (IPv6)

FunctionsRecognize neighbor routerExchange link state information and create LSDBCalculate shortest path tree (spanning tree)+ Designated Router, Backup Designated Router+ Hierarchical structure by area+ Collaboration with EGP

RFC 2328, 5340

Discovering neighbor routers with OSPF Hello

Discover neighbor router on the same link• send Hello packet to 224.0.0.5, ff02::5 (AllSPFRouters)

List of neighbor routers in Hello packet• check bidirectional communication

（select designated router and backup designated router）

Send Hello packet periodically to detect link downkeeps pinging, as in ICMP

Information exchangeamong routersNeighbor → AdjacentRouters don’t exchange routing information unless they are adjacent

Formation process:Hello → NeighborSynchronize each LSDBSynchronized→ Adjacent

Topology Representation in OSPF

LSA (Link State Advertisement)• Type 1: Router LSA• Type 2: Network LSA• Type 3: Summary LSA (network)• Type 4: Summary LSA (AS boundary)• Type 5: AS External LSA

LSA common header• Validity period and sequence number in LSA header• Helps routers to tell if given LSA is fresh

Questions?

Summary

Gateway Model Revisited

Input interfaces Output interfaces

Multiple RIBs

Routing softwareTopology info,Link status info

Topology info,Link status info

Summary

Routing system: design space, characterization

Distance vector routingBellman-Ford algorithmRIP protocol, information modelTraps and pitfalls

Link state routingGraph and its spanning treesDijkstra algorithmOSPF protocol, algorithm, information model

Assignment 4

Replicate the MANDARA network in GNS3Routers basic configuration (name, IP address…)Configure RIP between the routers located in the same graduate school or division.Configure OSPF between the main routersSave the project, compress the project folderReport format: [name]-[studentID].zipSubmit to: network1-2017 _at_ is.naist.jpDeadline: May 10, 2017 by 17:00 (Wednesday)

Assignment 4 (Mandara Network)

Information Network 1 Routing (1) - NAIST · 2. send my distance vectors to all neighbor routers 3....

Documents

Transcript of Information Network 1 Routing (1) - NAIST · 2. send my distance vectors to all neighbor routers 3....

Describing Motion Verbally with Distance and Displacement€¦ · displacement, distance, rate, speed, velocity, and acceleration. Vectors vs. Scalars 1. Most of the quantities used

Chapter 3 Euclidean Vector Spaces Vectors in n-space Norm, Dot Product, and Distance in n-space Orthogonality .

Computer Networks · Routing Information Protocol (RIP) •Distance vector protocol •Nodes send distance vectors every 30 seconds •… or, when an update causes a change in routing

Chapter 3 Vectors in n-space Norm, Dot Product, and Distance in n-space Orthogonality.

Chapter 3 : Vectors - Introduction - Addition of Vectors - Subtraction of Vectors - Scalar Multiplication of Vectors - Components of Vectors - Magnitude.

Force and Motion Learning Goals: -Differentiate between scalars (distance, speed) and vectors (displacement, velocity) -Explain the relationship between.

Scalar & Vector Quantities · Scalars Distance ... Vectors Displacement ... The little arrow on top of the symbols is called a vector arrow.It is used to distinguish between distance

Vectors - wiley.com · Introduction to vectors A scalar quantity is one that is specified by size, or magnitude, only. Distance is an example of a scalar quantity; it needs only a

Information Network I Web 2 - NAIST

2022 - NAIST

Glove: Global Vectors for Word Representation · Most word vector methods rely on the distance or angle between pairs of word vectors as the pri-mary method for evaluating the intrinsic

Vectors. 2 Scalars and Vectors A scalar is a single number that represents a magnitude –E.g. distance, mass, speed, temperature, etc. A vector is a set.

Summary Notes · SCALARS VECTORS distance speed mass energy time displacement velocity acceleration force momentum 5 km N 10 N Vectors are represented in magnitude (scaled) and direction

Chapter 3 Vectors. Vectors and Scalars A Scalar is a physical quantity with magnitude (and units). Examples: Temperature, Pressure, Distance, Speed.

Distance Correlation for Vectors: A SAS Macro · PDF fileCreative Commons Attribution 4.0 International License. ... Here we present a Base SAS® macro to compute distance correlation

1 Bot-network detection NAIST Mitsuaki Akiyama, Takanori Kawamoto Teruaki Yokoyama.

Vectors - Shortest distances (1) Shortest distance from a ...€¦ · Vectors - Shortest distances (14 pages; 4/8/18) (1) Shortest distance from a point to a plane (See "Vectors -

Lesson Vectors Review Scalars vs Vectors Scalars have magnitude only Distance, speed, time, mass Vectors have both magnitude and direction displacement,

Introduction to Vectors. Vectors ScalarsVectors Distance Time Mass Work Energy Speed Displacement Velocity Acceleration Force Momentum Torque Magnitude.

NAIST Outgrow your limits NAIST Tokyo Oﬃce from Nara, Japan. · Outgrow your limits from Nara, Japan. A Japanese ... big-data era that will support sustainable ... Bio-Process Engineering