Frame-based fast sorting scheduling algorithm forpacket networks
Wenjie Wang, Gang Wei · Electronics Letters · 2001
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.