会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD, SYSTEM, SERVICE SELECTION ENTITY FOR SELECTING SERVICE PROVISION ENTITY
    • 方法,系统,服务选择实体选择服务提供实体
    • US20110093564A1
    • 2011-04-21
    • US12975091
    • 2010-12-21
    • Feng LiYue YinJin Li
    • Feng LiYue YinJin Li
    • G06F15/16
    • H04L12/6418H04L67/104H04L67/16
    • The present invention discloses a method, system, service selection entity, and service management entity for selecting a service provision entity in a peer-to-peer (P2P) network, so as to select heterogeneous service provision entities for heterogeneous service requesting entities. The method includes: receiving service capability information of service provision entities; obtaining service request information of a service requesting entity; and selecting a service provision entity of an appropriate service capability to provide a service for the service requesting entity according to the service capability information of service provision entities and the service request information of the service requesting entity. The present invention is applicable to P2P overlay networks.
    • 本发明公开了一种用于选择对等(P2P)网络中的服务提供实体的方法,系统,服务选择实体和服务管理实体,以便为异构服务请求实体选择异构服务提供实体。 该方法包括:接收业务提供实体的业务能力信息; 获取服务请求实体的服务请求信息; 以及选择具有适当服务能力的服务提供实体,以根据服务提供实体的服务能力信息和服务请求实体的服务请求信息为服务请求实体提供服务。 本发明适用于P2P覆盖网络。
    • 2. 发明授权
    • Method, system, service selection entity for selecting service provision entity
    • 选择服务提供实体的方法,系统,服务选择实体
    • US09130782B2
    • 2015-09-08
    • US12975091
    • 2010-12-21
    • Feng LiYue YinJin Li
    • Feng LiYue YinJin Li
    • G06F15/16H04L12/64H04L29/08G06F12/00
    • H04L12/6418H04L67/104H04L67/16
    • The present invention discloses a method, system, service selection entity, and service management entity for selecting a service provision entity in a peer-to-peer (P2P) network, so as to select heterogeneous service provision entities for heterogeneous service requesting entities. The method includes: receiving service capability information of service provision entities; obtaining service request information of a service requesting entity; and selecting a service provision entity of an appropriate service capability to provide a service for the service requesting entity according to the service capability information of service provision entities and the service request information of the service requesting entity. The present invention is applicable to P2P overlay networks.
    • 本发明公开了一种用于选择对等(P2P)网络中的服务提供实体的方法,系统,服务选择实体和服务管理实体,以便为异构服务请求实体选择异构服务提供实体。 该方法包括:接收业务提供实体的业务能力信息; 获取服务请求实体的服务请求信息; 以及选择具有适当服务能力的服务提供实体,以根据服务提供实体的服务能力信息和服务请求实体的服务请求信息为服务请求实体提供服务。 本发明适用于P2P覆盖网络。
    • 8. 发明授权
    • Reliable, efficient peer-to-peer storage
    • 可靠,高效的点对点存储
    • US09047310B2
    • 2015-06-02
    • US11359276
    • 2006-02-22
    • Jin Li
    • Jin Li
    • G06F7/00G06F17/30
    • G06F17/30206
    • An adaptive coding storage system that uses adaptive erasure resilient code (ERC) which changes the number of fragments used for encoding according to the size of the file distributed. Adaptive ERC may greatly improve the efficiency and reliability of P2P storage. A number of procedures for P2P storage applications may also be implemented. In one embodiment small, dynamic data files are diverted to the more reliable peers or even a server, while large and static files are stored utilizing the storage capacity of the unreliable peers. Also, for balanced contribution and benefit, a peer should host the same amount of content as it stored in the P2P network. As a result, unreliable peers are allowed to distribute less data, and more reliable peers are allowed to distribute more. Also, smaller files are assigned a higher distribution cost, and the larger files are assigned a lower distribution cost.
    • 一种自适应编码存储系统,其使用自适应擦除弹性码(ERC),其根据所分配文件的大小改变用于编码的片段的数量。 自适应ERC可以大大提高P2P存储的效率和可靠性。 还可以实现用于P2P存储应用的多个过程。 在一个实施例中,小的动态数据文件被转移到更可靠的对等体或甚至服务器,而使用不可靠对等体的存储容量来存储大而静态的文件。 此外,为了平衡贡献和收益,对等体应该承载与存储在P2P网络中相同数量的内容。 因此,不可靠的对等体被允许分配更少的数据,并且允许更可靠的对等体分发更多的数据。 而且,分配较小的文件分配成本较高,分配较大的文件分配成本较低。