5 Naming, Addressing, and Forwarding Flashcards
Name the mechanism and techniques for MPLS, Ethernet, and ATM Protocols
Mechanism: Exact Match
Techniques: Direct Lookup, Associative lookup, hashing, binary tree
+ Simple
+ O(1)
- Insufficient use of memory
Name the mechanism and techniques for IPv4 and IPv6 protocols
Mechanism: Longer Prefix Match
Techniques: Radix Trie, Compressed Trie, Binary Search on prefix int.
LPM harder than exact match. Dest. IP does not indicate length
Trie
prefixes “spelled out” by following path from root
Single Bit Trie
very efficient, efficient use of memory.
Main problem is the number of memory access required to perform a lookup.
At worst 32 accesses.
Direct Trie
Instead of 1 bit per lookup, there is one memory access responsible for looking at a large number of bits
inefficient use of memory
Multi-bit Trie (“Multi-Ary Trie”)
memory efficiency of a single bit trie + fast lookup properties of a direct trie
Content-Addressable Memory (CAM)
Alternative to LPM w/Tries
input: tag (address)
output: value (port)
exact match O(1)
Ternary CAM
Instead of exact match (0,1,*), permits implementation of LPM
Solutions to IPv4 running out of addresses
- Network Address Translation (NAT)
- IPv6 (128-bit addresses)
Network Address Translation (NAT)
Multiple networks can reuse the same private IP address space
IPv6
simpler header and addresses that are much larger (more bits)
multihoming is easier
security
Name incremental deployments for IPv6 (Issue is that IPv6 results in significant incompatibility)
“Dual Stack” deployment - host speaks both IPv4 and IPv6
Relies on a translator
v6 to 4 tunneling - encapsulation/decapsulation of packets