一種新的實現(xiàn)區(qū)分服務(wù)的可擴展緩存管理算法
A Novel Scalable Buffer Management Algorithm for DiffServ
-
摘要: 目前Internet網(wǎng)絡(luò)中采用的緩存管理策略大多為丟尾(Drop tail)算法,并不能適應(yīng)區(qū)分服務(wù)模型的要求;而RED及其改進算法CHOKe也不能提供公平性和相對優(yōu)先級的保證。該文簡要地分析了目前常見的緩存管理算法RED以及CHOKe所存在的不足,提出了一種基于區(qū)分服務(wù)模型的新型緩存管理算法D-CHOKe。該算法提供了公平性和相對優(yōu)先級的保證,并且保持下現(xiàn)有IP網(wǎng)的可擴展性。仿真試驗表明,該算法能夠較好地滿足區(qū)分服務(wù)的要求,為不同優(yōu)先級的流分配不同的帶寬。
-
關(guān)鍵詞:
- 區(qū)分服務(wù); 丟棄優(yōu)先級; 可擴展性; 緩存管理
Abstract: Current Internet uses typically drop tail as its buffer management scheme. This scheme does not meet the need of DiffServ model, while RED and its improved algorithms also suffer from shortcoming in term of fairness and relative drop precedence. This paper analyzes several popular packet scheduling algorithms, proposes a novel scalable algorithm named D-CHOKe(Difference-CHOKe) based on DiffServ model. This algorithm achieves fairness and relative drop precedence, and keep the scalability of the IP network. Simulation demonstrates that D-CHOKe algorithm well meets the requirements of DiffServ. -
計量
- 文章訪問數(shù): 2323
- HTML全文瀏覽量: 129
- PDF下載量: 613
- 被引次數(shù): 0
下載:
