DocumentCode
1429752
Title
Frame-based fast sorting scheduling algorithm for packet networks
Author
Wang, Wenjie ; Wei, Gang
Author_Institution
Dept. of Electron. Eng., South China Univ. of Technol., Guangzhou, China
Volume
37
Issue
2
fYear
2001
fDate
1/18/2001 12:00:00 AM
Firstpage
83
Lastpage
85
Abstract
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
Keywords
communication complexity; packet switching; quality of service; queueing theory; scheduling; telecommunication network management; E-sessions; FASFQ algorithm; G-sessions; QoS requirements; best-effort sessions; frame-based approximate sorting fair queueing; frame-based fast sorting scheduling algorithm; packet networks; rate reservation; sorting complexity reduction;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20010063
Filename
898270
Link To Document