%0 Journal Article
%T Processing of Scheduling Algorithm in Packet Switching Network:Analysis of Scalability<br>包交换网络中调度方法进展：扩展性分析
%A 杨明川
%A 钱华林
%J 计算机科学
%D 2002
%I 
%X Due to the fast increasing in traffic and applications in Internet and the great improvement of transfer layertechnology,the quality of service provision in Internet is more and more focused on scalability issue recently. Scalabili-ty should be supported in many elements in QoS architecuture. Among them,the scalability in packet scheduling algo-rithm is of the great improtance. In this paper,we analyze the processing of packet scheduling algorithm from scalabili-ty's point of view. Our work suggests that the scalable packet scheduling is mainly between delay performance andother performance ,such as utilization,fairness.
%K QoS
%K Packet scheduling
%K Packet switching network
%K Scalability<br>Internet
%K 服务质量
%K 网络带宽
%K 包交换网络
%K 包调度算法
%K 扩展性分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=EFCE859706F932F6&yid=C3ACC247184A22C1&vid=771469D9D58C34FF&iid=59906B3B2830C2C5&sid=A04140E723CB732E&eid=C5154311167311FE&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=40