CSE 5344 – Computer Networks: Quiz 4 Key Concepts

20 vocabulary flashcards covering scheduling, IP addressing, subnetting, routing, and related concepts from the Quiz 4 solution notes.

Round Robin (RR) Scheduling

Packet scheduling discipline where every queue receives an equal share of service time in cyclic order.

Weighted Fair Queuing (WFQ)

Scheduling algorithm that allocates bandwidth proportionally to assigned weights for each packet class, giving unequal but fair service.

MTU (Maximum Transmission Unit)

The largest number of bytes a layer can transmit in a single frame; common Ethernet MTU is 1500 bytes.

IP Fragmentation

Process of breaking a large IP datagram into smaller fragments so each fits within the MTU of the underlying network.

Network ID

Portion of an IP address where all host bits are 0, uniquely identifying a network segment.

Broadcast ID

IP address where all host bits are 1, used to send a packet to every host on the subnet.

Class A IP Address Range

1.0.0.0 to 126.0.0.0, providing few networks but up to ~16 million hosts each.

Class B IP Address Range

128.0.0.0 to 191.255.0.0, balancing number of networks and hosts (~65 k hosts per network).

Class C IP Address Range

192.0.0.0 to 223.255.255.0, offering many networks with up to 254 hosts each.

Host Capacity of IP Classes

Class A supports the maximum hosts per network; Class C supports the minimum.

Network Capacity of IP Classes

Class C provides the largest number of networks; Class A the smallest.

Subnet Mask

32-bit value of contiguous 1s followed by 0s that separates network/subnet bits from host bits in an IP address.

/26 Prefix Length

A subnet mask with 26 leading 1s (255.255.255.192) leaving 6 host bits.

Number of Subnets with /26

Using /26 on a Class C block yields 2^2 = 4 subnets.

Hosts per /26 Subnet

2^6 − 2 = 62 usable host addresses.

Broadcast Address (Subnet)

Highest address in a subnet (all host bits 1); e.g., 192.168.10.63 for the first /26 subnet.

Longest Prefix Matching

Routing rule where the router chooses the forwarding entry with the most specific (longest) matching prefix.

Forwarding Table

Router data structure mapping prefix patterns to output interfaces for packet delivery.

Bellman–Ford Equation

dx(y) = minv { c(x,v) + d_v(y) }, computing least-cost paths in distance-vector routing.

Next Hop

Neighbor router chosen as the first step toward a destination based on lowest computed path cost.