RMIT University
Browse

Priority queuing and scheduling algorithms analysis using opnet modeler

conference contribution
posted on 2024-10-31, 17:12 authored by Rakesh Kumar Pradhan, Mark GregoryMark Gregory
In this paper, an analysis of priority queuing and scheduling algorithms is presented. The algorithms utilised in the analysis include First in First out, Priority Queuing, and Weighted Fair Queuing. The analysis network includes a video server and client, an FTP server and client, a VoIP system and a HTTP server and client. The traffic pattern and the packet sizes in the various applications were evenly distributed and based on Poisson's Distribution Function. The Markov model implemented utilised the packet arrival rate and the service time as variables and calculated the average waiting time and the length of the queues. The traffic from this network was routed across a link between two routers which were configured to support the applications based on the queuing algorithms. The end to end delay and the packet drop characteristics of each of these queuing models was compared for the simulated network.

History

Start page

365

End page

370

Total pages

6

Outlet

Proceedings of the International Conference on Computer and Automation Engineering, 4th (ICCAE 2012)

Editors

Prof. Jun Wang

Name of conference

International Conference on Computer and Automation Engineering, 4th (ICCAE 2012)

Publisher

ASME Press

Place published

United States

Start date

2012-01-14

End date

2012-01-15

Language

English

Copyright

© 2012, ASME

Former Identifier

2006042878

Esploro creation date

2020-06-22

Fedora creation date

2013-12-09

Usage metrics

    Scholarly Works

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC