| 1. | Course Title | Teletraffic Engineering and Network Planning | |||||||||||
| 2. | Code | 4ФЕИТ10028 | |||||||||||
| 3. | Study program | 11-IBS, 12-KIT | |||||||||||
| 4. | Organizer of the study program (unit, institute, department) | Faculty of Electrical Engineering and Information Technologies | |||||||||||
| 5. | Degree (first, second, third cycle) | Second cycle | |||||||||||
| 6. | Academic year/semester | I/1 | 7. | Number of ECTS credits | 6.00 | ||||||||
| 8. | Lecturer | Dr Vladimir Atanasovski | |||||||||||
| 9. | Course Prerequisites | ||||||||||||
| 10. | Course Goals (acquired competencies):
Understanding advanced traffic concepts for next generation telecommunications networks. Dimensioning and planning telecommunications networks from a traffic viewpoint. |
||||||||||||
| 11. | Course Syllabus:
Necessary concepts from probability theory. Markov models. Regenerative processes. M/G/1 queue. Analysis of M/G/1-FIFO queue. Analysis with nested Markov model. Analysis of M/G/1-PS queue. Phase method. Analysis of M/G/1-LIFO queue. Priorities. Ideal serving discipline for M/G/1 queues. Application of queueing theory for performance analysis of telecommunications networks. Traffic matrices. Topologies. Routing principles. Approximative and exact methods for calculation. Load control and service protection. Moe’s principle. Multiservice queueing systems. Types. Networks of queues. Open networks. Jackson’s theorem. Closed networks. Traffic measurements. Continual and discrete measurements. Application of probability theory models and stochastic processes for analysis of measured traffic. Modelling Internet traffic. Standards and regulations for network planning. ITU recommendations for teletraffic engineering. Traffic predictions in real networks. Economy of telecommunications networks. Research challenges in the area. |
||||||||||||
| 12. | Learning methods:
Lectures, project work and seminars |
||||||||||||
| 13. | Total number of course hours | 180 | |||||||||||
| 14. | Distribution of course hours | 3 + 3 | |||||||||||
| 15. | Forms of teaching | 15.1 | Lectures-theoretical teaching | 45 hours | |||||||||
| 15.2 | Exercises (laboratory, practice classes), seminars, teamwork | 45 hours | |||||||||||
| 16. | Other course activities | 16.1 | Projects, seminar papers | 30 hours | |||||||||
| 16.2 | Individual tasks | 30 hours | |||||||||||
| 16.3 | Homework and self-learning | 30 hours | |||||||||||
| 17. | Grading | ||||||||||||
| 17.1 | Exams | 10 points | |||||||||||
| 17.2 | Seminar work/project (presentation: written and oral) | 50 points | |||||||||||
| 17.3. | Activity and participation | 10 points | |||||||||||
| 17.4. | Final exam | 30 points | |||||||||||
| 18. | Grading criteria (points) | up to 50 points | 5 (five) (F) | ||||||||||
| from 51 to 60 points | 6 (six) (E) | ||||||||||||
| from 61 to 70 points | 7 (seven) (D) | ||||||||||||
| from 71 to 80 points | 8 (eight) (C) | ||||||||||||
| from 81 to 90 points | 9 (nine) (B) | ||||||||||||
| from 91 to 100 points | 10 (ten) (A) | ||||||||||||
| 19. | Conditions for acquiring teacher’s signature and for taking final exam |
Continuous presence on lectures/consultations |
|||||||||||
| 20. | Forms of assessment |
One full exam with a duration of max 120 minutes in a corresponding exam session and presentation of seminar work. Usage of books, hand-written materials or any kind of supplementary text book during the exam is not allowed, only a calculator is allowed |
|||||||||||
| 21. | Language | Macedonian and English | |||||||||||
| 22. | Method of monitoring of teaching quality | Self-evaluation | |||||||||||
| 23. | Literature | ||||||||||||
| 23.1. | Required Literature | ||||||||||||
| No. | Author | Title | Publisher | Year | |||||||||
| 1. | Villy Baek Iversen | Teletraffic Engineering and Network Planning | DTU Fotonik | 2015 | |||||||||
| 23.2. | Additional Literature | ||||||||||||
| No. | Author | Title | Publisher | Year | |||||||||
| 1. | Haruo Akimaru and Konosuke Kawashima | Teletraffic: Theory and Applications (Telecommunication Networks and Computer Systems) | Springer | 2011 | |||||||||
