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

1. 发明申请

WO2010145709A1 DATA FLOW IN PEER-TO-PEER NETWORKS 审中-公开
标题翻译：数据流在对等网络中
公开(公告)号：WO2010145709A1
公开(公告)日：2010-12-23
申请号：PCT/EP2009/057632
申请日：2009-06-18
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , SOUZA, Victor , HELLKVIST, Stefan
发明人： SOUZA, Victor , HELLKVIST, Stefan
IPC分类号： H04L29/06
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网络中的节点。

2. 发明申请

WO2011032732A1 CACHING IN MOBILE NETWORKS 审中-公开
标题翻译：在移动网络中进行移动
公开(公告)号：WO2011032732A1
公开(公告)日：2011-03-24
申请号：PCT/EP2010/051031
申请日：2010-01-28
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , WESTBERG, Lars , DAMOLA, Ayodele , HELLKVIST, Stefan
发明人： WESTBERG, Lars , DAMOLA, Ayodele , HELLKVIST, Stefan
IPC分类号： H04W36/02 , H04L29/08 , H04W36/08
CPC分类号： H04W36/026 , H04L67/28 , H04W36/02 , H04W36/08
摘要： There is described a system and method of handing over a connection to a terminal from a source network element (e.g. base station) to a target network element ( e.g. base station) in a packet data network when the source base station is acting as a caching server and sending content data towards the terminal in a session. A handover request is sent from the source base station to the target base station. A context data message ( e.g. CXTP message) is sent from the source base station to the target base station, the context data message including session state parameters identifying the state of the session. At the target base station, the session state parameters are retrieved from the context data message and used to identify the state of the session. Content data packets are then sent from the target base station towards the terminal so as to continue the session.
摘要翻译：描述了当源基站充当缓存时将分组数据网络中的源网络元件（例如，基站）到目标网络元件（例如基站）的终端的连接切换的系统和方法服务器并且在会话中向终端发送内容数据。切换请求从源基站发送到目标基站。上下文数据消息（例如CXTP消息）从源基站发送到目标基站，上下文数据消息包括识别会话状态的会话状态参数。在目标基站，从上下文数据消息中检索会话状态参数，并用于识别会话的状态。然后，从目标基站向终端发送内容数据分组，以便继续该会话。

3. 发明申请

WO2010145699A1 NETWORK CACHE ARCHITECTURE 审中-公开
标题翻译：网络缓存架构
公开(公告)号：WO2010145699A1
公开(公告)日：2010-12-23
申请号：PCT/EP2009/057526
申请日：2009-06-17
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , HELLKVIST, Stefan , DAMOLA, Ayodele , WESTBERG, Lars
发明人： HELLKVIST, Stefan , DAMOLA, Ayodele , WESTBERG, Lars
IPC分类号： H04L29/06
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.
摘要翻译：描述了通过一个或多个分组数据网络发送数据的方法和装置。减小尺寸的分组从分组发送节点发送到高速缓存节点，缩小的大小分组在其有效载荷中包括指向存储在高速缓存节点上的文件中的有效载荷数据段的指针。当在缓存节点处接收到缩小尺寸的分组时，指针用于从存储在高速缓存节点处的数据识别有效载荷数据段。有效载荷数据段被插入缩小尺寸的分组中代替指针，以便生成从高速缓存节点向客户机发送的全尺寸分组。

4. 发明申请

WO2010145853A1 NETWORK CACHE ARCHITECTURE 审中-公开
标题翻译：网络缓存架构
公开(公告)号：WO2010145853A1
公开(公告)日：2010-12-23
申请号：PCT/EP2010/050869
申请日：2010-01-26
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , TURÁNYI, Zoltán, Richárd , CSÁSZÁR, András , DAMOLA, Ayodele , HELLKVIST, Stefan , MIHALY, Attila , WESTBERG, Lars
发明人： TURÁNYI, Zoltán, Richárd , CSÁSZÁR, András , DAMOLA, Ayodele , HELLKVIST, Stefan , MIHALY, Attila , WESTBERG, Lars
IPC分类号： H04L29/06
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.
摘要翻译：描述了通过一个或多个分组数据网络发送数据的方法和装置。从数据包发送节点向高速缓存节点发送一个分解的数据包，该解压缩数据包在其有效载荷中包括指向存储在缓存节点上的文件中的有效载荷数据段的指针。当缓存分组在高速缓存节点处被接收时，该指针用于从存储在高速缓存节点处的数据中识别有效载荷数据段。代替指针将有效载荷数据段插入剥离的分组中，以便生成从高速缓存节点向客户端发送的全尺寸分组。

5. 发明申请

WO0161449A2 SPECIALLY FORMATTED PAPER BASED APPLICATIONS OF A MOBILE PHONE 审中-公开
标题翻译：手机基于特定格式的纸张应用
公开(公告)号：WO0161449A2
公开(公告)日：2001-08-23
申请号：PCT/EP0101398
申请日：2001-02-09
申请人： ERICSSON TELEFON AB L M , HOLLSTROEM MAGNUS , BORGSTROEM ANDERS , GAERDENFORS TORBJOERN , RYDBECK NILS , JOHANSSON OERJAN , OLSSON PATRIK , TILLGREN MAGNUS , DANIELSSON PETER , HELLKVIST STEFAN
发明人： HOLLSTROEM MAGNUS , BORGSTROEM ANDERS , GAERDENFORS TORBJOERN , RYDBECK NILS , JOHANSSON OERJAN , OLSSON PATRIK , TILLGREN MAGNUS , DANIELSSON PETER , HELLKVIST STEFAN
IPC分类号： B41J2/315 , B41J3/36 , B41J29/393 , G06F3/00 , G06F3/01 , G06F3/03 , G06F3/0354 , G06F3/038 , G06F9/46 , G06F17/30 , G06K15/02 , H04N1/00 , H04N1/047 , H04N1/107 , H04W76/02 , H04W92/08 , G06F3/033
CPC分类号： G06F3/016 , B41J2/315 , B41J3/36 , B41J29/393 , G06F3/002 , G06F3/0321 , G06F3/03545 , G06F3/038 , G06F9/465 , G06F17/30876 , G06K15/028 , G06K2215/0005 , H04M1/7253 , H04M1/72547 , H04M1/72561 , H04N1/00307 , H04N1/047 , H04N1/107 , H04N2201/04712 , H04N2201/04717 , H04N2201/04734 , H04N2201/04737 , H04W76/02 , H04W92/08
摘要： A method and system for electronic data entry using an electronic reading device that detects at least one position of the electronic reading device relative to a predefined address pattern of a specially formatted surface. Data relating to the at least one detected position is transmitted, preferably via a wireless interface using a radio transceiver. The data is received by a separate electronic device that performs an operation using the received data, wherein the operation corresponds to an area on the address pattern that contains the at least one detected position. The operation, for example, can include initiating a hyperlink function.
摘要翻译：一种使用电子读取装置的电子数据输入的方法和系统，该电子读取装置相对于特殊格式化表面的预定义地址图案来检测电子阅读装置的至少一个位置。优选地通过使用无线电收发器的无线接口来发送与所述至少一个检测到的位置有关的数据。数据由单独的电子设备接收，其使用所接收的数据执行操作，其中该操作对应于包含该至少一个检测位置的地址模式上的区域。该操作例如可以包括启动超链接功能。

6. 发明申请

WO2011091861A1 CACHING IN MOBILE NETWORKS 审中-公开
标题翻译：在移动网络中进行移动
公开(公告)号：WO2011091861A1
公开(公告)日：2011-08-04
申请号：PCT/EP2010/051200
申请日：2010-02-01
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , WESTBERG, Lars , DAMOLA, Ayodele , HELLKVIST, Stefan
发明人： WESTBERG, Lars , DAMOLA, Ayodele , HELLKVIST, Stefan
IPC分类号： H04L29/08 , H04L29/06 , H04W36/00 , H04W8/18
CPC分类号： H04W36/0011 , H04L65/1016 , H04L65/104 , H04L65/1069 , H04L65/4076 , H04W36/02
摘要： There is described a method and apparatus for handing over a terminal connection from a source base station to a target base station in a packet data network when the source base station is acting as a caching server and sending content data towards the terminal. A handover request is sent from the source base station to the target base station. A first control message is also sent from the source base station to a control server, the first control message including a session identifier for identifying the session, and current parameters for the session. If the target base station is associated with a cache storage unit containing the content data, a second control message is sent from the control server to the target base station, the second control message including a content identifier, the session identifier and the current parameters. At the target base station, the content data packets are retrieved from the cache storage unit, and a header of each retrieved content data packet is populated with parameters calculated using the received current parameters and session identifier. The content data packets are then sent from the base station towards the terminal.
摘要翻译：描述了当源基站充当高速缓存服务器并向终端发送内容数据时，在分组数据网络中将终端连接从源基站切换到目标基站的方法和装置。切换请求从源基站发送到目标基站。第一控制消息也从源基站发送到控制服务器，第一控制消息包括用于识别会话的会话标识符和会话的当前参数。如果目标基站与包含内容数据的高速缓存存储单元相关联，则从控制服务器向目标基站发送第二控制消息，第二控制消息包括内容标识符，会话标识符和当前参数。在目标基站，从高速缓存存储单元检索内容数据分组，并且使用所接收的当前参数和会话标识符计算的参数填充每个检索到的内容数据分组的报头。然后，内容数据包从基站发送到终端。

7. 发明申请

WO2010140935A1 METHOD AND NODE FOR FINDING CONTENT IN A CONTENT DISTRIBUTION NETWORK, AND METHOD FOR CREATING A VIRTUAL REPRESENTATION OF A CONTENT DISTRIBUTION NETWORK 审中-公开
标题翻译：用于在内容分发网络中发现内容的方法和节点，以及用于创建内容分发网络的虚拟表示的方法
公开(公告)号：WO2010140935A1
公开(公告)日：2010-12-09
申请号：PCT/SE2009/050650
申请日：2009-06-03
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , Kling, Lars-Örjan , Nyström, Kjell , Johansson, Thomas , Hellkvist, Stefan , Puthalath, Hareesh
发明人： Kling, Lars-Örjan , Nyström, Kjell , Johansson, Thomas , Hellkvist, Stefan , Puthalath, Hareesh
IPC分类号： H04L29/08
CPC分类号： H04L41/12 , H04L45/12 , H04L45/306 , H04L45/48 , H04L45/64 , H04L65/4084 , H04L67/2842
摘要： The present invention concerns 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. The present invention emanates from a CDN comprising a plurality of cache nodes and provides a method for creating and/or implementing a virtual representation of the CDN. The virtual representation is in the form of a virtual, hierarchical topology, where 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. According to an embodiment of the invention, the virtual representation is implemented in a locator node and used for finding the shortest path from one cache node to another cache node comprising requested content.
摘要翻译：本发明涉及一种方法和节点，用于找到包含请求的内容的内容传送网络（CDN）中的缓存节点的最短路径以及用于创建网络的虚拟表示的方法。本发明从包括多个高速缓存节点的CDN发出并提供用于创建和/或实现CDN的虚拟表示的方法。虚拟表示是虚拟分层拓扑的形式，其中缓存节点对应于真实网络的高速缓存节点。所有缓存节点被布置在第一级并且虚拟节点排列在较高级别。在虚拟表示中，所有节点（缓存和虚拟）都与虚拟链路相连，使得任何两个任意缓存节点之间只存在一条路径。此外，分配虚拟链路的成本，使得虚拟表示中的任何两个任意高速缓存节点之间的路径开销通常对应于真实网络中相应的高速缓存节点之间的最低路径开销。根据本发明的实施例，虚拟表示在定位器节点中实现，并且用于找到从一个高速缓存节点到包括所请求内容的另一个高速缓存节点的最短路径。

8. 发明申请

WO2011096865A1 METHOD AND NODE ENTITY FOR ENHANCING CONTENT DELIVERY NETWORK 审中-公开
标题翻译：用于增强内容传送网络的方法和节点实体
公开(公告)号：WO2011096865A1
公开(公告)日：2011-08-11
申请号：PCT/SE2010/050142
申请日：2010-02-05
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , PUTHALATH, Hareesh , HELLKVIST, Stefan , KLING, Lars-Örjan
发明人： PUTHALATH, Hareesh , HELLKVIST, Stefan , KLING, Lars-Örjan
IPC分类号： H04L29/06 , G06F17/30
CPC分类号： H04L67/2842 , G06F8/4441 , G06F8/4442 , G06F12/08 , H04L67/02 , H04L67/1095
摘要： The present invention provides a method and a caching node entity 26 for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes 18 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 being 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 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.
摘要翻译：本发明提供一种方法和缓存节点实体26，用于确保至少预定数量的要保存在网络中的内容对象，包括用于存储内容对象副本的多个高速缓存节点18。本发明利用排序状态值可删除或不可删除，当分配给内容对象的副本时，它们指示副本是否是可删除的或不可删除的。每个内容对象的至少一个副本被分配值不可删除。内容对象从网络的一个缓存节点中的可删除到不可删除的副本的值，如果满足某个条件，则该副本是该值不可删除的候选者。

9. 发明申请

WO2011073707A1 DYNAMIC CACHE SELECTION METHOD AND SYSTEM 审中-公开
标题翻译：动态缓存选择方法和系统
公开(公告)号：WO2011073707A1
公开(公告)日：2011-06-23
申请号：PCT/IB2009/007753
申请日：2009-12-14
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , PUTHALATH, Hareesh , DAMOLA, Ayodele , HELLKVIST, Stefan , JOHNSSON, Andreas
发明人： PUTHALATH, Hareesh , DAMOLA, Ayodele , HELLKVIST, Stefan , JOHNSSON, Andreas
IPC分类号： H04L29/08 , H04L12/56
CPC分类号： H04L67/1025 , H04L45/00 , H04L45/121 , H04L45/124 , H04L45/125 , H04L67/1002 , H04L67/101 , H04L67/1097 , H04L67/2852
摘要： Node, computer software and method for selecting a resource [20] that is available at multiple caches [14] connected in a communication network [80]. The method includes receiving from a user [18] a request for the resource [20]; identifying one or more caches [14a, 14b, 14c] of the multiple caches [14] that store the resource [20]; determining a total cost associated with a path between the user [18] and each cache [14a, 14b, 14c] of the one or more caches [14] storing the resource [20], the total cost including a static cost [Cf] that reflects a topology of the communication network [80] and a dynamic cost [Δ] which is indicative of changing conditions of the communication network [80]; and selecting one cache [14a] from the one or more caches [14a, 14b, 14c] that store the resource [20] based on a lowest total cost of the one cache [14a].
摘要翻译：用于选择在通信网络中连接的多个高速缓存[14]可用的资源[20]的节点，计算机软件和方法[80]。该方法包括从用户接收对资源的请求[20]; 识别存储资源的多个高速缓存[14]的一个或多个高速缓存[14a，14b，14c]。确定与存储资源[20]的一个或多个高速缓存[14]的用户[18]和每个高速缓存[14a，14b，14c]之间的路径相关联的总成本，总成本包括静态成本[Cf] 这反映了通信网络的拓扑[80]和表示通信网络变化条件的动态成本[？] [80]。以及基于所述一个高速缓存[14a]的最低总成本从所述一个或多个存储所述资源[20]的高速缓存[14a，14b，14c]中选择一个高速缓存[14a]。

10. 发明申请

WO2010140938A1 METHOD AND NODE FOR DISTRIBUTING ELECTRONIC CONTENT IN A CONTENT DISTRIBUTION NETWORK 审中-公开
标题翻译：在内容分发网络中分配电子内容的方法和节点
公开(公告)号：WO2010140938A1
公开(公告)日：2010-12-09
申请号：PCT/SE2009/050658
申请日：2009-06-03
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , LARS-ÖRJAN, Kling , KJELL, Nyström , JOHANSSON, Thomas , HELLKVIST, Stefan , PUTHALATH, Hareesh
发明人： LARS-ÖRJAN, Kling , KJELL, Nyström , JOHANSSON, Thomas , HELLKVIST, Stefan , PUTHALATH, Hareesh
IPC分类号： 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. The method defines 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）中有效地分发电子内容的方法和节点。该方法定义了逻辑上表示一组缓存节点的虚拟节点。基于高速缓存节点之间的内部通信成本又定义了该组缓存节点。在由虚拟节点表示的每个缓存节点中，收集关于内容请求的统计信息，并且基于该统计信息，确定特定内容是否被缓存在虚拟节点中。如果确定在虚拟节点中缓存特定内容，则可以使特定内容被缓存在由虚拟节点表示的一个或多个高速缓存节点中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式