By Topic

A Frame-Based Packet Scheduling Scheme for Real-Time Applications: 2-Tier Hierarchical Frame Queueing

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
$33 $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 ; Gwangju Inst. of Sci. & Technol., Gwangju ; Jong Won Kim

To support diverse real-time applications, the next-generation Internet needs to provide end-to-end performance guarantee on a per-connection basis in the integrated service environment. In addition to the issues of how to allocate resources to satisfy the specific quality-of-service (QoS) requirements in a single switch, we also need to prevent the burst arrivals due to complex interaction of the packets from different sources within intermediate switches. To address this problem, a new frame-based packet scheduling scheme: 2-tier hierarchical frame (2tHF) queueing, is proposed and investigated in this paper. The key idea of 2tHF queueing is that packets to be served within a frame are evenly distributed over the multiple sub-frames and served in the order of time with other packets. Through numerical analysis, we have shown that when using varying number of sub-frames, the proposed 2tHF queueing not only provides the differentiated end-to-end delay bound, but also solves the coupling problem between the bandwidth allocation granularity and delay performance.

Published in:

Consumer Communications and Networking Conference, 2008. CCNC 2008. 5th IEEE

Date of Conference:

10-12 Jan. 2008