Computer Networking: A Top Down Approach - Chapter 4 Network Layer: The Data Plane

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/25

flashcard set

Earn XP

Description and Tags

Flashcards covering vocabulary terms related to the data plane and network layer concepts.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

26 Terms

1
New cards

Move packets from router’s input to appropriate router output

Forwarding

2
New cards

Determine route taken by packets from source to destination

Routing

3
New cards

Local, per-router function that determines how a datagram arriving on a router input port is forwarded to a router output port.

Data Plane

4
New cards

Network-wide logic that determines how a datagram is routed among routers along end-to-end path from source host to destination host.

Control Plane

5
New cards

Using header field values, lookup output port using forwarding table in input port memory (“match plus action”).

Decentralized Switching

6
New cards

Forward based only on destination IP address (traditional)

Destination-based Forwarding

7
New cards

Forward based on any set of header field values

Generalized Forwarding

8
New cards

When looking for forwarding table entry for given destination address, use longest address prefix that matches destination address.

Longest Prefix Matching

9
New cards

Rate at which packets can be transfer from inputs to outputs

Switching Rate

10
New cards

Queued datagram at front of queue prevents others in queue from moving forward

Head-of-the-Line (HOL) Blocking

11
New cards

Send in order of arrival to queue

FIFO (First In First Out) Scheduling

12
New cards

Drop arriving packet

Tail Drop

13
New cards

Send highest priority queued packet

Priority Scheduling

14
New cards

Cyclically scan class queues, sending one complete packet from each class (if available)

Round Robin (RR) Scheduling

15
New cards

Each class gets weighted amount of service in each cycle

Weighted Fair Queuing (WFQ)

16
New cards

Largest possible link-level frame

MTU (Max. Transfer Size)

17
New cards

32-bit identifier for host, router interface

IP Address

18
New cards

Connection between host/router and physical link

Interface

19
New cards

Device interfaces with same subnet part of IP address; can physically reach each other without intervening router

Subnet

20
New cards

Subnet portion of address of arbitrary length

CIDR (Classless InterDomain Routing)

21
New cards

Dynamically get address from server, “plug-and-play”

DHCP (Dynamic Host Configuration Protocol)

22
New cards

Replace (source IP address, port #) of every outgoing datagram to (NAT IP address, new port #)

NAT (Network Address Translation)

23
New cards

Identify priority among datagrams in flow

Priority (IPv6)

24
New cards

Identify datagrams in same “flow.”

Flow Label (IPv6)

25
New cards

IPv6 datagram carried as payload in IPv4 datagram among IPv4 routers

Tunneling

26
New cards

Simple packet-handling rules

Generalized Forwarding