A kötelező előtanulmányi rend az adott szak honlapján és képzési programjában található.

The students will learn the most important engineering challenges and design objectives of communication networks, ranging from small local networks through the core to the Internet. The students will see the most widespread mathematical techniques of modeling the engineering problems in communication networks, and during the course they will learn their application. Through the models the students can apply in practical use cases (e.g., Internet routing, topology, traffic and bandwidth planning) the previously learnt mathematical and algorithmic knowledge form their computer science studies.

·         IP forwarding and compressed data structures

o   IP addressing. IP forwarding, scalability issues

o   Prefix tree compression, information-theoretic bound, lookup on compressed data structures

·         Efficient bandwidth utilization with coding

o   Network bandwidth planning, multicast forwarding

o   Demonstrating the efficiency of mathematical models through a network coding use case

·         Virtual network design

o   Practical implementations of virtual networks over the physical infrastructure (cloud computing, SDN, etc.)

o   Virtual network embedding into the physical topology

·         Internet traffic modeling

o   Introduction into traffic modeling

o  Demonstrating the existence of equivalent formulas on the Internet to the simple Erlang-formula in the telecommunication networks

·         Network dimensioning with network calculus

o   Classical queuing system: incoming (aggregated traffic) packets, buffer, server

o   Simplifying the involved queuing theory models with the application of network calculus

·         Internet traffic engineering

o   Fluid model of the TCP closed loop control, continuous feedback systems, controllers

o  TCP (and newer version) congestion control, network stability analysis, network stability guarantees

Weekly lectures, and practice every second week. The theoretical models shown on the lectures are applied on relevant use cases in the practical lecture. Preparing the home works affect the final grade.

a)      Lecture period: preparing home works

b)      Exam period: written and oral exam

During lectures, or upon request.

For every topic the recommended papers from the literature will be given.

R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. on Networking, vol. 11, no. 5, pp. 782-795, 2003

Bonald, Thomas, and James W. Roberts. "Internet and the Erlang formula." ACM SIGCOMM Computer Communication Review vol. 42 no. 1, pp. 23-30, 2012

Le Boudec, J. Y., Thiran, P. Network calculus: a theory of deterministic queuing systems for the internet (Vol. 2050). Springer. 2001