摘要
在各种P2P应用系统中,节点之间的业务量往往随着实际距离的增加而减少。根据上述特点,提出一种最差2跳查找的P2P系统,保证节点最差在2跳内即可找到目标,同时具有较低的系统维护流量和较小的路由表尺寸。针对IP网上的语音覆盖网络系统进行最差2跳查找的特性分析,结果证明,系统中正在通话的用户平均约有80%享受1跳查找服务,只有约20%的用户享受2跳查找服务。
Most of one-hop lookups have characteristic that operation amount of any two-node pair decreased with the increases of physical distance, such as multi-media service. This paper designs an efficient two-hop-worst P2P system, which can ensure any lookup is finished within two hops, also with reasonable bandwidth requirement and size of routing table. It applies the model in VolP system, and finds some valuable results through analysis： in the VolP system using the model, about 80% customers take one-hop-lookup service, and only about 20% customers take two-hop-lookup service.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第18期109-111,114,共4页
Computer Engineering
