专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050141060A1 Printer pen 有权
标题翻译：打印笔
公开(公告)号：US20050141060A1
公开(公告)日：2005-06-30
申请号：US10983556
申请日：2004-11-08
申请人： Nils Rydbeck , Orjan Johansson , Peter Danielsson , Stefan Hellkvist , Jan Gabrielsson
发明人： Nils Rydbeck , Orjan Johansson , Peter Danielsson , Stefan Hellkvist , Jan Gabrielsson
IPC分类号： B41J2/315 , B41J3/36 , B41J29/393 , G06F3/00 , G06F3/01 , G06F3/03 , G06F3/038 , G06F9/46 , G06F17/30 , G06K7/10 , G06K15/02 , H04N1/00 , H04N1/047 , H04N1/107 , H04W92/08 , G06K9/00 , H04N1/46
CPC分类号： G06F3/016 , B41J2/315 , B41J3/36 , B41J29/393 , G06F3/002 , G06F3/0321 , G06F3/03545 , G06F3/038 , G06F9/465 , G06F17/30876 , G06K7/10 , G06K15/028 , G06K2215/0005 , H04N1/00307 , H04N1/047 , H04N1/107 , H04N2201/04712 , H04N2201/04717 , H04N2201/04734 , H04N2201/04737 , H04W92/08
摘要： A method and system for generating output from an electronic reading device is based on a detected position of the electronic reading device relative to a predefined address pattern on a specially formatted paper. Based on a periodic detection of successive positions of the electronic reading device, a printer on the electronic reading device is activated in a manner such that stored text or graphics are printed on the specially formatted paper. The printing can be accomplished, for example, using a thermo-print head of the electronic reading device in connection with a thermal sensitive paper. Either as an alternative to or in addition to printing, the electronic reading device can also generate an audio output based on the detected location of the electronic reading device.
摘要翻译：用于从电子读取装置产生输出的方法和系统基于电子阅读装置相对于专门格式化的纸上的预定地址模式的检测位置。基于对电子读取装置的连续位置的周期性检测，电子阅读装置上的打印机被激活，使得存储的文本或图形被打印在专门格式化的纸张上。打印可以例如使用与热敏纸结合的电子读取装置的热敏打印头来实现。作为打印的替代或补充，电子阅读装置还可以基于检测到的电子阅读装置的位置生成音频输出。

2. 发明授权

US08898247B2 Network cache architecture storing pointer information in payload data segments of packets 有权
标题翻译：网络缓存体系结构在分组的有效载荷数据段中存储指针信息
公开(公告)号：US08898247B2
公开(公告)日：2014-11-25
申请号：US13376918
申请日：2009-06-17
申请人： Ayodele Damola , Stefan Hellkvist , Lars Westberg
发明人： Ayodele Damola , Stefan Hellkvist , Lars Westberg
IPC分类号： G06F15/167 , H04L12/24 , H04L29/06 , H04N21/2381 , H04N21/472 , H04L29/08 , H04N21/6437
CPC分类号： H04L65/605 , H04L29/06 , H04L29/08729 , H04L41/00 , H04L65/608 , H04L67/2819 , H04L67/2842 , H04N21/2381 , H04N21/47202 , H04N21/6437
摘要： There is described a method and apparatus for sending data through one or more packet data networks. A reduced size packet is sent from a packet sending node towards a cache node, the reduced size packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the reduced size packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the reduced size packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.
摘要翻译：描述了通过一个或多个分组数据网络发送数据的方法和装置。减小尺寸的分组从分组发送节点发送到高速缓存节点，缩小的大小分组在其有效载荷中包括指向存储在高速缓存节点上的文件中的有效载荷数据段的指针。当在缓存节点处接收到缩小尺寸的分组时，指针用于从存储在高速缓存节点处的数据识别有效载荷数据段。有效载荷数据段被插入缩小尺寸的分组中代替指针，以便生成从高速缓存节点向客户端发送的全尺寸分组。

3. 发明申请

US20120102151A1 DATA FLOW IN PEER-TO-PEER NETWORKS 有权
标题翻译：数据流在对等网络中
公开(公告)号：US20120102151A1
公开(公告)日：2012-04-26
申请号：US13379201
申请日：2009-06-18
申请人： Victor Souza , Stefan Hellkvist
发明人： Victor Souza , Stefan Hellkvist
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L69/14
摘要： There is described a client node for use in a network. The client node comprises a transmitter for requesting data from the network. A processor is operatively connected to the transmitter, and has installed thereon an operating system and an application. A receiver for receiving data from the network is operatively connected to the processor. The application is arranged to request content data from the network by opening a transport socket to the operating system. The operating system is arranged to establish contact with a master peer server in the network, receive a list of sources of the content data from the master peer server through such transport socket signalling, and establish contact with at least one source from the list of sources. The application is arranged to receive the content data from the at least one source without being aware that the content is delivered by at least one source from a list of sources. The list of sources may include nodes in a P2P network.
摘要翻译：描述了在网络中使用的客户端节点。客户端节点包括用于从网络请求数据的发射机。处理器可操作地连接到发射机，并且在其上安装有操作系统和应用。用于从网络接收数据的接收器可操作地连接到处理器。应用程序被安排为通过向操作系统打开传输套接字来从网络请求内容数据。操作系统被安排为与网络中的主对等服务器建立联系，通过这样的传输套接字信令从主对等服务器接收内容数据的源的列表，并且从源列表中的至少一个源建立联系。该应用被安排为从至少一个源接收内容数据，而不知道内容是由源列表中的至少一个源传送的。源列表可以包括P2P网络中的节点。

4. 发明授权

US09065809B2 Method and node for distributing electronic content in a content distribution network 有权
标题翻译：用于在内容分发网络中分发电子内容的方法和节点
公开(公告)号：US09065809B2
公开(公告)日：2015-06-23
申请号：US13375022
申请日：2009-06-03
申请人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
发明人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
IPC分类号： G06F15/167 , H04L29/08
CPC分类号： H04L67/06 , G06F12/0871 , G06F12/0888 , G06F2212/263 , G06F2212/284 , H04L67/2842 , H04L67/2852
摘要： The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes.Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.
摘要翻译：本发明涉及一种用于在包括多个高速缓存节点的内容分发网络（CDN）中有效地分发电子内容的方法和节点。本发明的实施例包括逻辑上表示一组高速缓存节点的虚拟节点。基于高速缓存节点之间的内部通信成本又定义了该组缓存节点。在由虚拟节点表示的每个缓存节点中，收集关于内容请求的统计信息，并且基于该统计信息，确定特定内容是否被缓存在虚拟节点中。如果确定在虚拟节点中缓存特定内容，则可以使特定内容被缓存在由虚拟节点表示的一个或多个高速缓存节点中。

5. 发明申请

US20120084385A1 Network Cache Architecture 有权
标题翻译：网络缓存架构
公开(公告)号：US20120084385A1
公开(公告)日：2012-04-05
申请号：US13376918
申请日：2009-06-17
申请人： Ayodele Damola , Stefan Hellkvist , Lars Westberg
发明人： Ayodele Damola , Stefan Hellkvist , Lars Westberg
IPC分类号： G06F15/167
CPC分类号： H04L65/605 , H04L29/06 , H04L29/08729 , H04L41/00 , H04L65/608 , H04L67/2819 , H04L67/2842 , H04N21/2381 , H04N21/47202 , H04N21/6437
摘要： There is described a method and apparatus for sending data through one or more packet data networks. A reduced size packet is sent from a packet sending node towards a cache node, the reduced size packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the reduced size packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the reduced size packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.
摘要翻译：描述了通过一个或多个分组数据网络发送数据的方法和装置。减小尺寸的分组从分组发送节点发送到高速缓存节点，缩小的大小分组在其有效载荷中包括指向存储在高速缓存节点上的文件中的有效载荷数据段的指针。当在缓存节点处接收到缩小尺寸的分组时，指针用于从存储在高速缓存节点处的数据识别有效载荷数据段。有效载荷数据段被插入缩小尺寸的分组中代替指针，以便生成从高速缓存节点向客户端发送的全尺寸分组。

6. 发明申请

US20120072526A1 METHOD AND NODE FOR DISTRIBUTING ELECTRONIC CONTENT IN A CONTENT DISTRIBUTION NETWORK 有权
标题翻译：在内容分发网络中分配电子内容的方法和节点
公开(公告)号：US20120072526A1
公开(公告)日：2012-03-22
申请号：US13375022
申请日：2009-06-03
申请人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
发明人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
IPC分类号： G06F15/167
CPC分类号： H04L67/06 , G06F12/0871 , G06F12/0888 , G06F2212/263 , G06F2212/284 , H04L67/2842 , H04L67/2852
摘要： The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes.Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.
摘要翻译：本发明涉及一种用于在包括多个高速缓存节点的内容分发网络（CDN）中有效地分发电子内容的方法和节点。本发明的实施例包括逻辑上表示一组高速缓存节点的虚拟节点。基于高速缓存节点之间的内部通信成本又定义了该组缓存节点。在由虚拟节点表示的每个缓存节点中，收集关于内容请求的统计信息，并且基于该统计信息，确定特定内容是否被缓存在虚拟节点中。如果确定在虚拟节点中缓存特定内容，则可以使特定内容被缓存在由虚拟节点表示的一个或多个高速缓存节点中。

7. 发明授权

US09479560B2 Network cache architecture 有权
标题翻译：网络缓存架构
公开(公告)号：US09479560B2
公开(公告)日：2016-10-25
申请号：US13376755
申请日：2010-01-26
申请人： Zoltán Richárd Turányi , András Császár , Ayodele Damola , Stefan Hellkvist , Attila Mihály , Lars Westberg
发明人： Zoltán Richárd Turányi , András Császár , Ayodele Damola , Stefan Hellkvist , Attila Mihály , Lars Westberg
IPC分类号： G06F15/163 , H04L29/06 , H04L12/24 , H04L29/08 , H04N21/2381 , H04N21/472 , H04N21/6437
CPC分类号： H04L65/605 , H04L29/06 , H04L29/08729 , H04L41/00 , H04L65/608 , H04L67/2819 , H04L67/2842 , H04N21/2381 , H04N21/47202 , H04N21/6437
摘要： There is described a method and apparatus for sending data through one or more packet data networks. A stripped-down packet is sent from a packet sending node towards a cache node, the stripped down packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the stripped-down packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the stripped-down packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.
摘要翻译：描述了通过一个或多个分组数据网络发送数据的方法和装置。从数据包发送节点朝向高速缓存节点发送一个分解的数据包，该分解数据包在其有效载荷中包括指向存储在缓存节点上的文件中的有效载荷数据段的指针。当缓存分组在高速缓存节点处被接收时，该指针用于从存储在高速缓存节点处的数据中识别有效载荷数据段。代替指针将有效载荷数据段插入剥离的分组中，以便生成从缓存节点向客户端发送的全尺寸分组。

8. 发明授权

US08949533B2 Method and node entity for enhancing content delivery network 有权
标题翻译：用于增强内容传送网络的方法和节点实体
公开(公告)号：US08949533B2
公开(公告)日：2015-02-03
申请号：US13575723
申请日：2010-02-05
申请人： Hareesh Puthalath , Stefan Hellkvist , Lars-Örjan Kling
发明人： Hareesh Puthalath , Stefan Hellkvist , Lars-Örjan Kling
IPC分类号： G06F12/08 , H04L29/08
CPC分类号： H04L67/2842 , G06F8/4441 , G06F8/4442 , G06F12/08 , H04L67/02 , H04L67/1095
摘要： The present invention prdvides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.
摘要翻译：本发明提供了一种方法和缓存节点实体，用于确保至少预定数量的要保存在网络中的内容对象，包括用于存储内容对象的副本的多个高速缓存节点。本发明利用排序状态值，可删除或不可删除，当分配给内容对象的副本时，它们指示副本是可删除还是不可删除。每个内容对象的至少一个副本被分配值不可删除。内容对象的副本的值从网络的一个缓存节点中的可删除到不可删除的文件的值，如果满足某个条件，则该副本是该值不可删除的候选者。

9. 发明授权

US08665757B2 Method and node for finding content in a content distribution network, and method for creating a virtual representation of a content distribution network 有权
标题翻译：用于在内容分发网络中查找内容的方法和节点以及用于创建内容分发网络的虚拟表示的方法
公开(公告)号：US08665757B2
公开(公告)日：2014-03-04
申请号：US13375044
申请日：2009-06-03
申请人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
发明人： Lars-Örjan Kling , Kjell Nyström , Thomas Johansson , Stefan Hellkvist , Hareesh Puthalath
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L45/12 , H04L45/306 , H04L45/48 , H04L45/64 , H04L65/4084 , H04L67/2842
摘要： Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.
摘要翻译：本发明的实施例提供了一种方法和节点，用于找到包含所请求内容的内容传送网络（CDN）中的缓存节点的最短路径以及用于创建网络的虚拟表示的方法。根据本发明的实施例，虚拟表示是虚拟分层拓扑的形式，并且高速缓存节点对应于真实网络的高速缓存节点。所有缓存节点被布置在第一级并且虚拟节点排列在较高级别。在虚拟表示中，所有节点（缓存和虚拟）都与虚拟链路相连，使得任何两个任意缓存节点之间只存在一条路径。此外，分配虚拟链路的成本，使得虚拟表示中的任何两个任意高速缓存节点之间的路径开销通常对应于真实网络中相应的高速缓存节点之间的最低路径开销。

10. 发明申请

US20130073808A1 METHOD AND NODE ENTITY FOR ENHANCING CONTENT DELIVERY NETWORK 有权
公开(公告)号：US20130073808A1
公开(公告)日：2013-03-21
申请号：US13575723
申请日：2010-02-05
申请人： Hareesh Puthalath , Stefan Hellkvist , Lars-Örjan Kling
发明人： Hareesh Puthalath , Stefan Hellkvist , Lars-Örjan Kling
IPC分类号： G06F12/08
CPC分类号： H04L67/2842 , G06F8/4441 , G06F8/4442 , G06F12/08 , H04L67/02 , H04L67/1095
摘要： The present invention provides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable. The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式