Information Networks

Data is displayed for academic year: 2023./2024.

Course Description

Modelling of the information flow processes in conventional and high-speed communication networks. Develops and utilizes elementary concepts from queueing theory, algorithms, linear and nonlinear programming to study the problems of line and network protocols, distributed algorithms, quasi-static and dynamic routing, congestion control, deadlock prevention. Treats local, access and core networks, and high-speed electronic and optical networks. Queueing theory application for analyses of information processing performances.

Study Programmes

University graduate
[FER2-HR] Telecommunication and Informatics - profile
(1. semester)

General Competencies

Students will gain knowledge abut information networks, including information flow modelling and queuing theory, with special emphasis on network performance evaluation, information processing performance and basic network algorithms. They will have practical knowledge and skills required for dimensioning network capacities and trafic flows, as well as solving network topology problems.

Learning Outcomes

  1. identify characteristic of information and communication systems and networks
  2. explain models and methods for analyze information and communication systems and networks
  3. apply simple methods for information networks analyzis
  4. analyze of performances for information and communication systems
  5. design of simle information and communication systems and networks
  6. compare different solutions for given information systems

Forms of Teaching


First cycle (seven weeks): lectures then Midterm exam, and Second cycle (six weeks): lectures and Final exam. Lecture duration: 3 hours per week.


Midterm exam: 8th week; Final exam: 15th week


Every week after lecture.

Acquisition of Skills

In frame of homeworks students write programs for two networks problems.

Grading Method

Continuous Assessment Exam
Type Threshold Percent of Grade Threshold Percent of Grade
Homeworks 0 % 20 % 0 % 20 %
Class participation 0 % 5 % 0 % 5 %
Mid Term Exam: Written 0 % 30 % 0 %
Final Exam: Written 0 % 35 %
Final Exam: Oral 10 %
Exam: Written 50 % 65 %
Exam: Oral 10 %

Week by Week Schedule

  1. Introduction. Information networks structure. Review of netvork mechanisms and protocols.
  2. Stochastic processes: Poisson process, Markov chains, birt-death process.
  3. Queuiong systems 1: Little's law, M/M/1, M/M/c and M/M/1/K models.
  4. Queuiong systems 2: M/G/1 models.
  5. Queuiong systems 3: reservation systems and priority queueing.
  6. Queueing networks and applications.
  7. Network routing 1: shortest path, maximal flow.
  8. Midterm examination.
  9. Analysis of error control and flow control mechanisms.
  10. Network routing 2: minimum cost flows - basic algorithms, optimal routing.
  11. Delay, loss and utilization analysis of packet-switched and circuit-switched networks.
  12. Analysis of TCP's congestion control mechanisms.
  13. Analysis MAC shemes: random access, FDMA/TDMA/CDMA, Local Area Netvorks.
  14. Simulation and measurement techniques.
  15. Final examination.


V. Sinković (1994.), Informacijske mreže, Školska knjiga, Zagreb
Ng Chee-Hock, Soong Boon-Hee (2008.), Queueing Modelling Fundamentals with Applications in Communication Networks, 2nd ed., Wiley, Chichester
D. Bertsekas, R. Gallager (1992.), Data Networks, 2nd ed., Prentice-Hall, Englewood Cliffs, New Jersey
B.R. Haverkort (1998.), Performance of Computer Communication Systems : A Model-Based Approach, Wiley, Chichester
A. Kumar, D. Manjunath, J. Kuri (2004.), Communication Networking: An Analytical Approach, Morgan Kaufmann, San Francisco

For students


ID 34457
  Winter semester
L1 English Level
L1 e-Learning
45 Lectures
0 Seminar
0 Exercises
0 Laboratory exercises
0 Project laboratory

Grading System

85 Excellent
75 Very Good
65 Good
55 Sufficient