By Topic

2-tier hierarchical frame-based queueing for guaranteed delay performance in packet-switched networks

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

2 Author(s)
Dong-Hoon Yi ; Dept. of Inf. & Commun., GIST, Gwangju, South Korea ; JongWon Kim

In this letter, we introduce a novel packet scheduling algorithm, so called 2-tier Hierarchical Frame-based Queueing (2tHFQ) that provides a deterministic delay bound without sorting operation complexity. The key idea of 2tHFQ is to divide a given frame into multiple sub-frames with frame indices assigned, and then transmit input packets according to the frame index hierarchy. We analytically predict how delay bound at a node depends on the number of sub-frames. Through NS-2-based network simulations, we also demonstrate a better performance of 2tHFQ under increased traffic loads and a well-controlled packet delay by varying sub-frame numbers.

Published in:

Communications Letters, IEEE  (Volume:13 ,  Issue: 12 )