会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • SYSTEM, SHARING NODE, SERVER, AND METHOD FOR CONTENT DISTRIBUTION
    • 系统,共享节点,服务器和内容分发方法
    • WO2010003786A3
    • 2010-08-12
    • PCT/EP2009057487
    • 2009-06-16
    • THOMSON LICENSINGCOURTAY OLIVIERHEEN OLIVIERSTAHL NICLAS
    • COURTAY OLIVIERHEEN OLIVIERSTAHL NICLAS
    • H04L29/08H04L29/06
    • H04L67/104H04L65/4084H04L65/80H04L67/1063H04L67/1076H04L67/108H04L67/1082
    • A system for distribution of a content item (230) in a network (200), particularly a peer-to-peer network. A requesting node (210B-210D) sends a request for the content item (230). An access requirement value for the content item is compared to a counter value for the requesting node (210B-210D) to determine if the requesting node may download the content item (230) from a sharing node (210A). The counter value is advantageously linked to the requesting node's habit of sharing content items. The access requirement value, which preferably is not only linked to the size of the content item, is modified for at least one content item (230) in the network (200), either following a time rule or when the content is downloaded. In this way it can be ensured that initial downloaders are likely to share the content item and that the content then gets more accessible to other nodes. Also provided are a sharing node (210A), a server (640) and a method.
    • 一种用于在网络(200)中分发内容项(230)的系统,特别是对等网络。 请求节点(210B-210D)发送对内容项目(230)的请求。 将内容项的访问要求值与请求节点(210B-210D)的计数器值进行比较,以确定请求节点是否可以从共享节点(210A)下载内容项(230)。 计数器值有利地与请求节点共享内容项目的习惯相关联。 访问要求值优选地不仅链接到内容项目的大小,而是根据时间规则或者当下载内容时针对网络(200)中的至少一个内容项目(230)修改访问要求值。 通过这种方式,可以确保初始下载者可能共享内容项,并且内容随后可以更容易地被其他节点访问。 还提供了共享节点(210A),服务器(640)和方法。
    • 7. 发明申请
    • DEVICE, SYSTEM AND METHOD FOR SERVICE DELIVERY WITH ANTI-EMULATION MECHANISM
    • 具有抗仿真机制的服务提供的装置,系统和方法
    • WO2007128794A1
    • 2007-11-15
    • PCT/EP2007/054370
    • 2007-05-04
    • THOMSON LICENSINGDURAND, AlainHEEN, OlivierDIEHL, Eric
    • DURAND, AlainHEEN, OlivierDIEHL, Eric
    • H04L29/06
    • H04L63/10G06F21/31G06F2221/2129
    • A method for service delivery to a client (110), in which the client (110) selects (216) a service, and establishes (218) a connection with a system server (120) to which it sends (220) an identity (ID) associated with the client (110) and an identifier (CONT_ID) of the service. The system server (120) verifies (222) that the client (110) is authorised to access to the service and (224) that the client (110) is non-emulated. If this is verified, the service is provided to the client (110). In a preferred embodiment, the service is scrambled content (C´) and the system server (120) provides (226) a descrambling key (K cont ) to the client (110) , and instructs (228) a content server (130) to provide (230) the scrambled content (C´) to the client (110). Also claimed are a device, a system, and a system server.
    • 一种用于向客户端(110)发送服务的方法,其中客户端(110)选择(216)服务,并建立(218)与其发送的系统服务器(120)的连接(220)身份( ID)和该服务的标识符(CONT_ID)。 系统服务器(120)验证(222)客户端(110)被授权访问服务,并且(224)客户端(110)未被仿真。 如果这被验证,则将该服务提供给客户端(110)。 在优选实施例中,服务是加密内容(C'),系统服务器(120)向客户机(110)提供解扰密钥(226),并指示(228) )内容服务器(130),以向所述客户端(110)提供(230)所述加扰的内容(C')。 还声称是设备,系统和系统服务器。
    • 8. 发明申请
    • METHOD AND DEVICE FOR FINGERPRINTING OF WIRELESS COMMUNICATION DEVICES
    • 用于指示无线通信设备的方法和设备
    • WO2012069544A1
    • 2012-05-31
    • PCT/EP2011/070830
    • 2011-11-23
    • THOMSON LICENSINGHEEN, OlivierNEUMANN, ChristophONNO, Stéphane
    • HEEN, OlivierNEUMANN, ChristophONNO, Stéphane
    • H04W12/12H04L29/06
    • H04W8/005H04L63/1425H04W12/12
    • A method for fingerprinting wireless devices (120) and a method for using a device fingerprint for identifying wireless devices. A monitoring station (200) listens (410) to a channel. For each received frame, the station measures (430) the inter-arrival time from the end of the previously received frame to the end of the present frame. If possible, the station obtains (440) the identity 10 of the sender of the frame. If the sender is known, then the station stores (450) the inter-arrival time in a histogram for the sender; the histogram becomes the fingerprint for the sender. Identification of a device begins by obtaining a number of inter-arrival times for an unknown sender and then matching these to stored fingerprints using a suitable similarity measure. The 15 invention is particularly suitable for IEEE 802.11 and may for example be used to detect so-called MAC spoofing and as an additional layer of an identification protocol.
    • 一种用于对无线设备进行指纹识别的方法(120)以及用于使用设备指纹识别无线设备的方法。 监视站(200)监听(410)到信道。 对于每个接收的帧,站测量(430)从先前接收的帧的结束到当前帧的结束的到达之间的时间。 如果可能,站获得(440)帧的发送者的身份10。 如果发送者是已知的,则该站将发送者的直达时间存入(450)到达时间; 直方图成为发送者的指纹。 设备的识别开始于通过获得未知发送者的到达之间的时间数目,然后使用合适的相似度度量将它们与存储的指纹进行匹配。 本发明特别适用于IEEE 802.11,并且可以例如用于检测所谓的MAC欺骗和作为识别协议的附加层。
    • 9. 发明申请
    • SYSTEM, SHARING NODE, SERVER, AND METHOD FOR CONTENT DISTRIBUTION
    • 系统,共享节点,服务器和内容分发方法
    • WO2010003786A4
    • 2010-10-14
    • PCT/EP2009057487
    • 2009-06-16
    • THOMSON LICENSINGCOURTAY OLIVIERHEEN OLIVIERSTAHL NICLAS
    • COURTAY OLIVIERHEEN OLIVIERSTAHL NICLAS
    • H04L29/08H04L29/06
    • H04L67/104H04L65/4084H04L65/80H04L67/1063H04L67/1076H04L67/108H04L67/1082
    • A system for distribution of a content item (230) in a network (200), particularly a peer-to-peer network. A requesting node (210B-210D) sends a request for the content item (230). An access requirement value for the content item is compared to a counter value for the requesting node (210B-210D) to determine if the requesting node may download the content item (230) from a sharing node (210A). The counter value is advantageously linked to the requesting node's habit of sharing content items. The access requirement value, which preferably is not only linked to the size of the content item, is modified for at least one content item (230) in the network (200), either following a time rule or when the content is downloaded. In this way it can be ensured that initial downloaders are likely to share the content item and that the content then gets more accessible to other nodes. Also provided are a sharing node (210A), a server (640) and a method.
    • 一种用于在网络(200),特别是对等网络中分发内容项(230)的系统。 请求节点(210B-210D)发送对内容项目的请求(230)。 将内容项的访问要求值与请求节点(210B-210D)的计数器值进行比较,以确定请求节点是否可以从共享节点(210A)下载内容项(230)。 计数器值有利地与请求节点共享内容项的习惯相关联。 对于网络(200)中的至少一个内容项(230),根据时间规则或当内容被下载时,优选不仅与内容项的大小相关联的访问要求值被修改。 以这种方式,可以确保初始下载者可能共享内容项,并且内容随后可被其他节点更容易访问。 还提供了共享节点(210A),服务器(640)和方法。
    • 10. 发明申请
    • SYSTEM, SHARING NODE, SERVER, AND METHOD FOR CONTENT DISTRIBUTION
    • 系统,共享节点,服务器和内容分发方法
    • WO2010003786A2
    • 2010-01-14
    • PCT/EP2009/057487
    • 2009-06-16
    • THOMSON LICENSINGCOURTAY, OlivierHEEN, OlivierSTAHL, Niclas
    • COURTAY, OlivierHEEN, OlivierSTAHL, Niclas
    • H04L29/08H04L29/06
    • H04L67/104H04L65/4084H04L65/80H04L67/1063H04L67/1076H04L67/108H04L67/1082
    • A system for distribution of a content item (130) in a network (200), particularly a peer-to-peer network. A requesting node (210B-210D) sends a request for the content item (130). An access requirement value for the content item is compared to a counter value for the requesting node (210B-210D) to determine if the requesting node may download the content item (130) from a sharing node (210A). The counter value is advantageously linked to the requesting node's habit of sharing content items. The access requirement value, which preferably is not only linked to the size of the content item, is modified for at least one content item (130) in the network (200), either following a time rule or when the content is downloaded. In this way it can be ensured that initial downloaders are likely to share the content item and that the content then gets more accessible to other nodes. Also provided are a sharing node (210A), a server (600) and a method.
    • 一种用于在网络(200),特别是对等网络中分发内容项(130)的系统。 请求节点(210B-210D)发送对内容项目的请求(130)。 将内容项目的访问要求值与请求节点(210B-210D)的计数器值进行比较,以确定请求节点是否可以从共享节点(210A)下载内容项目(130)。 计数器值有利地与请求节点共享内容项的习惯相关联。 对于网络(200)中的至少一个内容项(130),修改优选地不仅与内容项的大小相关联的访问要求值,或者遵循时间规则或当下载内容时。 以这种方式,可以确保初始下载者可能共享内容项,并且内容随后可被其他节点更容易访问。 还提供了共享节点(210A),服务器(600)和方法。