EE 607: Advanced Network Algorithms
Last updated: Jan 9, 2009
❑ Instructor: Galen H. Sasaki. Email: firstname.lastname@example.org. Tel: 348 9432 (cell). Office: Holmes 436. Office Hours: MW 1:45-2:45. ❑ Days and Times: MW 12:30-1:45pm (May change if we can find a room and days/times) ❑ Room: Holmes 389
❑ Brief Course Description: The course will cover algorithms that are used in network research and implementation. These include graph algorithms, transmission scheduling, traffic management, and control algorithms for certain switch/router architectures. There will be an emphasis on TCP/IP as a case study. See the list of topics below. ❑ Prerequisite: EE 367 (data structures) and knowledge of C programming, or consent of instructor. Knowledge of C programming is required of everyone. Knowledge of undergraduate probability (e.g., EE 342) will be helpful, but not necessary. ❑ Textbooks:
• Stevens, TCP/IP Illustrated, Vol. 1, Addison-Wesley
• Cormen, Leiserson, and Rivest, Introduction to Algorithms, MacGraw Hill. ❑ Grading: Grading will be based on a midterm exam [20%], a final exam [20%], homework [20%], midterm projects [20%], and final project [20%]. ❑ List of topics (there may be some minor changes):
• Overview of the Internet Architecture
▪ Overview of computer commuication, computer networks, and TCP/IP ▪ Packet switching, store-and-forwarding, connection-oriented and connectionless routing, routing tables, and source routing. • Graph Algorithms
▪ Algorithms and their performance.
▪ Graphs, breadth-first-search, spanning trees, minimum weighted spanning trees. ▪ Shortest path problem, Dijkstra and Bellman-Ford algorithms, and applications to networks. ▪ Max-flow problem, Ford-Fulkerson labeling algorithm, max-flow min-cut theorem, applications, bipartite matching, disjoint paths. ▪ NP-Completeness, approximation algorithms, greedy algorithms. ▪...
Please join StudyMode to read the full document