Catalog Data: (3 Credits) Principles of computer networks design, network design algorithms, centralized network design, concentrator and switching node location problems. Application of minimum spanning tree and shortest path algorithms to problems in network design. Static and dynamic routing algorithms. Network reliability analysis. Linear and integer programming techniques. Distributed network design, case studies.

Textbooks:
- Aaron Kershenbaum, "Telecommunications Network Design Algorithms", Mc Graw Hill, 1993. Paperback copy - ISBN: 0071125183
Auxiliary Textbook:
- David W. Corne, et al., "Telecommunications Optimization: Heuristic and Adaptive Techniques", Wiley, 2000. ISBN: 0-471-98855-3
- Robert Lloyd-Evans, "Wide Area Network Performance and Optimization", Addison-Wesley, 1996.
- William Stallings, "High Speed Networks, TCP/IP and ATM Design Principles", Prentice-Hall, 1998. ISBN: 0-13-525965-7

Instructor: Cem Ersoy, Office: ETA 208, Ext. 1861, E-mail: ersoy@boun.edu.tr

Teaching Assistant:

Time and Place: Tuesday 9:00-11:50 in ETA Z09

Prerequisites : (CmpE 224 or equivalent) and (CmpE 475 or CmpE 580 or equivalent)

Topics:

1. Introduction
2. Brief review of analysis of loss and delay models
3. Modeling networks as graphs
4. Fundamental graph algorithms (remembered)
5. Centralized network design, terminal assignment and concentrator location problems
6. Internet routing and routing algorithms
7. Mesh topology optimization
8. Network reliability
9. High Speed Network Planning and Design
10. Multimedia network design
11. Wireless network design
12. Case studies on telecommunications optimization by: Heuristics, linear and integer programming, evolutionary algorithms, simulated annealing, neural networks

Homeworks : May require developing algorithms or using a network design tool supplied by the instructor.

Project: A programming project on the topological design of data networks. At the end of the project, the problem, the solution technique and results will be presented. Each presentation will last for 20+5 minutes. You are supposed to use an overhead projector or a datashow.

Presentation Dates: May 14th, May 21nd, May 28th:

Computer Usage:
1. Using C compilers and word processors for completing the programming project
2. Estimated computer usage: 60 hours/student/semester including editing

Grading:
Homeworks (required) 5%
Project (due 31 May 2002) and its presentation 50% (35% + 15% presentation)
Take Home Midterm Due Date: (10 May 2002) 15%
Final (   June 2002) 30%