Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Chongqing University of Posts and Telecommunications》 2004-01
Add to Favorite Get Latest Update

Consideration for per-flow queuing and scheduling algorithms

SHI Pei-xin, LEI Zhen-ming (Broadband Technology Research Center, Beijing University of Posts and Telecommunications,Beijing 100876,P.R.China)  
Queue scheduling and queue management are the most important functional parts in packet processing under integrated service, but much work has been paid to the performance improvement for scheduling recently while few has been done on per-flow queue management. In this paper, we take the packet processing as a whole, and develop an effective per-flow queue management scheme PRED (potential-based RED) based on the implementation of SPFQ(starting potential-based fair queueing). Through rigid simulations, we find such a combination of PRED-SPFQ exhibits much better performance in fairness and stability for the whole packet processing than other combinations.
【Fund】: 国家自然科学基金资助项目(69896240)。
【CateGory Index】: TP393.07
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved