发明申请
US20090210489A1 METHODS FOR PEER-CACHING FOR FASTER LOOKUPS IN PEER-TO-PEER SYSTEMS
审中-公开
在对等体系统中用于快速查询的同步方法
- 专利标题: METHODS FOR PEER-CACHING FOR FASTER LOOKUPS IN PEER-TO-PEER SYSTEMS
- 专利标题(中): 在对等体系统中用于快速查询的同步方法
-
申请号: US12032755申请日: 2008-02-18
-
公开(公告)号: US20090210489A1公开(公告)日: 2009-08-20
- 发明人: Supratim Deb , Rajeev Rastogi , Anand Srinivasan , Prakash Linga
- 申请人: Supratim Deb , Rajeev Rastogi , Anand Srinivasan , Prakash Linga
- 主分类号: G06F15/16
- IPC分类号: G06F15/16
摘要:
The invention improves query response latency in a peer-to-peer network. The invention augments core neighbors included in a neighbor list of a peer node by selecting auxiliary neighbors for inclusion in the neighbor list of the peer node of a peer-to-peer network. In one embodiment, a method includes maintaining query frequency information associated with each of a plurality of peer nodes of the peer-to-peer network, selecting at least one of the peer nodes of the peer-to-peer network as an auxiliary neighbor using the query frequency information, and updating a neighbor list to include the at least one peer node selected as the at least one auxiliary neighbor. The core neighbors stored at a peer node attempt to minimize the worst-case query latency for that peer node. The auxiliary neighbors stored at the peer node attempt to reduce the average query latency for that peer node. The auxiliary neighbors may be used in any peer-to-peer system, such as Pastry, Tapestry, Chord, SkipGraph, and the like.
信息查询