5-Naming, Addressing & Forwarding Flashcards

1
Q

IP Addressing or “dotted quad”

A

32-bit number or 2^32 = 4294967296

32/4 = 8 bits each

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Pre-1994: Classful” Addressing

A

Addresses were divided into 2 portions

1) Network ID portion
2) Host ID portion

Class A |0Net ID (8 bits) |Host ID (2^24 bits) | Class B |10|Net ID (2^14 bits) |Host ID (2^16 bits) |
Class C |110|Net ID (24 bits) |Host ID (8 bits) |

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

IP Address Allocation

A

IANA (Internet Assign Numbers Authority) -> has authority to allocate address space
Regional Routing Registries: AFRINIC (Africa), APNIC (Aisia and Austraila), ARIN (North America), LACNIC (Latin america) , RIPE (Europe)
ARIN-> allocates address space to individual networks like GAtech

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

IANA recently allocated all /8 address blocks

A

Out of IPv4 addresses! Doesn’t mean that you can no longer attach a new device to the internet (there are other ways of coping)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Query an IP Address

A

whois -> tells you the owner and gives contact email of that particular prefix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Adopted in 1994: 32 bits: IP address + “mask”

A

CIDR - Classless Interdomain Routing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Longest Prefix Match

A

If a routing table has 2 overlapping entries, it should forward according to the entry that has the longest prefix/mask length (the prefix with longer mask length is more specific than the prefix with shorter mask or the larger prefix)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The benefits of CIDR and Longest Matching Prefix

A

Efficiency, Hierarchy /aggregation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The practice of connecting a host or a computer network to more than one network. This can be done in order to increase reliability or performance.

A

Multihoming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Frustrates Aggregation

A

Multihoming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Can be used to control inbound traffic

A

Longest Prefix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Link aggregation

A

Link aggregation (LAG) is used to describe various methods for using multiple parallel network connections to increase throughput beyond the limit that one link (one connection) can achieve

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How many IP addresses in a /22 prefix?

A

2^10 or 1024

The /22 represents the length of the network ID.
The remaining 10 bits are for hosts on that /22 prefix.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

IPv4 and IPv6 lookup algoritms

A

Mechanism: Longest Prefix Match
Techniques: Radix Trie
Compressed trie
Binary search on prefix intervals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Alternative to LPM or longest prefix match: exact match

A

Address lookup using tries

LPM is horribly innefficient and wasteful of memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Prefixes are “spelled out” by following path from root

A

In a Trie (Bit 1 takes us to the right and bit 0 takes us to the left)

17
Q

During a lookup, if the entry isn’t there, use entry of last node of tree we traversed.

A

“Single -bit trie”

Can be bad… 32 accesses in the worst case.

18
Q

Inefficient use of memory

A

Direct trie

remember the diagram with 2 memory accesses and the quiz with 3 memory accesses

19
Q

How many entries for a /20 prefix?

A

16

20
Q

To achieve the memory efficiency of a single-bit trie with the fast lookup properties of a direct trie… a compromise is to use a ……

A

Multi-bit Trie (aka Multi-ary-trie)

21
Q

Saves space by pushing entries to the left and right side of the node

A

“Leaf-pushed” trie

Lulea is a 3-level trie
Patricia is another algorithm

22
Q

A hardware based route lookup where the input is a tag and the output is a value

A

CAM = Content addressable Memory

Ternary CAM supports a wildcard -> permits implementation of LPM (Longest prefix match)

23
Q

possible solutions to the IPv4 problem?

A

NAT - Network Address Transalation

IPv6 (128 bit addresses)

24
Q

allows multiple networks to reuse the same private IP address space by translating them to a globally visible IP address.

A

NAT

25
Q

Popular on Broadband access networks, SOHO (small or home offices), VPNs… this violates the end to end model

A

NAT

26
Q

10/8

  1. 16/12
  2. 168/16
A

(10. 0.0.0 through 10.255.255.255)
(172. 16.0.0 through 172.31.255.255)
(192. 168.0.0 through 192.168.255.255)

27
Q

IPv6

A

128 bits:
Top 48 bits: Public Routing Topology (3 bits for aggregation, 13: tier 1 ISP, 8 reserved, 24 additional)
16-bit site identifier
64 bit: interface ID (48 bit ethernet + 16 more bits)

28
Q

IPv6 benefits

A

More addresses
Simpler header
Multihoming is easier
Security (IPv6 crypto extentions)

29
Q

IPv6 hardships

A

Hard to deploy incrementally!

The narrow waist -> so many things are built on this topology

30
Q

Host can speak both IPv4 and IPv6

A

Dual stack host

31
Q

A v6 packet is encapsulated in a v4 packet

A

v6 to 4 tunneling (requires gateway boundaries to perform encapsulation and decapsulation when ntering and leaving)