Thesis Details

Modelování kvality služeb v počítačových sítích

Master's Thesis Student: Danko Martin Academic Year: 2011/2012 Supervisor: Ryšavý Ondřej, doc. Ing., Ph.D.
English title
Modelling QoS in Computer Networks
Language
Czech
Abstract

Quality of service (QoS) is an important consideration in networking, but it is also a significant challenge. Providing QoS guarantees becomes even more challenging when you add the complexities to the network like voice and video applications. This master's thesis focuses on QoS modeling and simulation in discrete event simulation system OMNeT++. The implementation of multiple techniques for QoS simulation is added to OMNeT++ within this work. All implemented modules are validated against the QoS tools on real routers. The last part of the work presents the possibility of QoS simulation in newly implemented modules.

Keywords

Quality of Services, QoS, Differentiated services, OMNeT++, INET Framework, discrete simulation

Department
Degree Programme
Status
defended, grade A
Date
18 June 2012
Reviewer
Committee
Švéda Miroslav, prof. Ing., CSc. (DIFS FIT BUT), předseda
Burget Radek, Ing., Ph.D. (DIFS FIT BUT), člen
Honzík Jan M., prof. Ing., CSc. (DIFS FIT BUT), člen
Hrubý Martin, Ing., Ph.D. (DITS FIT BUT), člen
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Vranić Valentino, doc. Ing., Ph.D. (FIIT STU), člen
Citation
DANKO, Martin. Modelování kvality služeb v počítačových sítích. Brno, 2012. Master's Thesis. Brno University of Technology, Faculty of Information Technology. 2012-06-18. Supervised by Ryšavý Ondřej. Available from: https://www.fit.vut.cz/study/thesis/10950/
BibTeX
@mastersthesis{FITMT10950,
    author = "Martin Danko",
    type = "Master's thesis",
    title = "Modelov\'{a}n\'{i} kvality slu\v{z}eb v po\v{c}\'{i}ta\v{c}ov\'{y}ch s\'{i}t\'{i}ch",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2012,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/10950/"
}
Back to top