CSE 4344/5344 – Computer Networks Exam Review Vocabulary

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

1/29

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering key concepts, terms, and facts from the Computer Networks exam-review notes.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

30 Terms

1
New cards

IP Fragmentation

Process of breaking a large IP datagram into smaller fragments so that each fits within the Maximum Transmission Unit (MTU) of a link.

2
New cards

Datagram (IP)

The basic, self-contained unit of data transfer in the Internet Protocol; contains header and payload and is routed independently.

3
New cards

Maximum Transmission Unit (MTU)

The largest packet size that can be sent across a network link without needing fragmentation.

4
New cards

Network ID

Portion of an IP address where all host bits are 0; identifies the network itself.

5
New cards

Broadcast ID

Address in which all host bits are 1 within a subnet; used to reach every host on that subnet.

6
New cards

Distance-Vector Routing Algorithm

Distributed routing method where each router advertises its distance vector to neighbors and updates routes based on neighbors’ vectors.

7
New cards

Periodic Update (DV)

Feature of Distance-Vector routing whereby a router sends its routing table to neighbors at regular intervals even if no change occurred.

8
New cards

Link-State Routing Algorithm

Routing method in which every router floods link-state information, builds a complete network map, and runs Dijkstra to compute shortest paths.

9
New cards

Router Interface Broadcasting (Myth)

Incorrect idea that a router blindly forwards an incoming packet out all other interfaces; proper routers forward only to the chosen next hop.

10
New cards

Scheduling Algorithm – Priority

Packet-scheduler that serves queues in strict order of priority levels; higher priority packets transmit first.

11
New cards

Scheduling Algorithm – Round Robin

Scheduler that services each active queue in cyclic order, giving equal transmission opportunity per round.

12
New cards

Scheduling Algorithm – Weighted Fair Queueing (WFQ)

Fair-share scheduler that allocates bandwidth to queues proportionally to assigned weights.

13
New cards

Scheduling Algorithm – FIFO

First-In, First-Out queuing discipline; packets exit in the same order they arrive.

14
New cards

Class A Address Range

1.0.0.0 – 126.255.255.255 with default mask 255.0.0.0 (/8).

15
New cards

Class B Address Range

128.0.0.0 – 191.255.255.255 with default mask 255.255.0.0 (/16).

16
New cards

Class C Address Range

192.0.0.0 – 223.255.255.255 with default mask 255.255.255.0 (/24).

17
New cards

Smallest Host Capacity (Classful)

Class C networks support the fewest hosts (254 usable addresses) among classes A, B, and C.

18
New cards

Largest Network Count (Classful)

Class C provides the greatest number of distinct networks compared with Classes A and B.

19
New cards

Subnet Mask /26

255.255.255.192; leaves 6 bits for hosts, allowing 64 addresses (62 usable hosts) per subnet.

20
New cards

Subnet Mask /27

255.255.255.224; leaves 5 host bits, allowing 32 addresses (30 usable hosts) per subnet.

21
New cards

Broadcast Address Calculation (/29)

For network 192.168.10.0/29, broadcast address is 192.168.10.7 (last address in the 8-address block).

22
New cards

Subnet (Definition)

Group of IP devices sharing the same network prefix so they can communicate without an intermediate router.

23
New cards

Head-of-Line (HOL) Blocking

Situation where the first packet in an input queue prevents later packets from being forwarded even if their output port is free.

24
New cards

Control Plane

Router component responsible for global network logic—computing and installing forwarding tables via routing protocols or SDN controllers.

25
New cards

Data Plane

Router component that locally forwards incoming packets to output ports using the forwarding table (longest prefix match).

26
New cards

Longest Prefix Matching

Lookup strategy in which the routing entry with the most specific (longest) matching prefix is chosen for a packet’s destination IP.

27
New cards

Prefix Forwarding Table

Router table comprising entries of IP prefixes and outgoing interfaces used to forward packets via longest prefix match.

28
New cards

Subnetting (Bit Borrowing)

Technique of taking bits from the host field of an address to create additional network prefixes (subnets).

29
New cards

/22 Network (192.168.0.0/22)

Aggregates four /24 class-C networks; borrowing 3 host bits gives /25 subnets suitable for eight subnets with ≥20 hosts each.

30
New cards

HOL Blocking Impact

Can reduce switch throughput to at most ~58% under certain traffic patterns, motivating crossbar and virtual output queuing designs.