Communication Network Design
Go to this course in the University Course Planner.
Description
The rapid expansion of communications networks into all aspects of our businesses and lives is one of the defining features of this decade. These networks have cost many billions of dollars, but someone has to build them. If you can reduce the cost of a network design by even a few percent, you can save millions. This course will describe a group of commonly used methods for the design and optimization of communications networks, the main focus being on modern data networks.
Objective
To provide students with the basic principles of optimal network design in addition to a practical extension to their optimization skills and knowledge. At the end of the course the students should be able to analyse the features of a network design problem (the objectives/cost and constraints) with a view to choosing a suitable algorithm for solving the problem and critically interpreting the output.
Content
- Introduction and historical perspective
- Internet design principles
- Network optimization goals
- Network routing
- Network design algorithms
- Network measurements
- Oblivious optimization
Specific algorithms considered include: Dijkstra, Floyd-Warshall, Minoux's greedy method, Branch and bound, Kruskal, Prim, Gomory-Hu, Gusfield, simulated annealing, genetic algorithms and Valiant network design.
|
|
| Year |
Semester |
Level |
Units |
| 2012 |
1 |
4 |
3 |
Delivery
2 lectures per week.
Assessment
75% exam, 10% class exercises, 15% mini-project.
Graduate attributes
Linkage past
No past linkages have been noted.
Linkage present
This subject forms part of several degree courses, for instance: Honours Applied Mathematics, Graduate Certificate in Telecommunication, BE(IT&T).
Linkage future
This is an ideal course for students considering a career or research in computer networking, or more generally in optimization.
Restrictions
None.
Recommended text
Notes are provided.
|
