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.
展开▼
