Teaching materials - Planning and Management of Communication Networks

Description: This undergraduate course aims to provide the students the fundamentals of network management and network planning. Net2Plan is used as a tool to assist the network planning part of the course. Within this part, students learn how to create and use algorithms, for solving network planning problems, with special focus on planning networks with recovery schemes (network protection / restoration). First, students learn some fundamentals on the theory of problem and algorithm complexity. Then, students learn how to design heuristic algorithms for classical network planning and traffic engineering problems, which have been shown to be NP-complete: i.e. node location, topology design, planning of protection and restoration routes, OSPF weight engineering. Heuristic techniques reviewed are: local search algorithms, greedy algorithms, simulated annealing, tabu search, evolutionary algorithms, GRASP and ant-colony optimization algorithms. With Net2Plan, students are able to fast prototype, test and compare their algorithm proposals.

Year: 3

Credits: 7.5 ECTS credits

Degree: Grado en Ingeniería Telemática (4 years, 240 ECTS credits)

University: Universidad Politécnica de Cartagena

Full-course details can be found here.