基于Zipf多点协作通信中文件命中率问题  

File hit rate problem based on Zipf multi-point cooperative communication

作　　者：宁远翔 曹玉洁 张玉婷 黄苗苗 林积昶 Ning Yuanxiang;Cao Yujie;Zhang Yuting;Huang Miaomiao;Lin Jichang(College of Computer and Information Engineering,Henan Normal University,Xinxiang 453007,China;College of Software,Henan Normal University,Xinxiang 453007,China;PLA 32145,Xinxiang 453000,China)

机构地区：[1]河南师范大学计算机与信息工程学院 [2]河南师范大学软件学院 [3]解放军32145部队

出　　处：《无线互联科技》2019年第6期7-8,共2页Wireless Internet Technology

摘　　要：无线移动网络飞速发展,网络数据呈指数型增长。经大量研究证明,即使网络中存在大量的数据,但是不同的内容被用户请求的次数并不相等。有些流行度比较高的内容数据会被用户重复请求,因此,造成了网络大量冗余问题。多点协作通信技术可以有效减少网络数据冗余。文章主要针对基于Zipf函数建立的平均请求几率模型来描述网络中不同内容,再以泊松分布的移动节点,计算不同节点在不同容量下请求不同内容的命中率及平均命中率。The wireless mobile networks are developing rapidly, and network data is exponentially growing. A lot of research has proved that even if there is a large amount of data in the network, the times of different content which is requested by users is not equal. Some popular content data will be repeatedly requested by users, thus causing a large number of network redundancy problems. Multi-point cooperative communication technology can effectively reduce network data redundancy. The article mainly describes the different content in the network based on the average request probability model established by the Zipf function, and then uses the poisson distributed mobile node to calculate the hit rate and average hit rate of different nodes requesting different content under different capacities.

关 键 词：Zipf模型 多点协作通信技术 流行度 

分 类 号：TN929.5[电子电信—通信与信息系统]