摘要
提出了一种新的供应者发现机制,在源服务器上创建类似目录的数据结构维护系统中少量特定P2P节点的信息,用来锁定与目标供应者播放进度接近的节点,再通过这些节点的缓存交迭表与其邻近节点直接通信来找到合适的供应者。仿真实验结果表明,该供应者发现机制能够加快P2P节点的加入和恢复操作,且整个系统的通信负担明显降低。
This paper presented an original mechanism for finding suppliers, the server maintained a few specific peers＇ information by a structure which was similar to directory. The requester was able to find peers whose playing progression was close to suppliers＇ by using this information. Then by these peers＇ overlapping buffer tables to their adjacent peers, the requester could locate proper suppliers accurately. The simulation result shows that users in the mechanism require less time in join and recovery operation, and the mechanism keeps the systems message overhead small.
出处
《计算机应用研究》
CSCD
北大核心
2008年第9期2804-2808,共5页
Application Research of Computers
基金
广西教育厅基金资助项目(桂教科研[2005]47号)
