# Host sizing, VLSM and aggregation

Subject: Computer Networks

Exam: TEE

Reader: https://deep-learning-study-room.vercel.app/cn/#tee/formulas/formulas/design

Canonical: https://deep-learning-study-room.vercel.app/read/cn/tee/formulas/formulas--design/

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

[Three full VLSM designs](https://deep-learning-study-room.vercel.app/read/cn/tee/read/cidr--vlsm-1/)