公开(公告)号：WO2009136828A1

公开(公告)日：2009-11-12

申请号：PCT/SE2008/050661

申请日：2008-06-04

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) ,  SOUZA, Victor

Inventor： SOUZA, Victor

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L67/06 ,  H04L67/1076

Abstract: The dynamicity of current content delivery environments demands the use of highly complex algorithms. A content delivery system (210) for delivering content to clients (230, 240) in a content delivery network (100) is disclosed and further comprises a method for placing the content in the content delivery network (100). The content delivery system (210) comprises at least one mobile object (212) adapted to be executed on the content delivery system (210) but also adapted to be executed on other content delivery systems (220). Each mobile object (212) comprises a media file (213) and is adapted to monitor data related to the clients' (230, 240) access of the media file (213). When certain conditions are met, e.g. when many clients (230, 240) that are accessing the media file (213) are closer to another content delivery system (220), the mobile object (212) can decide to move or copy itself to the other content delivery system (220).

Abstract translation: 当前内容传送环境的动态性要求使用高度复杂的算法。 公开了一种用于将内容传递到内容传送网络（100）中的客户端（230,240）的内容传送系统（210），并且还包括用于将内容放置在内容传送网络（100）中的方法。 内容传送系统（210）包括适于在内容传送系统（210）上执行但还适于在其他内容传送系统（220）上执行的至少一个移动对象（212）。 每个移动对象（212）包括媒体文件（213），并且适于监视与媒体文件（213）的客户端（230,240）访问有关的数据。 当满足某些条件时，例如 当许多正在访问媒体文件（213）的客户端（230,240）更靠近另一内容传送系统（220）时，移动对象（212）可以决定将自身移动或复制到另一个内容传送系统（220） 。

公开(公告)号：WO2010101496A9

公开(公告)日：2010-09-10

申请号：PCT/SE2009/050226

申请日：2009-03-03

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) ,  SOUZA, Victor ,  CARVALHO, Tereza ,  DAMOLA, Ayodele ,  GALLO, Diego

Inventor： SOUZA, Victor ,  CARVALHO, Tereza ,  DAMOLA, Ayodele ,  GALLO, Diego

IPC: H04L29/08

Abstract: The present invention relates to nodes and methods for use in connection with a peer-to-peer network for sharing of data content. A priority mechanism is introduced by means of which a serving peer may select which requesting peers to serve based on their need for data content in terms of the degree of urgency. A requesting peer may include an urgency indicator in a request for data content, which for instance may be the amount of buffered data available for playback in a video buffer. The serving peer may then extract (52) the urgency indicator from the request and apply (53) a priority mechanism which uses the urgency indicator to select which peers to upload data content to.

公开(公告)号：WO2010094322A1

公开(公告)日：2010-08-26

申请号：PCT/EP2009/051860

申请日：2009-02-17

Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) ,  SOUZA, Victor ,  BOGESTAM, Kent ,  DAMOLA, Ayodele

Inventor： SOUZA, Victor ,  BOGESTAM, Kent ,  DAMOLA, Ayodele

IPC: H04N7/173 ,  H04L29/08

CPC classification number: H04N7/17318 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/1074 ,  H04N7/17336 ,  H04N21/23113 ,  H04N21/4788 ,  H04N21/632 ,  H04N21/6587 ,  H04N21/8355

Abstract: According to a first aspect of the present invention there is provided a method of distributing data to peers of a peer-to-peer network to enable those peers to provide data to other peers. The method comprises predefining a minimum number of peers that are required to store a data item (C1), sending the data item to a number of data receiving peers from one or more data servers (C2), determining if the number of data receiving peers that have sufficient storage capacity available to store the data item is less than the predefined minimum number (C3, C4), and, if it is, deleting previously stored data to make sufficient storage capacity available (C6).

Abstract translation: 根据本发明的第一方面，提供了一种将数据分发到对等网络的对等体以使得对等体能够向其他对等体提供数据的方法。 该方法包括预定义存储数据项（C1）所需的最小对等体数量，将数据项从一个或多个数据服务器（C2）发送到多个数据接收对等体，确定数据接收对等体的数量 具有可用于存储数据项的足够存储容量小于预定义的最小数量（C3，C4），如果是，删除先前存储的数据以使足够的存储容量可用（C6）。

公开(公告)号：WO2010071516A8

公开(公告)日：2010-06-24

申请号：PCT/SE2008/051507

申请日：2008-12-18

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) ,  KARLSSON, Per ,  SOUZA, Victor

Inventor： KARLSSON, Per ,  SOUZA, Victor

IPC: H04L29/08

Abstract: The present invention comprises a content delivery system (510) for delivering content to clients (628, 660). The content delivery system (510) comprises at least one mobile object (512) adapted to be executed on the content delivery system (510) and on other content delivery systems (520) or multimedia devices (620) adapted for mobile objects. Each mobile object (512) comprises a media file (513) and is further adapted to determine the capabilities of the other content delivery systems (520) or multimedia devices (620) and to monitor data related to the clients' (628, 660) access of the media file (513). The content delivery system (510) also comprises a transcoder unit (519) for transcoding the media file (513) to another media file (523) prior sending it to the other content delivery system (520) or multimedia device (620). The invention solves problems that can arise when sending large media files to content delivery systems (520) or multimedia devices (620) having limited capabilities.

公开(公告)号：WO2009068952A2

公开(公告)日：2009-06-04

申请号：PCT/IB2008/003125

申请日：2008-11-18

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) ,  KÖLHI, Johan ,  DAMOLA, Ayodele ,  SOUZA, Victor

Inventor： KÖLHI, Johan ,  DAMOLA, Ayodele ,  SOUZA, Victor

IPC: H04L29/06

CPC classification number: H04L67/28 ,  H04L67/2852 ,  H04L67/289

Abstract: A method, network, and node for distributing content across a plurality of content cache nodes to provide optimal access to the content. Relevant, e.g. popular, content is distributed as close as possible to the user or group of users that have the highest probability of requesting the content. In addition, content is relocated to caching nodes higher in the aggregation network as content become less demanded, e.g. less popular. Portions of the content are distributed in a plurality of content cache nodes, and locations where particular portions of the content are requested by users with greater frequency than other locations are determined. The content portions are then migrated to content cache nodes closer to the locations where the particular portions of the content are requested by users with greater frequency.

Abstract translation: 一种用于在多个内容高速缓存节点上分发内容以提供对内容的最佳访问的方法，网络和节点。 相关的，例如 流行的内容分发尽可能接近请求内容的概率最高的用户或用户组。 此外，当内容变得较少需求时，内容被重新定位到聚合网络中的高速缓存节点。 不太受欢迎 内容的部分被分配在多个内容高速缓存节点中，并且确定了具有比其他位置更大频率的用户请求内容的特定部分的位置。 然后将内容部分迁移到更接近内容的特定部分的位置的内容高速缓存节点，其中用户以更高的频率请求内容的特定部分。

公开(公告)号：WO2008066481A1

公开(公告)日：2008-06-05

申请号：PCT/SE2007/050894

申请日：2007-11-23

Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) ,  WELIN, Annikki ,  SOUZA, Victor

Inventor： WELIN, Annikki ,  SOUZA, Victor

IPC: H04L12/56 ,  H04L12/24

CPC classification number: H04L67/104 ,  H04L29/12028 ,  H04L29/12349 ,  H04L45/02 ,  H04L45/04 ,  H04L45/123 ,  H04L45/124 ,  H04L45/64 ,  H04L45/70 ,  H04L61/103 ,  H04L61/2507 ,  H04L67/1065

Abstract: A link state overlay routing protocol that is capable of routing based on flat identifiers is proposed. The very fundamental problem that exists with 5 routing based on flat identifiers is that the identifier space can not be aggregated. All existing routing is based on hierarchy and aggregations of IP- addresses to network addresses, so called subnetting. The proposed routing protocol is capable of deciding the best path to a destination taking into account different possible parameters (e.g., round trip time). The scalability of the 10 protocol is solved by not taking decisions based upon a single end-node identifier; instead the routing decisions are taken based on a network identifier.

Abstract translation: 提出了能够基于平面标识符进行路由的链路状态覆盖路由协议。 基于平面标识符的5路由存在的最根本的问题是无法聚合标识符空间。 所有现有的路由都是基于IP地址到网络地址的层次结构和聚合，所谓的子网划分。 所提出的路由协议能够考虑到不同的可能参数（例如，往返时间）来决定到达目的地的最佳路径。 10协议的可扩展性通过不基于单个端节点标识符进行决策来解决; 而是基于网络标识符来进行路由决定。

公开(公告)号：WO2011043706A1

公开(公告)日：2011-04-14

申请号：PCT/SE2009/051123

申请日：2009-10-08

Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) ,  HALÉN, Joacim ,  KÖLHI, Johan ,  SOUZA, Victor ,  MÅNGS, Jan-Erik

Inventor： HALÉN, Joacim ,  KÖLHI, Johan ,  SOUZA, Victor ,  MÅNGS, Jan-Erik

IPC: H04L12/18

CPC classification number: H04L65/80 ,  H04L12/1881 ,  H04L49/90 ,  H04L65/4084 ,  H04N21/26616 ,  H04N21/6405 ,  H04N21/6408 ,  H04N21/64784

Abstract: The present invention relates to methods and arrangements to synchronize data streams in a Multicast Services Control System (MSCS) for digital information transport. A first stream (Multicast) and a second stream (Catch-up) are received at a Synchronization Function (6), and the second stream is forwarded to a receiver (3) via a Stream Switch Function (4). The method comprises the following steps: Calculated canonical checksums (CS (i) CANONICAL1) for at least one packet in the first stream is compared with calculated canonical checksums (CS (n) CANONICAL2) for at least one packet in the second stream, when the streams pass the synchronization function. Correspondence between two compared canonical checksums (CS (i) CANONICAL1, CS (n) CANONICAL2) is detected. The Stream Switch Function is switched over from the second stream (Catch-up) to instead forward the first stream (Multicast) to the receiver.

Abstract translation: 本发明涉及在用于数字信息传输的多播服务控制系统（MSCS）中同步数据流的方法和装置。 在同步功能（6）处接收第一流（多播）和第二流（Catch-up），并且通过流切换功能（4）将第二流转发到接收器（3）。 该方法包括以下步骤：将第一流中的至少一个分组的计算规范校验和（CS（i）CANONICAL1）与计算的规范校验和（CS（n）CANONICAL2）比较，用于第二个流中的至少一个分组，当 流通过同步功能。 检测到两个比较规范校验和（CS（i）CANONICAL1，CS（n）CANONICAL2）之间的对应关系。 流切换功能从第二个流（Catch-up）切换，而不是将第一个流（Multicast）转发到接收器。

公开(公告)号：WO2010145709A1

公开(公告)日：2010-12-23

申请号：PCT/EP2009/057632

申请日：2009-06-18

Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) ,  SOUZA, Victor ,  HELLKVIST, Stefan

Inventor： SOUZA, Victor ,  HELLKVIST, Stefan

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L69/14

Abstract: 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.

Abstract translation: 描述了在网络中使用的客户端节点。 客户端节点包括用于从网络请求数据的发射机。 处理器可操作地连接到发射机，并且在其上安装有操作系统和应用。 用于从网络接收数据的接收器可操作地连接到处理器。 应用程序被安排为通过向操作系统打开传输套接字来从网络请求内容数据。 操作系统被安排为与网络中的主对等服务器建立联系，通过这样的传输套接字信令从主对等服务器接收内容数据的源的列表，并且从源列表中的至少一个源建立联系 。 该应用被安排为从至少一个源接收内容数据，而不知道内容是由源列表中的至少一个源传送的。 源列表可以包括P2P网络中的节点。

公开(公告)号：WO2009152865A3

公开(公告)日：2010-05-27

申请号：PCT/EP2008057885

申请日：2008-06-20

Applicant: ERICSSON TELEFON AB L M ,  SOUZA VICTOR ,  MELO DE BRITO CARVALHO TEREZA ,  DAMOLA AYODELE ,  SANCHEZ GALLO DIEGO

Inventor： SOUZA VICTOR ,  MELO DE BRITO CARVALHO TEREZA ,  DAMOLA AYODELE ,  SANCHEZ GALLO DIEGO

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L63/123 ,  H04L65/607 ,  H04L67/108 ,  H04L67/28 ,  H04L67/2842 ,  H04N21/4788 ,  H04N21/6405 ,  H04N21/64322

Abstract: The invention relates to a method and system hardware for ingesting media content in a peer-to-peer network from a data stream. The data stream is made up of a sequence of packets of media data, and each packet is identified by a sequence identifier. The method includes commencing caching of the data packets from the data stream. A missing data packet is identified using the sequence identifiers of the packets and the size of the missing data packet is determined. A portion of the memory medium is skipped to provide a skipped portion of medium having no data cached therein. The skipped portion has a size corresponding to the determined size of the missing data packet. The missing data packet is then retrieved and inserted into the skipped portion of the memory medium. The system includes an ingestion element configured to receive the content in a data stream, to define blocks of media data that make up the content, to generate metadata associated with each block, the metadata identifying the construction of the block from the data stream, and to transmit the data stream as a multicast stream to other network nodes. The other network nodes include at least one cache element configured to construct at least one of the blocks from the multicast data stream in accordance with the metadata, and to cache the data block. The system also includes a database accessible to network nodes, the database recording a location of each of the cached data blocks in the network.

Abstract translation: 本发明涉及一种从数据流中摄取对等网络中的媒体内容的方法和系统硬件。 数据流由媒体数据分组的序列组成，每个分组由序列标识符标识。 该方法包括从数据流开始缓存数据分组。 使用分组的序列标识符识别丢失的数据分组，并且确定丢失的数据分组的大小。 跳过存储介质的一部分以提供其中没有数据被缓存的介质的跳过部分。 跳过部分具有与确定的丢失数据分组大小相对应的大小。 然后检索丢失的数据分组并将其插入到存储介质的跳过部分中。 该系统包括摄取元件，其被配置为接收数据流中的内容，以定义组成内容的媒体数据块，以生成与每个块相关联的元数据，从数据流中标识块的构造的元数据，以及 将数据流作为组播流发送到其他网络节点。 其他网络节点包括至少一个高速缓存元件，其被配置为根据元数据从多播数据流中构建至少一个块，并且缓存该数据块。 该系统还包括可由网络节点访问的数据库，数据库记录网络中每个高速缓存的数据块的位置。

公开(公告)号：WO2008135304A1

公开(公告)日：2008-11-13

申请号：PCT/EP2008/053141

申请日：2008-03-17

Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (publ) ,  SOUZA, Victor ,  WELIN, Annikki

Inventor： SOUZA, Victor ,  WELIN, Annikki

IPC: H04L29/08

CPC classification number: H04L67/104 ,  H04L67/04 ,  H04L67/1065 ,  H04L67/1089

Abstract: File sharing between mobile devices is enabled using a hierarchical Distributed Hash Table (DHT) based message routing system. According to one embodiment, mobile device electronic content is shared via an overlay network of computer nodes arranged according to a hierarchical DHT by a mobile device generating a message. The message includes a key configured to identify mobile device electronic content and to enable routing of the message based on the hierarchical DHT through the overlay network upon reception of the message at any of the computer nodes. The message is transmitted to a packet-switched radio access network, the packet-switched radio access network configured to send the message to one or more of the computer nodes.The message is eventually routed to the computer node responsible for the key. The responsible computer node processes the message, e.g., by registering electronic content, deregistering electronic content or responding to an electronic content request.

Abstract translation: 使用分层分布式哈希表（DHT）消息路由系统启用移动设备之间的文件共享。 根据一个实施例，移动设备电子内容经由生成消息的移动设备根据分层DHT排列的计算机节点的覆盖网络共享。 消息包括被配置为识别移动设备电子内容并且在任何计算机节点处接收到消息时通过覆盖网络基于分层DHT来路由消息的密钥。 该消息被发送到分组交换无线电接入网络，分组交换无线电接入网络被配置为将消息发送到一个或多个计算机节点。消息最终被路由到负责该密钥的计算机节点。 负责的计算机节点处理消息，例如通过注册电子内容，注销电子内容或响应电子内容请求。