多数据项请求的多信道并行广播调度算法  

Novel scheduling algorithm for multi-item request in multi-channel broadcast

作　　者：吕承飞[1] 季林峰[1] 倪宁[2] 

机构地区：[1]浙江大学计算机学院,浙江杭州310027 [2]浙江商业职业技术学院信息技术系,浙江杭州310012

出　　处：《计算机工程与设计》2011年第7期2271-2273,2285,共4页Computer Engineering and Design

基　　金：国家科技支撑计划基金项目(2007BAH11B06)

摘　　要：为减少数据广播中用户请求的平均访问时间、提高广播性能,提出了一种新的基于减少数据访问冲突和应用重复广播技术的广播调度算法。该算法有效减少了多信道并行广播中多数据项请求的访问冲突,对热点数据项采取重复广播技术,极大地减少了对热点数据项请求的访问时间。仿真实验结果表明,该算法有效地降低了平均访问时间,提高了数据广播性能,特别是在访问概率偏斜率较大时具有更好的性能。To reduce the average access time of queries in data broadcast, improve the data broadcast capability efficiently, a novel broadcast scheduling strategy based on decrease the data access collision and repeatedly broadcast is proposed. Firstly, the approach de- creases the data item access collision. Secondly, by broadcasting repeatedly for hot data items, the model reduces the access time of hot data items greatly. The simulation results show that the proposed algorithm reduces the average access time and improves the data broadcast capability efficiently, especially when it access probability of larger deflection rate.

关 键 词：移动环境 多信道 多数据项请求 访问冲突 重复广播 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]