-
46浏览
-
0点赞
-
0收藏
-
0分享
-
115下载
-
0评论
-
引用
期刊论文
Frame-based fast sorting scheduling algorithm for packet networks
ELECTRONICS LETTERS 18th January 2001 Vol. 37 No.2,-0001,():
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.
【免责声明】以下全部内容由[韦岗]上传于[2005年03月08日 00时09分49秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果