会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHODS FOR PEER-CACHING FOR FASTER LOOKUPS IN PEER-TO-PEER SYSTEMS
    • 在对等体系统中用于快速查询的同步方法
    • US20090210489A1
    • 2009-08-20
    • US12032755
    • 2008-02-18
    • Supratim DebRajeev RastogiAnand SrinivasanPrakash Linga
    • Supratim DebRajeev RastogiAnand SrinivasanPrakash Linga
    • G06F15/16
    • H04L67/104H04L67/1076
    • 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.
    • 本发明改进了对等网络中的查询响应等待时间。 本发明通过选择用于包括在对等网络的对等节点的邻居列表中的辅助邻居来增加包括在对等节点的邻居列表中的核心邻居。 在一个实施例中,一种方法包括维护与所述对等网络的多个对等节点中的每一个相关联的查询频率信息,将对等网络中的至少一个对等节点选择为辅助邻居,使用 所述查询频率信息,以及更新邻居列表以包括被选择为所述至少一个辅助邻居的所述至少一个对等节点。 存储在对等节点处的核心邻居尝试最小化该对等节点的最差情况查询延迟。 存储在对等节点处的辅助邻居尝试减少该对等节点的平均查询延迟。 辅助邻居可以用于任何对等系统,例如糕点,挂毯,和弦,SkipGraph等。