 שנה"ל תשע"ו | |||||||||||||||||||||||||
 |
 |
||||||||||||||||||||||||
|
תכנון אלגוריתמי לרשתות
|
0368-3172-01 | ||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| מדעים מדויקים | |||||||||||||||||||||||||
| |||||||||||||||||||||||||
ש"ס: 3.0
Course description
Course Description
This course covers the principles and algorithms that arise in Networking, mainly in packet switches and routers, but also in endpoint web servers. We will discuss the theory and practice of algorithms for packet forwarding and classification, switch scheduling, traffic shaping, bandwidth partitioning, buffer management, network monitoring, traffic measurement, security and congestion control, as well as OS optimizations in endpoint servers regarding memory management and transfer control.
The Course closely follows the textbook "Network Algorithmics" by George Varghese, which merges practical considerations in algorithm development, such as optimizing bottlenecks rather that general time/space complexity, processing data in line speed, relaxing requirements to simplify solutions, and more.
Grading
Several written assignments will be given as homework. The exact number will be announced at the beginning of the Semester. The final grade will be approximately 20-30% assignments and 70-80% final exam.
Teaching Staff
Dr. Nir Andelman, nira@afeka.ac.il