ENEE759J/FALL 1999 INTERCONNECTION NETWORKS Instructor: A. Yavuz Oruç TextBook: Lecture Notes and Research Papers Office Hours: Tuesdays: 1:00-3:00 Classroom: CHM0124 Classtime: MW-2:00:3:15 pm Exam Dates: Homeworks: (50%) Midterm: (20%) Final Exam: (30%) COURSE GOALS AND TOPICS TO BE COVERED This course covers fundamental concepts in interconnection network theory. These include complexity bounds for various types of networks and both explicit and randomized constructions of optimal networks using combinatorial techniques. Here is the list of topics which will be covered in the course. Main Topics Concentrators Superconcentrators Generalizers Permutation networks Generalized connectors Strictly nonblocking networks Optional Topics Circuit switching algorithms Packet routing algorithms Self-routing networks Return to my home page