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

1. 发明授权

US09355043B2 Cache replacement method and system 有权
标题翻译：高速缓存替换方法和系统
公开(公告)号：US09355043B2
公开(公告)日：2016-05-31
申请号：US14239419
申请日：2011-09-15
申请人： Djamel Sadok , Josilene Aires Moreira , Márcio De Mendonca Neves , Victor Souza
发明人： Djamel Sadok , Josilene Aires Moreira , Márcio De Mendonca Neves , Victor Souza
IPC分类号： G06F12/12 , H04N21/231 , H04L29/08
CPC分类号： G06F12/126 , H04L67/2852 , H04N21/23113
摘要： A system, computer readable medium and method for managing objects in a cache. The method includes receiving a request for a desired object that is not stored in the cache; determining, based on an admission policy, whether one or more segments of a least popular existing object need to be removed from the cache for admitting one or more segments of the desired object into the cache; removing, when there is no space in the cache for the desired object, the one or more segments of the least popular existing object from the cache based on a replacement policy, wherein the replacement policy includes a caching priority function for determining that the least popular existing object is the least popular object of all objects stored by the cache; and admitting at least one segment of the desired object into the cache.
摘要翻译：一种用于管理高速缓存中的对象的系统，计算机可读介质和方法。该方法包括接收对未存储在高速缓存中的期望对象的请求; 基于接纳策略确定是否需要从高速缓存中移除最不常用的现有对象的一个或多个段，以便将所需对象的一个或多个段接纳到高速缓存中; 当所述缓存中的所述对象没有空间时，基于替换策略从所述高速缓存中删除所述最不常用的现有对象的所述一个或多个段，其中所述替换策略包括用于确定所述最不常用的缓存的高速缓存优先级功能现有对象是由缓存存储的所有对象中最不受欢迎的对象; 并将所需对象的至少一个段接纳到高速缓存中。

2. 发明授权

US09313268B2 Methods and arrangements for prioritization in a peer-to-peer network 有权
标题翻译：对等网络中优先级的方法和安排
公开(公告)号：US09313268B2
公开(公告)日：2016-04-12
申请号：US13254374
申请日：2009-03-03
申请人： Victor Souza , Tereza Carvalho , Ayodele Damola , Diego Gallo
发明人： Victor Souza , Tereza Carvalho , Ayodele Damola , Diego Gallo
IPC分类号： G06F15/16 , H04L29/08 , H04L29/06
CPC分类号： H04L67/104 , H04L29/06 , H04L29/08072 , H04L65/4084 , H04L65/80 , H04L67/322
摘要： 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 the urgency indicator from the request and apply a priority mechanism which uses the urgency indicator to select which peers to upload data content to.
摘要翻译：本发明涉及用于与对等网络结合使用以共享数据内容的节点和方法。引入优先级机制，借助于该优先级机制，服务对等体可以根据其对紧急程度的数据内容的需要来选择哪个请求对等体进行服务。请求对等体可以在对数据内容的请求中包括紧急指示符，其例如可以是可用于在视频缓冲器中重放的缓冲数据量。然后，服务对等体可以从请求中提取紧急指示符，并应用使用紧急指示符的优先级机制来选择哪些对等体上传数据内容。

3. 发明授权

US09225778B2 System for delivery of content to be played autonomously 有权
标题翻译：用于交付要自动播放的内容的系统
公开(公告)号：US09225778B2
公开(公告)日：2015-12-29
申请号：US12991565
申请日：2008-06-04
申请人： Victor Souza
发明人： Victor Souza
IPC分类号： G06F15/16 , H04L29/08
CPC分类号： H04L67/104 , H04L67/06 , H04L67/1076
摘要： The dynamicity of current content delivery environments demands the use of highly complex algorithms. A content delivery system for delivering content to clients in a content delivery network is disclosed and further comprises a method for placing the content in the content delivery network. The content delivery system comprises at least one mobile object adapted to be executed on the content delivery system but also adapted to be executed on other content delivery systems. Each mobile object comprises a media file and is adapted to monitor data related to the clients access of the media file. When certain conditions are met, e.g. when many clients that are accessing the media file are closer to another content delivery system, the mobile object can decide to move or copy itself to the other content delivery system.
摘要翻译：当前内容传送环境的动态性要求使用高度复杂的算法。公开了一种用于向内容传送网络中的客户端传送内容的内容传送系统，并且还包括用于将内容放置在内容传送网络中的方法。内容传送系统包括适于在内容传送系统上执行的至少一个移动对象，但也适于在其他内容传送系统上执行。每个移动对象包括媒体文件，并且适于监视与客户端访问媒体文件相关的数据。当满足某些条件时，例如当访问媒体文件的许多客户端更靠近另一内容传送系统时，移动对象可以决定将自身移动或复制到另一内容传送系统。

4. 发明授权

US09083717B2 Data flow in peer-to-peer networks 有权
标题翻译：对等网络中的数据流
公开(公告)号：US09083717B2
公开(公告)日：2015-07-14
申请号：US13379201
申请日：2009-06-18
申请人： Victor Souza , Stefan Hellkvist
发明人： Victor Souza , Stefan Hellkvist
IPC分类号： H04L29/08 , 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网络中的节点。

5. 发明申请

US20140223107A1 Cache Replacement Method and System 有权
标题翻译：缓存替换方法和系统
公开(公告)号：US20140223107A1
公开(公告)日：2014-08-07
申请号：US14239419
申请日：2011-09-15
申请人： Djamel Sadok , Josilene Aires Moreira , Márcio De Mendonca Neves , Victor Souza
发明人： Djamel Sadok , Josilene Aires Moreira , Márcio De Mendonca Neves , Victor Souza
IPC分类号： G06F12/12
CPC分类号： G06F12/126 , H04L67/2852 , H04N21/23113
摘要： A system, computer readable medium and method for managing objects in a cache. The method includes receiving a request for a desired object that is not stored in the cache; determining, based on an admission policy, whether one or more segments of a least popular existing object need to be removed from the cache for admitting one or more segments of the desired object into the cache; removing, when there is no space in the cache for the desired object, the one or more segments of the least popular existing object from the cache based on a replacement policy, wherein the replacement policy includes a caching priority function for determining that the least popular existing object is the least popular object of all objects stored by the cache; and admitting at least one segment of the desired object into the cache.
摘要翻译：一种用于管理高速缓存中的对象的系统，计算机可读介质和方法。该方法包括接收对未存储在高速缓存中的期望对象的请求; 基于接纳策略确定是否需要从高速缓存中移除最不常用的现有对象的一个或多个段，以便将所需对象的一个或多个段接纳到高速缓存中; 当所述缓存中的所述对象没有空间时，基于替换策略从所述高速缓存中删除所述最不常用的现有对象的所述一个或多个段，其中所述替换策略包括用于确定所述最不常用的缓存的高速缓存优先级功能现有对象是由缓存存储的所有对象中最不受欢迎的对象; 并将所需对象的至少一个段接纳到高速缓存中。

6. 发明申请

US20130007823A1 METHOD FOR RETRANSMISSION USING CHECKSUMS FOR IDENTIFYING LOST DATA PACKETS 有权
标题翻译：使用检查器识别丢失数据包的重新生成方法
公开(公告)号：US20130007823A1
公开(公告)日：2013-01-03
申请号：US13499806
申请日：2009-10-02
申请人： Jan-Erik Mangs , Joacim Halen , Johan Kolhi , Victor Souza
发明人： Jan-Erik Mangs , Joacim Halen , Johan Kolhi , Victor Souza
IPC分类号： H04L1/08 , H04N21/647 , G06F11/14
CPC分类号： H04N7/17318 , H04L1/0061 , H04L1/1832 , H04L1/1838 , H04L65/4076 , H04N21/6375 , H04N21/6377 , H04N21/658
摘要： The present invention relates to a method for retransmission of lost data, a receiving device operating according to the invented method and a retransmission server. In the absence of a unique identifier per data packet or data frame, there is obviously a problem to directly identify a specific data packet, data block or data frame in the stream and retransmission can't take place with current technologies. The object of the present invention is to offer a retransmission method and means for making said retransmission of missing data packets possible in the absence of a unique identifier.
摘要翻译：本发明涉及一种重传丢失数据的方法，一种根据本发明的方法操作的接收设备和一种重传服务器。在没有每个数据包或数据帧的唯一标识符的情况下，直接识别流中的特定数据分组，数据块或数据帧显然存在问题，并且重传不能用当前技术进行。本发明的目的是提供一种重传方法和装置，用于在没有唯一标识符的情况下使所述丢失数据分组的重传成为可能。

7. 发明申请

US20120036105A1 Method and Apparatus for Distributing Data in a Peer-To-Peer Network 审中-公开
标题翻译：用于在对等网络中分发数据的方法和装置
公开(公告)号：US20120036105A1
公开(公告)日：2012-02-09
申请号：US13146638
申请日：2009-02-17
申请人： Victor Souza , Kent Bogestam , Ayodele Damola
发明人： Victor Souza , Kent Bogestam , Ayodele Damola
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： H04N7/17318 , H04L67/1002 , H04L67/1008 , H04L67/104 , H04L67/1063 , H04L67/1074 , H04N7/17336 , H04N21/23113 , H04N21/4788 , H04N21/632 , H04N21/6587 , H04N21/8355
摘要： 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, sending the data item to a number of data receiving peers from one or more data servers, 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, and, if it is, deleting previously stored data to make sufficient storage capacity available.
摘要翻译：根据本发明的第一方面，提供了一种将数据分发到对等网络的对等体以使得对等体能够向其他对等体提供数据的方法。该方法包括预定义存储数据项所需的对等体的最小数量，将数据项发送到来自一个或多个数据服务器的多个数据接收对等体，确定具有足够存储容量的数据接收对等体的数量是否可用存储数据项小于预定义的最小数量，如果是，删除先前存储的数据以使足够的存储容量可用。

8. 发明申请

US20110302604A1 METHODS AND ARRANGEMENTS FOR SYSTEM PROVIDING MEDIA VIA MULTICAST DISTRIBUTION 有权
标题翻译：通过多媒体分发系统提供媒体的方法和安排
公开(公告)号：US20110302604A1
公开(公告)日：2011-12-08
申请号：US13201613
申请日：2009-11-23
申请人： Joacim Halén , Victor Souza
发明人： Joacim Halén , Victor Souza
IPC分类号： H04N5/445
CPC分类号： H04L65/4084 , H04L65/80 , H04N21/222 , H04N21/23106 , H04N21/2405 , H04N21/26616 , H04N21/4384 , H04N21/6405 , H04N21/6408 , H04N21/64322
摘要： The present invention relates to a server and a method for achieving a fast channel change in e.g. an IPTV system. This is achieved by selecting a source for retrieving the requested channel based on the current load of the FCC server. The source may be the streaming server providing the regular multicast stream or a buffer providing a buffered version of the requested channel. According to one embodiment requests for fast channel change (relating to the same channel) are grouped and served and served as a bundle over multicast. By doing that one can alleviate the load on the FCC server and the network since multiple clients can share the same stream.
摘要翻译：本发明涉及一种服务器和一种实现例如快速通道改变的方法。 IPTV系统。这通过基于FCC服务器的当前负载来选择用于检索所请求的信道的源来实现。源可以是提供常规多播流的流服务器或提供所请求信道的缓冲版本的缓冲器。根据一个实施例，对快速信道改变的请求（与相同信道相关）被分组和服务并且被用作多播的捆绑。通过这样做，可以减轻FCC服务器和网络上的负载，因为多个客户端可以共享相同的流。

9. 发明申请

US20100061385A1 METHOD AND SYSTEM FOR PROVIDING A ROUTING ARCHITECTURE FOR OVERLAY NETWORKS 有权
标题翻译：为覆盖网络提供路由架构的方法和系统
公开(公告)号：US20100061385A1
公开(公告)日：2010-03-11
申请号：US12516470
申请日：2007-11-23
申请人： Annikki Welin , Victor Souza
发明人： Annikki Welin , Victor Souza
IPC分类号： H04L12/56 , H04L9/00
CPC分类号： H04L67/104 , H04L29/12028 , H04L29/12349 , H04L45/02 , H04L45/04 , H04L45/123 , H04L45/124 , H04L45/64 , H04L45/70 , H04L61/103 , H04L61/2507 , H04L67/1065
摘要： 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.
摘要翻译：提出了能够基于平面标识符进行路由的链路状态覆盖路由协议。基于平面标识符的5路由存在的最根本的问题是无法聚合标识符空间。所有现有的路由都是基于IP地址到网络地址的层次结构和聚合，所谓的子网划分。所提出的路由协议能够考虑到不同的可能参数（例如，往返时间）来决定到达目的地的最佳路径。 10协议的可扩展性通过不基于单个端节点标识符进行决策来解决; 而是基于网络标识符来进行路由决定。

10. 发明授权

US08913525B2 Method of merging distributed hash table (DHT) rings in heterogeneous network domains 有权
标题翻译：在异构网络域中合并分布式哈希表（DHT）环的方法
公开(公告)号：US08913525B2
公开(公告)日：2014-12-16
申请号：US13488907
申请日：2012-06-05
申请人： Annikki Welin , Victor Souza
发明人： Annikki Welin , Victor Souza
IPC分类号： H04L12/28 , H04L29/08 , H04L12/721 , H04L12/751 , H04L29/12 , H04L12/715
CPC分类号： H04L67/104 , H04L29/12028 , H04L29/12349 , H04L45/02 , H04L45/04 , H04L45/123 , H04L45/124 , H04L45/64 , H04L45/70 , H04L61/103 , H04L61/2507 , H04L67/1065
摘要： A method of merging Distributed Hash Table (DHT) rings in heterogeneous network domains, where each domain includes a DHT ring. Upon determining that a node is common to first and second DHT rings on the same hierarchical level and having at least one Overlay Router in common, a link is started between a node in the first DHT ring and a node in the second DHT ring by establishing an indirect link through the common node. An indirect link is created between the first and second DHT rings, and virtual links are created to DHT rings positioned higher in the DHT ring hierarchy until all the DHT rings are merged into a single logical ring.
摘要翻译：在异构网络域中合并分布式散列表（DHT）环的方法，其中每个域包括DHT环。在确定节点对于相同层级上的第一和第二DHT环并且具有共同的至少一个覆盖路由器是公共的时，通过建立在第一DHT环中的节点和第二DHT环中的节点之间的链路来启动链路通过公共节点的间接链接。在第一和第二DHT环之间创建间接链接，并且将虚拟链路创建为位于DHT环层级中较高的DHT环，直到所有DHT环合并为单个逻辑环。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式