Computer Networks · TEE · formulas

Host sizing, VLSM and aggregation

All formulas and rules in one place

Core units, ALOHA, address and routing rules; illustrative values are practice

2^h-2\geq H

H requested usable hosts. Smallest sufficient h gives smallest ordinary subnet.

2^s\geq K,\quad p_{new}=p_{old}+s

K equal subnets required; s borrowed bits. Do not subtract two from modern subnet count.

p=32-\log_2(N)

For a power-of-two total address requirement, subject to boundary alignment.

Learn it with complete solutions