By Topic

Frame-based fast sorting scheduling algorithm for packet 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 $31
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)
Wenjie Wang ; Dept. of Electron. Eng., South China Univ. of Technol., Guangzhou, China ; Gang Wei

A scheduling algorithm denoted frame-based approximate sorting fair queueing (FASFQ) is proposed. FASFQ assembles the packets of G-sessions (sessions with rate reservation) as frames which are transmitted one by one. The packets of E-sessions (`best-effort' sessions) are sent during the intervals between frames. FASFQ reduces the sorting complexity by replacing packet-sorting with frame-sorting, and can satisfy the different QoS requirements of different sessions. Analyses and simulations show that FASFQ can guarantee reserved rates for G-sessions and provide good isolation among sessions

Published in:

Electronics Letters  (Volume:37 ,  Issue: 2 )