Analiza vpliva tipa čakalnih vrst na zakasnitve paketov

diplomsko delo

Matija Andrejčič (Author), Miha Mraz (Mentor)

Abstract

V diplomski nalogi smo opredelili probleme zagotavljanja kakovosti storitve interaktivnih aplikacij, ki zahtevajo prenos podatkov v realnem času. Predstavili smo osnovne pojme strežbe ter se seznanili s problemom čakalne vrste. Z vidika teorije strežbe smo predstavili dva primera realnih izgubnih strežnih sistemov s končno čakalno vrsto. Problem čakalnih vrst rešujemo z razvrščevalnimi algoritmi. Poznamo več vrst razvrščevalnih algoritmov, ki jih lahko med seboj primerjamo na podlagi različnih meril. Izbrane algoritme smo uporabili na zgledu simulacije sistema M/M/1/s in jih podrobneje analizirali. Eksperimente smo izvedli v programskem okolju OMNeT++. Slednje nam omogoča postavitev simulacijskega modela, izvedbo simulacije in analizo pridobljenih rezultatov. Rezultate simulacij smo uporabili za analizo in primerjavo učinkovitosti izbranih razvrščevalnih algoritmov.

Keywords

kakovost storitve;čakalna vrsta;razvrščevalni algoritem;FIFO algoritem;algoritem s prioriteto;algoritem z obteženim krožnim razvrščanjem;OMNeT++;računalništvo;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2015
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[M. Andrejčič]
UDC:	004.774.6(043.2)
COBISS:	1536481219
Views:	792
Downloads:	171
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Analysis of the influence of queue type on packet delay in computer networks
Secondary abstract:	In this thesis, we have identified the problems of ensuring the service quality of interactive applications, which require data transfer in real time. We realised basic concepts of network service and got acquainted with the problem of waiting queue. In view of network service theory, we introduced two examples of real loss service systems with final waiting queue. The problem of waiting queue is solved with scheduling algorithms. There are several kinds of scheduling algorithms, which can be compared by different criteria. Selected algorithms have been used in simulation of system M/M/1/s and analysed in more detail. The experiment was done in software environment OMNet++, which makes it possible to set up a simulation model, carry out the simulation and analyse the results. The results of the simulation have been used to analyse and compare the efficiency of the selected scheduling algorithms.
Secondary keywords:	quality of service;waiting queue;scheduling algorithm;FIFO algorithm;strict priority algorithm;weighted round robin algorithm;OMNet++;computer science;computer and information science;diploma;
File type:	application/pdf
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000468
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	49 str.
ID:	8889957