Thesis Details

Modelování směrovacích protokolů OSPF v simulátoru OMNeT++

Bachelor's Thesis Student: Danko Martin Academic Year: 2008/2009 Supervisor: Ryšavý Ondřej, doc. Ing., Ph.D.
English title
Modelling OSPF Routing Protocols Using OMNeT++ Simulator
Language
Czech
Abstract

Open Shortest Path First (OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. There is a deliberate need for large-scale simulation of OSPF protocol in order to understand its dynamics. Content of this bachelor's thesis is modeling and simulation of OSPF protocol in discrete event simulation system OMNeT++. The main focus is to give an insight of the architecture of the existing implementation in module OSPFRouting. The module OSPFRouting is also validated against OSPF implementation on the real routers. Next, the usage of OSPF simulation is demonstrated on the specific experiments.

Keywords

OSPF, OMNeT++, INET Framework, discrete simulation, routing protocol

Department
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
15 June 2009
Reviewer
Committee
Švéda Miroslav, prof. Ing., CSc. (DIFS FIT BUT), předseda
Kočí Radek, Ing., Ph.D. (DITS FIT BUT), člen
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS FIT BUT), člen
Ráb Jaroslav, Ing. (DIFS FIT BUT), člen
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), člen
Citation
DANKO, Martin. Modelování směrovacích protokolů OSPF v simulátoru OMNeT++. Brno, 2009. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2009-06-15. Supervised by Ryšavý Ondřej. Available from: https://www.fit.vut.cz/study/thesis/7989/
BibTeX
@bachelorsthesis{FITBT7989,
    author = "Martin Danko",
    type = "Bachelor's thesis",
    title = "Modelov\'{a}n\'{i} sm\v{e}rovac\'{i}ch protokol\r{u} OSPF v simul\'{a}toru OMNeT++",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2009,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/7989/"
}
Back to top