可靠多播网络的动态缓存分配算法与替换策略  

Dynamic buffer partitioning and replacement for reliable multicast

作　　者：张靖宇[1] 李志蜀[1] 陈良银[1] 丁革建[2] 陈建明[2] 

机构地区：[1]四川大学计算机学院,成都610064 [2]浙江师范大学数理信息学院,浙江金华321004

出　　处：《计算机应用》2009年第7期1844-1848,共5页journal of Computer Applications

基　　金：浙江省科技厅资助项目(2008C21081)

摘　　要：ACP是一种适用于多组共享环境的路由器缓存管理协议。在突发数据流频繁出现的互联网中,当多播组数量或者组成员发生变化时,ACP分配算法暴露出慢收敛和分配结果不稳定等问题。通过设计并实现动态缓存分配算法、超时算法以及丢包策略,提出了一种新型的、适用于大规模多播网络的自适应主动可靠多播协议(AARM)。模拟实验结果表明,与ACP相比,AARM将为多播网络在恢复延迟、带宽消耗和网络吞吐等方面带来明显的性能提升。ACP is a buffer management protocol applied to shared environment. However, when muhicast group number or group member changes, ACP can hardly adjust its allocation quota in time and this will lead to the decrease of cache utilization ratio. To address these drawbacks, a new buffer management scheme called Adaptive and Active Reliable Muhicast Protocol （AARM） was proposed, for large-scale muhicast network. Simulation results show, AARM outperforms ACP in reducing recovery latency and bandwidth consumption, and raising network throughput.

关 键 词：可靠多播 缓存分配 缓存替换策略 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]