Lecture 8 - Routing

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/16

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

17 Terms

1
New cards

Routers

Direct packets of data where they need to go, hop by hop

2
New cards

Routing

The action of selecting paths along which to send data

3
New cards

Every ISP forms a …

Domain, called an Autonomounous System (AS). Has Inter-As and Intra-AS.

4
New cards

Cruicial Features of Routing

  1. Addressing

  2. Routing

    1.  Forwarding

5
New cards

IP Address

Internet Protocol Access, Decimal numbers separated by dots

6
New cards

IP Address Length

IPv4: 32 bits (8 bits a number)

IPv6: 128 bits

7
New cards

IP Prefix

Indicates the device’s subnet, denoted with a forward slash  

8
New cards

Host Indentifier

Indicates host within subnet, comes after the prefix

9
New cards

DHCP

Dynamic Host Configuration Protocol, keeps track of which addresses are unused, typically in a local network. After finite time, address is either renewed or released.

10
New cards

NAT

Network Address Translation Router, translates back and forth.

Address in local network that may be different than address in public Internet.

11
New cards

Intra-AS

Metric based, find shortest path. Uses Routing Information Protocol (RIP)

Open Shortest Path First (OSPF)

12
New cards

Inter-AS

Policy based, go through cheapest ISPs. Border Gateway Protocol (BGP)

13
New cards

Forwarding Method

Implements the routing policy one hop at a time..Whe

14
New cards

n a packet arrives at a router’s input port…

It examines the destination IP and then the routing table tells it which port to send the packet out.

15
New cards

Shortest Path Problem

Trying to find the path with the smallest cost from one node to another.

16
New cards

Bellman-Ford

Used to find the shortest cost path and is iterative, used in the original ARPANET

17
New cards

Message Passing

Short, local interaction: neighbor to neighbor. Local view: each router only knows next hop, nothing beyond that.

Explore top flashcards