Aims and learning outcomes
The course is an intergrated course mixing 5 credits of "Communication network design" and 5 credits of "Foundations of operations research". Both courses are intended to provide the theretical and mathematical basis needed for telecommunication network design.
While "Foundation of operations research" is a more methodological course which emphasizes the operations research tools to be employed in network design, "communication network design" offers an overview of different practical network design problems and of the application of mathematical tools for their solution.
Communication network design
The course is intended to provide students with the knowledge and tools necessary to design and plan communication networks. The first part of the course focuses on optical networks: different segments of networks (access, metro and core) are taken into consideration. Design approaches base on mathematical modeling (integer linear programming) and heuristic approaches are discussed. In the second part of the course, traffic theory will be developed for the design of circuit switching networks, and specifically to solve capacity and flow assignment problems and to investigate advanced methodologies for traffic modeling. Specific case studies will be developed to provide examples of the different design approaches.
Foundations of operations research
The course will present some basic methodologies of the Operations Research (OR) focusing in particular on models and algorithms arising from computer science and engineering applications. The Operations Research deals with quantitative methods applied to decision processes, and it is of utmost importance in the study of complex systems. The course will introduce also the use of commercial software for solving optimization problems.
Syllabus
Communication network design
1 – Introduction on Optical Networks
Optical networking principles and challenges: telecom network overview, business models, traffic engineering vs network engineering vs network design, Wavelength Division Multiplexing (WDM), WDM Evolution. Enabling Technologies: optical fiber, optical transmitters, optical receivers, optical amplifiers, switching elements.Optical metro and access network: challenges in access and metro networks, overview of PON technologies (EPON, GPON, WDMPON, NGPON2), overview of metro networks (Gigabit Ethernet, SONET/SDH, RPR, Metro Ethernet).
2 – Exact and Heuristic (Optical Core) Network design methodologies
Network design based on mathematical modelling: flow formulation, route formulation. Modelling of network protection: dedicated protection, shared protection. Network design by heuristic approaches: greedy, local search. Net2Plan: a free and opensource Java tool for the design of communication networks
3 – Protection techniques
Network survivability: objectives and protection techniques. Singlelayer and multilayer protection techniques: protection at IP layer, protection at physical layer. Protection techniques in SONET/SDH: line and section protection, pointtopoint and ring structures, dedicated and shared protection. Protection in the optical layer: solutions for ring networks and for mesh network, dedicatedvsshared protection, ring cover and pcycle techniques.
5 – Capacity and Traffic Flow Assignment Problems in Communication Networks
Queueing theory primer: Markov, birth death and Poisson process. Delay analysis, the capacity assignment problem, the traffic flow assignment problem, the capacity and flow assignment problem.
6 – Design of circuit switching networks
Introduction: Network and communication services: network types and performance targets. Traffic modeling: definition and properties. Source model: single and multiple source. Analysis of multipleserver system with assumption LCC, LCH, LCR. Evaluation of congestion and statistics of carried/lost traffic. Voice network structure and routing techniques. Dimensioning of overflow trunk: Wilkinson, Fredericks and Lindberger approaches.
Foundations of operation research
1. Introduction to OR Optimization problems and their formulations; decision variables, objective function, constraints. Modeling techniques 2. Graphs and network flows problems Spanning trees, Shortest paths, maximum flow, minimum cost flow, assignments. Solution algorithms and their complexity analisys 3. Linear programming Duality theory, pairs of dual problems, complementary slackness, the simplex method; geometrical and economical interpretation. Basic solutions and optimality conditions. 4. Integer linear programming and combinatorial optimization Discrete optimization problems: formulations. Relaxations and branch and bound algorithm. Some applications. Heuristic algorithms: greedy and local search. 5. Applications of OR in computer science and telecommunications: Routing, scheduling, location.
More detailed information is available at http://home.dei.polimi.it/malucell/didattica/FROMI/FRO.html
