Priority Queuing and Scheduling Algorithms Analysis Using Opnet Modeler


In this paper, an analysis of priority queuing and scheduling algorithms is presented. The algorithms utilized 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 utilized 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.

  • Abstract
  • Key Words
  • 1. Introduction
  • 2. Algorithms
  • 3. Simulation and Analysis
  • 4. Conclusion and Future Work
  • References
Topics: Algorithms

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In