K-INFO
HU
EN
Login

Modeling Seminar for Engineers

Mérnöki modellalkotás - az elmélettől a gyakorlatig
A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
Subject name (Hungarian, English)
Mérnöki modellalkotás - az elmélettől a gyakorlatig
Modeling Seminar for Engineers
Subject code BMEVITMMA03
Subject type
Training Level
Course types and hours (weekly/semester)
Course type lecture tutorial laboratory
hours (weekly) 2 1 0
type (linked/independent) derived course
Assessment type vizsga
Credits 4
Subject coordinator
DR. Babarczi Péter
position: egyetemi docens
Responsible department
Távközlési és Mesterséges Intelligencia Tanszék
Faculty Villamosmérnöki és Informatikai Kar
Subject website http://www.tmit.bme.hu/vitmma03
Primary curriculum type
Direct prerequisites – Strong prerequisite none
Direct prerequisites – Weak prerequisite none
Direct prerequisites – Parallel prerequisite none
Direct prerequisites – Milestone prerequisite none
Direct prerequisites – Exclusion none

Objectives

Programme

·         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

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.

Learning outcomes

Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:

Knowledge

No learning outcomes recorded.

Skills

No learning outcomes recorded.

Attitudes

No learning outcomes recorded.

Autonomy and responsibility

No learning outcomes recorded.

Oktatási módszertan

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.

Tanulástámogató anyagok

Online források
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;  

Recommended preliminary knowledge for completing the subject

Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
Algorithms, theory of computing
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
Algorithms, theory of computing
General rules
Requirements: a)      Lecture period: preparing home works b)      Exam period: written and oral exam
Assessment methods
In-term assessments

No detailed assessments provided.

Weight of in-term assessments

No weights provided.

Exam-period assessments

No detailed assessments provided.

Weight of exam elements

No weights provided.

Grade calculation

No grade thresholds provided.

Attendance requirements

No attendance requirements provided.

Rules for retake and resubmission

Not provided.

Short description

Not provided.

Detailed description

Not provided.

Recommended courses

Not provided.

Workload to complete the subject

No workload breakdown provided.

Validity of subject requirements
Requirements valid from:
Requirements valid until:
Curriculum placement

No curriculum placements recorded for this subject version.