COM SCI 216 · CS 216Network Algorithmics
Computer Science · 4 units · Graduate courses (200-299)
Introduction to algorithms for routers and servers. Models of network devices and hardware design. Principles for efficient implementation. Lookup algorithms (exact match, prefix lookups, packet classification), fair queuing implementations, crossbar and scalable switches, with examples from well-known networking devices. Advanced topics include traffic measurement and network security.
Letter grading.
When it runs
- Spring 2026
- Spring 2027
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
Official UCLA wording
Requisite: course 211. Recommended preparation: one course on networks.
BruinTree reads · Prerequisite
confidence 1.00 · from UCLA’s structured dataBruinTree reads · Recommended
needs reviewconfidence 0.00 · from textBruinTree could not read this requirement — see UCLA’s wording above.
- · could not read "one course on networks" (no course number found)
- · no course reference could be read from this requisite
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 216
- COM SCI 211Network Protocol and Systems Software Design for Wireless and Mobile
- COM SCI 118Computer Network Fundamentals
1 direct requisite. Showing 3 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.