-
公开(公告)号：US20080301246A1
公开(公告)日：2008-12-04
申请号：US12097963
申请日：2006-12-04
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L29/06 , H04L67/108 , H04L67/22 , H04L67/24 , H04L69/329
摘要： A wire protocol is described which implements connection management and other methods to give enhanced peer-to-peer content distribution. Connections between nodes can be placed in a “notify” state when they are idle but may soon yield useful content. This notify state is also used together with a content request/response cycle to allow a peer to evaluate content available at a neighbour. If no suitable content is available a notify state is entered. When new content is later received at the neighbour it is able to inform the requesting node to allow it to restart the content request/response cycle.
摘要翻译： 描述了一种实现连接管理和其他方法以提供增强的对等内容分发的有线协议。 节点之间的连接可以在空闲时处于“通知”状态，但可能会很快产生有用的内容。 该通知状态也与内容请求/响应周期一起使用，以允许对等体评估邻居可用的内容。 如果没有合适的内容可用，则输入通知状态。 当在邻居稍后接收到新内容时，能够通知请求节点允许其重启内容请求/响应周期。
-
公开(公告)号：US07912948B2
公开(公告)日：2011-03-22
申请号：US12097963
申请日：2006-12-02
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L29/06 , H04L67/108 , H04L67/22 , H04L67/24 , H04L69/329
摘要： A wire protocol is described which implements connection management and other methods to give enhanced peer-to-peer content distribution. Connections between nodes can be placed in a “notify” state when they are idle but may soon yield useful content. This notify state is also used together with a content request/response cycle to allow a peer to evaluate content available at a neighbour. If no suitable content is available a notify state is entered. When new content is later received at the neighbour it is able to inform the requesting node to allow it to restart the content request/response cycle.
摘要翻译： 描述了一种实现连接管理和其他方法以提供增强的对等内容分发的有线协议。 节点之间的连接可以在空闲时处于“通知”状态，但可能会很快产生有用的内容。 该通知状态也与内容请求/响应周期一起使用，以允许对等体评估邻居可用的内容。 如果没有合适的内容可用，则输入通知状态。 当在邻居稍后接收到新内容时，能够通知请求节点允许其重启内容请求/响应周期。
-
公开(公告)号：US07849196B2
公开(公告)日：2010-12-07
申请号：US12097946
申请日：2006-12-04
IPC分类号： G06F15/173
CPC分类号： H04L67/104 , H04L67/06 , H04L67/1085
摘要： A topology management process is implemented which involves removing or “tearing down” connections between nodes in certain situations in order to try to replace those connections with more optimal ones. Idle connections are torn down unless those are in a “notify” state; a notify state being one in which a request for content has been made to a neighbour but that neighbour has no available content as yet. Idle connections in a notify state are torn down only if they remain idle for a longer time than that required before an idle connection is torn down. To avoid problems caused by clusters of node forming and of loners being unable to join the cloud, network churn algorithms are taught. These involve requiring nodes to drop connections when specified conditions are met. Relative content distribution between connections is monitored and this information used to influence selection of those connections to drop.
摘要翻译： 实现了拓扑管理过程，其涉及在某些情况下删除或“拆除”节点之间的连接，以便尝试用更优选的连接替换这些连接。 空闲连接被拆除，除非它们处于“通知”状态; 通知状态是向邻居做出对内容的请求的通知状态，但是该邻居还没有可用的内容。 通知状态下的空闲连接只有在空闲连接断开之前保持空闲时间较长的时间才会被拆除。 为了避免由于节点形成的簇和不能加入云的孤岛造成的问题，教授了网络流失算法。 这些涉及要求节点在满足指定条件时删除连接。 监视连接之间的相对内容分配，并将此信息用于影响这些连接的选择。
-
公开(公告)号：US20080320300A1
公开(公告)日：2008-12-25
申请号：US12097926
申请日：2006-12-04
申请人： Christos Gkantsidis , John Miller , Stuart Ranson , Aamer Hydrie , Tan See-Mong , Pablo Rodriguez Rodriguez , Manuel Costa
发明人： Christos Gkantsidis , John Miller , Stuart Ranson , Aamer Hydrie , Tan See-Mong , Pablo Rodriguez Rodriguez , Manuel Costa
CPC分类号： G06F21/10 , G06F2221/0788
摘要： The invention relates to content distribution over a network and provides methods of controlling the distribution, of receiving the content and of publishing content. The method of controlling distribution of content over a network includes receiving a content description and location information for a source of the content from a publisher, where the content description comprises authorisation details associated with the publisher. The validity of the authorisation details is checked and if found to be valid, the content description is provided to a node in the network
摘要翻译： 本发明涉及网络上的内容分发，并且提供了控制分发，接收内容和发布内容的方法。 通过网络控制内容分发的方法包括从发布者接收内容来源的内容描述和位置信息，其中内容描述包括与发布者相关联的授权细节。 检查授权细节的有效性，如果发现有效，则将内容描述提供给网络中的节点
-
公开(公告)号：US20080294779A1
公开(公告)日：2008-11-27
申请号：US12097946
申请日：2006-12-04
IPC分类号： G06F15/173
CPC分类号： H04L67/104 , H04L67/06 , H04L67/1085
摘要： A topology management process is implemented which involves removing or “tearing down” connections between nodes in certain situations in order to try to replace those connections with more optimal ones. Idle connections are torn down unless those are in a “notify” state; a notify state being one in which a request for content has been made to a neighbour but that neighbour has no available content as yet. Idle connections in a notify state are torn down only if they remain idle for a longer time than that required before an idle connection is torn down. To avoid problems caused by clusters of node forming and of loners being unable to join the cloud, network churn algorithms are taught. These involve requiring nodes to drop connections when specified conditions are met. Relative content distribution between connections is monitored and this information used to influence selection of those connections to drop.
摘要翻译： 实现了拓扑管理过程，其涉及在某些情况下删除或“拆除”节点之间的连接，以便尝试用更优选的连接替换这些连接。 空闲连接被拆除，除非它们处于“通知”状态; 通知状态是向邻居做出对内容的请求的通知状态，但是该邻居还没有可用的内容。 通知状态下的空闲连接只有在空闲连接断开之前保持空闲时间较长的时间才会被拆除。 为了避免由于节点形成的簇和不能加入云的孤岛造成的问题，教授了网络流失算法。 这些涉及要求节点在满足指定条件时删除连接。 监视连接之间的相对内容分配，并将此信息用于影响这些连接的选择。
-
公开(公告)号：US09729624B2
公开(公告)日：2017-08-08
申请号：US12097980
申请日：2006-12-04
CPC分类号： H04L67/104 , H03M13/3761 , H04L67/1076 , H04L67/108
摘要： The invention provides methods of encoding content for distribution over a network and methods for decoding encoded content which has been distributed over the network. In a first example in which the content is divided into a plurality of segments and each segment comprising a plurality of blocks of data, the method comprises selecting a segment from the plurality of segments and selecting at least two blocks of the selected segment from a store of blocks. A new encoded block is created from a linear combination of the selected blocks.
-
公开(公告)号：US20090248898A1
公开(公告)日：2009-10-01
申请号：US12097980
申请日：2006-12-04
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H03M13/3761 , H04L67/1076 , H04L67/108
摘要： The invention provides methods of encoding content for distribution over a network and methods for decoding encoded content which has been distributed over the network. In a first example in which the content is divided into a plurality of segments and each segment comprising a plurality of blocks of data, the method comprises selecting a segment from the plurality of segments and selecting at least two blocks of the selected segment from a store of blocks. A new encoded block is created from a linear combination of the selected blocks.
摘要翻译： 本发明提供了对通过网络分发的内容进行编码的方法以及用于对已经通过网络分发的经编码的内容进行解码的方法。 在内容被划分为多个片段并且每个片段包括多个数据块的第一示例中，该方法包括从多个片段中选择片段并从商店中选择所选片段的至少两个片段 的块。 从所选块的线性组合创建新的编码块。
-
公开(公告)号：US20060209704A1
公开(公告)日：2006-09-21
申请号：US11072525
申请日：2005-03-07
申请人： John Miller , Manuel Costa , Noah Horton , Christian Huitema , Sandeep Singhal
发明人： John Miller , Manuel Costa , Noah Horton , Christian Huitema , Sandeep Singhal
IPC分类号： H04L12/26
CPC分类号： H04L67/104 , H04L43/0858 , H04L43/0864 , H04L43/12 , H04L67/1046 , H04L67/1068
摘要： A method is provided for a host node in a computer network to determine its coordinates in a d-dimensional network space, comprising discovering an address of a peer node in the network, measuring network latency between the host node and the peer node, determining whether network latency has been measured for at least d+1 peer nodes, where, if network latency has not been measured for at least d+1 peer nodes, estimating the network coordinates of the host node, and where, if network latency has been measured for at least d+1 peer nodes, calculating the network coordinates of the host node using d+1 measured latencies.
摘要翻译： 提供了一种用于计算机网络中的主机节点来确定其在d维网络空间中的坐标的方法，包括发现网络中的对等节点的地址，测量主机节点和对等节点之间的网络等待时间，确定是否 已经对至少d + 1个对等节点测量了网络延迟，其中，如果尚未对至少d + 1个对等节点进行网络延迟测量，则估计主机节点的网络坐标，以及如果已经测量了网络延迟 对于至少d + 1个对等节点，使用d + 1测量的延迟来计算主机节点的网络坐标。
-
公开(公告)号：US08310956B2
公开(公告)日：2012-11-13
申请号：US12883346
申请日：2010-09-16
CPC分类号： H04L67/104 , H04L43/0858 , H04L43/0864 , H04L43/12 , H04L67/1046 , H04L67/1068
摘要： A method is provided for a host node in a computer network to determine its coordinates in a d-dimensional network space, comprising discovering an address of a peer node in the network, measuring network latency between the host node and the peer node, determining whether network latency has been measured for at least d+1 peer nodes, where, if network latency has not been measured for at least d+1 peer nodes, estimating the network coordinates of the host node, and where, if network latency has been measured for at least d+1 peer nodes, calculating the network coordinates of the host node using d+1 measured latencies.
摘要翻译： 提供了一种用于计算机网络中的主机节点来确定其在d维网络空间中的坐标的方法，包括发现网络中的对等节点的地址，测量主机节点和对等节点之间的网络等待时间，确定是否 已经对至少d + 1个对等节点测量了网络延迟，其中，如果尚未对至少d + 1个对等节点进行网络延迟测量，则估计主机节点的网络坐标，以及如果已经测量了网络延迟 对于至少d + 1个对等节点，使用d + 1测量的延迟来计算主机节点的网络坐标。
-
公开(公告)号：US20090282393A1
公开(公告)日：2009-11-12
申请号：US12306188
申请日：2007-05-04
申请人： Manuel Costa , Miguel Castro , Tim Harris
发明人： Manuel Costa , Miguel Castro , Tim Harris
IPC分类号： G06F9/06
摘要： The majority of such software attacks exploit software vulnerabilities or flaws to write data to unintended locations. For example, control-data attacks exploit buffer overflows or other vulnerabilities to overwrite a return address in the stack, a function pointer, or some other piece of control data. Non-control-data attacks exploit similar vulnerabilities to overwrite security critical data without subverting the intended control flow in the program. We describe a method for securing software against both control-data and non-control-data attacks. A static analysis is carried out to determine data flow information for a software program. Data-flow tracking instructions are formed in order to track data flow during execution or emulation of that software. Also, checking instructions are formed to check the tracked data flow against the static analysis results and thereby identify potential attacks or errors. Optional optimisations are described to reduce the resulting additional overheads.
摘要翻译： 大多数此类软件攻击利用软件漏洞或漏洞将数据写入非预期位置。 例如，控制数据攻击利用缓冲区溢出或其他漏洞来覆盖堆栈中的返回地址，函数指针或其他一些控制数据。 非控制数据攻击利用类似的漏洞来覆盖安全关键数据，而不会破坏程序中的预期控制流程。 我们描述一种保护软件免受控制数据和非控制数据攻击的方法。 进行静态分析以确定软件程序的数据流信息。 形成数据流跟踪指令，以便在执行或仿真该软件期间跟踪数据流。 此外，形成检查指令以根据静态分析结果检查跟踪的数据流，从而识别潜在的攻击或错误。 描述可选优化，以减少所产生的额外开销。
-
-
-
-
-
-
-
-
-
搜索结果
28 条记录 (耗时 0.025 秒)