By Topic

Evaluating the performance of the HPS scheduler using opnet simulations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fayed, M. ; Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada ; Watheq El-Kharashi, M. ; Gebali, F.

In this paper, the hierarchical parallel scheduling algorithm (HPS) is proposed, analyzed, and evaluated. This algorithm has a high level of simplicity which makes it more practical for implementation in packet switched networks. The simplicity of the HPS comes from the formulation of scheduling tasks as a linear programming problem that is solved using a simple greedy algorithm. The proposed scheduling algorithm is capable of independently controlling the bandwidth, delay, and delay jitter allocations for different service classes. Complete control of bandwidth-critical, delay-critical, and jitter-critical traffics is assured through the use of two optimization techniques based on the transportation problem and the 0-1 knapsack problem. An OPNET network model is built to verify the functionality and performance of the HPS.

Published in:

Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

28-30 Aug. 2003