In this semester, the syllabus will put a major emphasis on so-called network algorithmics (a.k.a.
router/switch architectures and algorithms).
We will study
and protocols used by modern routers/switches to perform data plane
functions including forwarding, address/prefix lookups, switching,
flow classification, flow monitoring and measurement, IP traceback and
other security functions. In other words, we will study almost
everything about a router/switch except routing, which is a control
plane function and out of the scope of this course.
The pre-requisite for this course is CS 4251 here or equivalent
(An undergarudate networking course that covers OSI/ISO 7 layers and
TCP/IP will suffice). This is a very heavy course
because I will cover advanced algorithm techniques and will NOT have
time to refresh you on undergraduate
algorithms and data
structures. Whenever necessary, students are expected to
the gap on their own.
course includes a special homework assignment (see below).
Every student MUST fill in the course survey form and print out
and submit the "receipt page".
IEEE Transacting on Networking, 1993. (We
will talk about
Theorems 1 in class) WF2Q :
Worst-case Fair Weighted Fair Queueing.
J. Bennett, H. Zhang
IEEE Infocom, 1996. (We will talk about the scheduler and its
equivalence to WFQ under certain traffic conditions)
Each student is required to design a nontrivial exercise problem
(typically related to the content of the lecture he or she scribes)
that has the same level of sophistication as the example problems I are
going to show you in class. You need only to design one and have
almost a whole semester to do it so I expect it to be of high
quality. You will learn a lot from designing just a high-quality
exercise problem. Needless to say, you also have to type up the
solution. Please submit both the source and the PDF files via
T-square. Please include your full name and your GTID.
All work for this class is to be done
individually. You are strongly urged to familiarize yourselves with the
Honor Code rules.
Specifically, the following is not allowed:
Copying, with or without modification, someone else's work
when this work is not meant to be publicly accessible (e.g., a
classmate's program or solution).
Submission of material that is wholly or substantially
identical to that created or published by another person or persons,
without adequate credit notations indicating authorship (plagiarism).
You are encouraged to discuss problems and papers with others as long
as this does not involve copying of code or solutions. Any public
material that you use (open-source software, help from a text, or
substantial help from a friend, etc...) should be acknowledged
explicitly in anything you submit to us. If you have any doubt about
whether something is legal or not please do check with the class
Instructor or the TA.
No late speical or regular homework assignments will be accepted
beyond two lenient days total for the entire semester.
The deadline for each homework assignment will be correctly specified
in T-square except the scribe notes, which is due one week after the