公开(公告)号：US08310956B2

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

申请号：US12883346

申请日：2010-09-16

申请人： John L. Miller ,  Manuel Costa ,  Noah Horton ,  Christian Huitema ,  Sandeep K. Singhal

发明人： John L. Miller ,  Manuel Costa ,  Noah Horton ,  Christian Huitema ,  Sandeep K. Singhal

IPC分类号： G01R31/08 ,  H04L12/28

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测量的延迟来计算主机节点的网络坐标。

公开(公告)号：US20120206380A1

公开(公告)日：2012-08-16

申请号：US13152991

申请日：2011-06-03

申请人： Weidong Zhao ,  David A. Stevens ,  Aleksandar Uzelac ,  Hrvoje Benko ,  John L. Miller

发明人： Weidong Zhao ,  David A. Stevens ,  Aleksandar Uzelac ,  Hrvoje Benko ,  John L. Miller

IPC分类号： G06F3/041

CPC分类号： G06F3/04883 ,  G06F3/0416 ,  G06F3/0418 ,  G06F3/0488 ,  G06F3/04886

摘要： In embodiments of prediction-based touch contact tracking, touch input sensor data is recognized as a series of components of a contact on a touch-screen display. A first component of the contact can be identified, and a second component can be determined to correlate to the contact. The first component and the second component can then be associated to represent a tracking of the contact. Subsequent components of the contact can be determined and associated with the previous components of the contact to further represent the tracking of the contact.

摘要翻译： 在基于预测的触摸触摸跟踪的实施例中，触摸输入传感器数据被识别为触摸屏显示器上的联系人的一系列组件。 可以识别接触的第一分量，并且可以确定第二分量以与接触相关。 然后可以将第一组件和第二组件相关联以表示联系人的跟踪。 联系人的后续组件可以确定并与联系人的先前组件相关联，以进一步表示联系人的跟踪。

公开(公告)号：US20120098972A1

公开(公告)日：2012-04-26

申请号：US13024210

申请日：2011-02-09

申请人： Joel A. Hansen ,  John L. Miller ,  M. Stuart Worley ,  Noel Jolivet

发明人： Joel A. Hansen ,  John L. Miller ,  M. Stuart Worley ,  Noel Jolivet

IPC分类号： H04N5/33

CPC分类号： H04N5/23293 ,  G02B23/10 ,  G02B23/12 ,  G02B23/18 ,  G06K9/6201 ,  G06T11/001 ,  G06T11/60 ,  H04N5/2252 ,  H04N5/2254 ,  H04N5/2258 ,  H04N5/232 ,  H04N5/23212 ,  H04N5/23296 ,  H04N5/272 ,  H04N5/33

摘要： Binocular system, including method and apparatus, for viewing a scene. The system may comprise a left camera and a right camera that create left and right video signals from detected optical radiation. At least one of the cameras may include a sensor that is sensitive to infrared radiation. The system also may comprise a left display and a right display arranged to be viewed by a pair of eyes. The left and right displays may be configured to present respective left video images and right video images formed with visible light based respectively on the left and right video signals.

摘要翻译： 双眼系统，包括方法和装置，用于观看场景。 该系统可以包括从检测到的光辐射产生左和右视频信号的左摄像机和右摄像机。 至少一个照相机可以包括对红外辐射敏感的传感器。 该系统还可以包括布置成由一对眼睛观看的左显示器和右显示器。 左右显示器可以被配置为分别基于左视频信号和右视频信号呈现与可见光形成的相应的左视频图像和右视频图像。

公开(公告)号：US08090861B2

公开(公告)日：2012-01-03

申请号：US12301462

申请日：2007-04-05

申请人： John L. Miller ,  Armando Garcia-Mendoza ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

发明人： John L. Miller ,  Armando Garcia-Mendoza ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L67/06 ,  H04L67/108

摘要： Managing content by influencing its distribution in the form of blocks or other units is crucial to the performance of a peer-to-peer content distribution system. We provide a content management module at each peer node to achieve this. The content management module implements a content request/response cycle in order to negotiate about blocks of content with other peer nodes. This cycle comprises an offer request, offer reply and a block request. These steps are preferably followed by data exchange and verification. The negotiation protocol used by our content management module provides a generic method that is advantageously used in conjunction with different encoding schemes such as full network coding and group network coding. In one embodiment we use group network coding and add information to the offer request and offer reply to facilitate efficient content distribution. Block request messages are selected to promote the use of on-the-fly decoding where possible.

摘要翻译： 通过以块或其他单元的形式影响其分发来管理内容对于对等内容分发系统的性能至关重要。 我们在每个对等节点提供一个内容管理模块来实现这一点。 内容管理模块实现内容请求/响应周期，以便与其他对等节点协商内容块。 该周期包括报价请求，报价回复和块请求。 这些步骤最好是进行数据交换和验证。 我们的内容管理模块使用的协商协议提供了有利地与诸如全网络编码和组网络编码的不同编码方案结合使用的通用方法。 在一个实施例中，我们使用组网络编码并向提供请求添加信息并提供回复以促进有效的内容分发。 选择块请求消息以在可能的情况下促进即时解码的使用。

公开(公告)号：US07567987B2

公开(公告)日：2009-07-28

申请号：US10692501

申请日：2003-10-24

申请人： Michael Shappell ,  Ravi T. Rao ,  John L. Miller ,  Scott Senkeresty ,  Brian Lieuallen

发明人： Michael Shappell ,  Ravi T. Rao ,  John L. Miller ,  Scott Senkeresty ,  Brian Lieuallen

IPC分类号： G06F17/30 ,  G06F12/00

CPC分类号： H04L67/104 ,  G06F17/30067 ,  H04L29/06 ,  H04L67/1068 ,  H04L67/1095 ,  H04L69/329 ,  Y10S707/99952

摘要： A computer implemented method and system enable users to share files in a server-less shared space. By providing access to such spaces via a visual presentation, the system renders content available for access by other group members. Access is sometimes provided through propagation of metadata or other uniquely identifying indicia associated with the shared space to all group members.

摘要翻译： 计算机实现的方法和系统使用户能够在无服务器的共享空间中共享文件。 通过视觉呈现提供对这些空间的访问，系统呈现其他组成员可访问的内容。 访问有时通过将元数据或与共享空间相关联的其他唯一识别标记传播给所有群组成员来提供。

公开(公告)号：US07565432B2

公开(公告)日：2009-07-21

申请号：US11152588

申请日：2005-06-13

申请人： Christina Huitema ,  John L. Miller

发明人： Christina Huitema ,  John L. Miller

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： H04L29/12066 ,  H04L29/12811 ,  H04L61/1511 ,  H04L61/6009 ,  H04L67/104 ,  H04L67/1065

摘要： A serverless name resolution protocol ensures convergence despite the size of the network, without requiring an ever-increasing cache and with a reasonable numbers of hops. This convergence is ensured through a multi-level cache and a proactive cache initialization strategy. The multi-level cache is built based on a circular number space. Each level contains information from different levels of slivers of the circular space. A mechanism is included to add a level to the multi-level cache when the node determines that the last level is full. A peer-to-peer name resolution protocol (PNRP) includes a mechanism to allow resolution of names which are mapped onto the circular number space through a hash function. Further, the PNRP may also operate with the domain name system by providing each node with an identification consisting of a domain name service (DNS) component and a unique number.

摘要翻译： 无需服务器的名称解析协议确保收敛，尽管网络的大小，而不需要不断增加的缓存和合理的跳数。 这种融合通过多级缓存和主动缓存初始化策略来确保。 多级缓存基于循环数字空间构建。 每个级别都包含来自不同级别的圆形空间的信息。 当节点确定最后一个级别已满时，包括一个机制来向多级缓存添加级别。 对等名称解析协议（PNRP）包括允许通过散列函数映射到循环号码空间的名称的解析机制。 此外，PNRP还可以通过为每个节点提供由域名服务（DNS）组件和唯一号码组成的标识来与域名系统一起操作。

公开(公告)号：US07533184B2

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

申请号：US10461940

申请日：2003-06-13

申请人： John L. Miller ,  Henry Rawas ,  Radu Simionescu ,  Brian Lieuallen

发明人： John L. Miller ,  Henry Rawas ,  Radu Simionescu ,  Brian Lieuallen

IPC分类号： G06F15/16

CPC分类号： H04L61/1541 ,  H04J3/242 ,  H04L29/12113 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1065 ,  H04L69/22

摘要： An extensible data structure for messages in a peer to peer name resolution protocol is presented. This message data structure utilizes a number of fields, each containing a message element. Preferably, the first field is the message header that includes protocol information and identifies the type of message. Each message element contains a number of fields. These message element fields include a type field, a length field, and the content or payload of the message element. In one embodiment, at least ten messages are formed for proper operation of a Peer To Peer Name Resolution Protocol (PNRP), including RESOLVE, RESPONSE, SOLICIT, ADVERTISE, REQUEST, FLOOD, INQUIRE, AUTHORITY, ACK, and REPAIR messages.

摘要翻译： 介绍了对等名称解析协议中消息的可扩展数据结构。 该消息数据结构利用了多个字段，每个字段包含消息元素。 优选地，第一字段是包括协议信息并标识消息类型的消息头。 每个消息元素包含多个字段。 这些消息元素字段包括类型字段，长度字段以及消息元素的内容或有效载荷。 在一个实施例中，形成至少十个消息以用于对等对等名称解析协议（PNRP）的适当操作，包括RESOLVE，RESPONSE，SOLICIT，ADVERTISE，REQUEST，FLOOD，INQUIRE，AUTHORITY，ACK和REPAIR消息。

公开(公告)号：US20090006849A1

公开(公告)日：2009-01-01

申请号：US12138421

申请日：2008-06-13

申请人： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

发明人： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC分类号： H04L9/00 ,  G06F15/173

CPC分类号： H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

摘要： A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

摘要翻译： 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

公开(公告)号：US07444372B2

公开(公告)日：2008-10-28

申请号：US11375726

申请日：2006-03-15

申请人： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

发明人： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC分类号： G06F15/16 ,  H04L9/00

CPC分类号： H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

摘要： A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

公开(公告)号：US06912622B2

公开(公告)日：2005-06-28

申请号：US10122863

申请日：2002-04-15

申请人： John L. Miller

发明人： John L. Miller

IPC分类号： H04L29/08 ,  H04L29/12 ,  G06F12/08

CPC分类号： H04L29/12811 ,  H04L29/12009 ,  H04L61/6009 ,  H04L67/104 ,  H04L69/329

摘要： A peer-to-peer cache architecture stores peer address certificates in different cache segments according to the number of IDs being stored and their relative distance in the peer name space. The cache instantiates regions of decreased range and increased granularity as additional information from close peers is learned. In a large peer cloud where the number of instantiated IDs is not known, each succeeding cache region covers one tenth of the preceding cache region. For peers with multiple IDs registered locally, the segmented cache of the present invention combines overlapping segments of the same granularity to eliminate the duplication of information that would otherwise occur. A cache tree, an instantiated segment tree, and an uninstantiated segment tree are arranged in red-black trees to simplify the search and proper placement and instantiation of information.

摘要翻译： 对等缓存体系结构将对等体地址证书存储在不同的高速缓存区段中，根据存储的ID数量及其在对等体名称空间中的相对距离。 随着从邻近对等体的附加信息被学习，高速缓存实例化了范围减小和粒度增加的区域。 在实例化ID的数量不大的大对等体云中，每个后续高速缓存区域覆盖前一高速缓存区域的十分之一。 对于在本地注册的多个ID的对等体，本发明的分段高速缓存组合相同粒度的重叠段以消除否则将发生的信息的重复。 一个缓存树，一个实例化的分段树和一个无创的分段树被布置在红黑树中，以简化搜索和信息的正确放置和实例化。