K-INFO
HU
EN
Login

Modeling Seminar for Engineers

Mérnöki modellalkotás szeminárium
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 szeminárium
Modeling Seminar for Engineers
Subject code BMEVITMD099
Subject type
Training Level
Course types and hours (weekly/semester)
Course type lecture tutorial laboratory
hours (weekly) 4 0 0
type (linked/independent)
Assessment type vizsga
Credits 5
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
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
  • Network science 

  • Introducing mathematical models for real-world networks, important structural characteristics, measures and the effect of these parameters on performance and resilience 

  • Classical models and networks (e.g.: small-world, Erdős-Rényi, Barabási-Albert, hyperbolic), their properties and applicability 

  • Statistical multiplexing and bandwidth estimation 

  • Classical queuing theory systems: incoming packets (from aggregated traffic flows), buffering, modelling servers for modern VoIP codecs 

  • Using network calculus to simplify the previous involved queuing theory models, modelling and analyse the aggregate speed of on-off flows  

  • Efficient bandwidth utilization with network coding 

  • Bandwidth allocation for networks with algebraic operations, efficient multicast bandwidth utilization, introduction to robust routing and other classical examples 

  • Demonstrating the description power of different mathematical models for network coding, message coding and decoding over finite fields 

  • Virtual network design 

  • Practical implementations of virtual networks over physical infrastructures (cloud computing, resource allocation, virtual SDN topology embedding, etc.) 

  • Efficient resource allocation for virtual networks, intelligent virtual node and link embedding to physical resources, robust path design solutions 

  • IP forwarding and compressed data structures 

  • Introduction to IP addressing, IP forwarding, scalability issues and the possible engineering solutions for them 

  • Prefix-tree compression, information-theoretic bounds, efficient lookup on compressed data structures 

In this course we introduce the most important engineering challenges of infocommunication networks and their design questions ranging from small networks to the Internet core. The students can learn the mathematical models of different engineering problems, which they can try themselves on small examples during the course. Through coding examples, the theoretical models can be realized in practice. Using different coding platforms, they can compare their solutions with each other, improve and deepen their algorithmic knowledge learned during their previous studies by applying them to the examples of Internet traffic-, topology-, routing- and bandwidth-design. 

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

Lectures. 

Tanulástámogató anyagok

Online források
We give the necessary literature for each topic and make further learning material available on the lecture’s website. 

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)
Introduction to the Theory of Computing, Theory of Algorithms
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)
Introduction to the Theory of Computing, Theory of Algorithms
General rules
Requirements: Lecture Period: homework assignments belong to each topic, which should be solved at least on a sufficient level for the signature.  Exam period: Oral exam  Additional possibilities: One homework assignment can be submitted late on the week of repeats. 
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
No pre-requisites. 
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.