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

71. 发明申请

US20080240267A1 FEC in cognitive multi-user OFDMA 有权
标题翻译：认知多用户OFDMA中的FEC
公开(公告)号：US20080240267A1
公开(公告)日：2008-10-02
申请号：US11731269
申请日：2007-03-30
申请人： Amer Hassan , Christian Huitema , Wayne Stark , Yunnan Wu , Philip Chou
发明人： Amer Hassan , Christian Huitema , Wayne Stark , Yunnan Wu , Philip Chou
IPC分类号： H04L27/28
CPC分类号： H04W72/08 , H04L1/0045 , H04L1/0071 , H04L5/0007 , H04L5/0041 , H04L5/0046 , H04L5/0058 , H04L5/006 , H04L2001/0093
摘要： A multiuser scheme allowing for a number of users, sets of user, or carriers to share one or more channels is provided. In the invention, the available channel bandwidth is subdivided into a number of equal-bandwidth subchannels according to standard OFDM practice. A transmitter transmits data on a set of OFDM subchannels that need not be contiguous in the spectrum or belong to the same OFDM channel. A receiver receives and decodes the data and detects errors on subchannels. The receiver then broadcasts the identity of those subchannels on which the error rate exceeds a specific threshold, and the transmitter may select different subchannels for transmission based on this information.
摘要翻译：提供允许多个用户，一组用户或运营商共享一个或多个信道的多用户方案。在本发明中，可用信道带宽根据标准OFDM实践被细分为多个等带宽子信道。发射机在不需要在频谱中连续或属于相同OFDM信道的一组OFDM子信道上发送数据。接收器接收并解码数据并检测子信道上的错误。然后，接收机广播差错率超过特定阈值的子信道的身份，并且发射机可以基于该信息来选择用于发送的不同子信道。

72. 发明授权

US07406527B2 Method for advance negotiation of computer settings 有权
标题翻译：计算机设置提前协商的方法
公开(公告)号：US07406527B2
公开(公告)日：2008-07-29
申请号：US10002265
申请日：2001-11-02
申请人： Art Shelest , Christian Huitema
发明人： Art Shelest , Christian Huitema
IPC分类号： G06F15/16 , G06F11/00
CPC分类号： G06F9/44505
摘要： A method to negotiate computer settings in advance is presented. A prediction is made to determine if the computer setting will be needed, and if needed, whether a value outside of a normal range of values will be needed. A value for the computer setting that is outside of the normal range of values is determined and the value is set to the outside value. A value within the normal range of values is used if it was predicted that there is no need for a value outside of the normal range of values.
摘要翻译：提出了一种提前协商计算机设置的方法。进行预测以确定是否需要计算机设置，并且如果需要，是否需要在正常值范围之外的值。确定超出正常值范围的计算机设置的值，并将该值设置为外部值。如果预测不需要在正常值范围之外的值，则使用在正常范围内的值。

73. 发明申请

US20070220134A1 Endpoint Verification Using Call Signs 审中-公开
标题翻译：端点验证使用呼叫标志
公开(公告)号：US20070220134A1
公开(公告)日：2007-09-20
申请号：US11276798
申请日：2006-03-15
申请人： Kim Cameron , Arun Nanda , Christian Huitema , Carl Ellison
发明人： Kim Cameron , Arun Nanda , Christian Huitema , Carl Ellison
IPC分类号： G06F15/173
CPC分类号： H04L63/1441 , G06F21/31 , G06F2221/2119 , H04L63/126 , H04L63/1483 , H04L67/02
摘要： A computer system is configured to verify a connection to a web site. The computer system includes a user interface programmed to receive a uniform resource locator and a call sign associated with the web site. The computer system also includes a validator module programmed to calculate a hash value based on the uniform resource locator, a public key associated with the web site, and a salt, and the validator being programmed to compare the hash value to the call sign to verify the connection to the web site.
摘要翻译：计算机系统被配置为验证到网站的连接。计算机系统包括被编程为接收统一资源定位符的用户界面和与该网站相关联的呼号。该计算机系统还包括一个验证器模块，该验证器模块被编程为基于统一资源定位器计算散列值，与该网站相关联的公共密钥和一个盐，并且该验证器被编程为将散列值与呼号进行比较以验证与网站的连接。

74. 发明授权

US07239611B2 Controlling admission of data streams onto a network based on end-to-end measurements 有权
标题翻译：基于端到端测量控制数据流到网络的准入
公开(公告)号：US07239611B2
公开(公告)日：2007-07-03
申请号：US10378532
申请日：2003-03-03
申请人： Ashish Khisti , Christian Huitema , Aditya Dube
发明人： Ashish Khisti , Christian Huitema , Aditya Dube
IPC分类号： H04J1/16 , H04J3/14
CPC分类号： H04L43/50 , H04L12/56
摘要： Appropriate determinations in a series of tests, which transition from more passive tests to more active tests, control the admission of data streams onto a network data path. More passive tests can include promiscuous mode and packet-pair tests. When the results of more passive tests indicate a reduce likelihood of a data stream causing a network data path to transition into a congested state, the network data path can be actively probed to make a more precise determination on the likelihood of congestion. A train of diagnostic data packets is transmitted at a diagnostic data transfer rate having a significantly reduced chance of causing congestion. A train of target data packets is transmitted at a requested application transfer data rate. The number of target data packets received within a specified delay threshold is compared to the number of diagnostic data packets receive with the delay threshold.
摘要翻译：在一系列测试中进行适当的确定，从更多的被动测试转换到更活跃的测试，控制数据流进入网络数据路径。更多的被动测试可以包括混杂模式和分组对测试。当被动测试的结果表明数据流的可能性降低导致网络数据路径转变到拥塞状态时，网络数据路径可以被主动地探测以对拥塞的可能性做出更准确的确定。一系列诊断数据分组以诊断数据传输速率发送，具有显着减少引起拥塞的几率。以所请求的应用传输数据速率发送一串目标数据分组。将指定延迟阈值内接收到的目标数据包的数量与延迟阈值接收的诊断数据包的数量进行比较。

75. 发明申请

US20070104218A1 Adapting a communication network to varying conditions 有权
标题翻译：将通信网络适应不同的条件
公开(公告)号：US20070104218A1
公开(公告)日：2007-05-10
申请号：US11268800
申请日：2005-11-08
申请人： Amer Hassan , Christian Huitema , Thomas Kuehnel , Vishesh Parikh
发明人： Amer Hassan , Christian Huitema , Thomas Kuehnel , Vishesh Parikh
IPC分类号： H04J3/22
CPC分类号： H04W36/06 , H04L1/0025 , H04L1/22 , H04W48/18 , H04W88/06 , H04W88/10
摘要： Systems and methods are disclosed for adapting a communication system to varying conditions. Using some form of discovery protocol, the communication standards supported by at least two communicants are determined. Each communicant may then periodically monitor the quality of the channel established by the communication standard and dynamically select a set of one or more communication standards to use for communicating. Further, when communicants share common non-standard parameterized implementations of communication standards, changes to the protocols which the communication standards comprise can be used to add options for a more dynamic response to changing conditions than is possible when adhering only to an established communication standard.
摘要翻译：公开了用于使通信系统适应不同条件的系统和方法。使用某种形式的发现协议，确定由至少两个通信者支持的通信标准。然后，每个通信者可以周期性地监视由通信标准建立的信道的质量，并动态地选择一组用于通信的通信标准。此外，当通信者共享通信标准的公共非标准参数化实现时，可以使用通信标准包括的协议的改变来增加用于对仅在遵循建立的通信标准的情况下可变的条件的更多动态响应的选项。

76. 发明申请

US20060242301A1 DNS compatible PNRP peer name encoding 有权
公开(公告)号：US20060242301A1
公开(公告)日：2006-10-26
申请号：US11112040
申请日：2005-04-22
申请人： Noah Horton , Ravi Rao , Radu Simionescu , Todd Manion , Christian Huitema
发明人： Noah Horton , Ravi Rao , Radu Simionescu , Todd Manion , Christian Huitema
IPC分类号： G06F15/16
CPC分类号： H04L29/12 , H04L29/12047 , H04L61/15 , H04L67/104
摘要： A method of converting a peer name to a PNRP DNS is disclosed. The method may take a peer name and encode it into a common DNS name. The method may also take a PNRP DNS name and convert it to a peer name.

77. 发明授权

US07065587B2 Peer-to-peer name resolution protocol (PNRP) and multilevel cache for use therewith 失效
公开(公告)号：US07065587B2
公开(公告)日：2006-06-20
申请号：US09942164
申请日：2001-08-29
申请人： Christian Huitema , John L. Miller
发明人： Christian Huitema , John L. Miller
IPC分类号： G06F15/73
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.

78. 发明申请

US20050267993A1 Peer-to-peer name resolution protocol (PNRP) and multilevel cache for use therewith 有权
标题翻译：对等名称解析协议（PNRP）和与其一起使用的多级缓存
公开(公告)号：US20050267993A1
公开(公告)日：2005-12-01
申请号：US11152588
申请日：2005-06-13
申请人： Christian Huitema , John Miller
发明人： Christian Huitema , John Miller
IPC分类号： H04L12/56 , G06F17/30 , H04L29/08 , H04L29/12 , 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）组件和唯一号码组成的标识来与域名系统一起操作。

79. 发明申请

US20050157659A1 Peer-to-peer cloud-split detection and repair methods 有权
标题翻译：对等云分割检测和修复方法
公开(公告)号：US20050157659A1
公开(公告)日：2005-07-21
申请号：US10696776
申请日：2003-10-30
申请人： Christian Huitema
发明人： Christian Huitema
IPC分类号： H04L12/28 , H04L29/06 , H04L29/08 , H04L29/14
CPC分类号： H04L67/104 , H04L63/0823 , H04L67/1048 , H04L69/40
摘要： A method for detecting and repairing cloud splits in a distributed system such as a peer-to-peer (P2P) system is presented. Nodes in a cloud maintain a multilevel cache of entries for a subset of nodes in the cloud. The multilevel cache is built on a circular number space, where each node in the cloud is assigned a unique identifier (ID). Nodes are recorded in levels of the cache according to the distance from the host node. The size of the cloud is estimated using the cache, and cloud-split tests are performed with a frequency inversely proportional to the size of the cloud. Cloud splits are initially detected by polling a seed server in the cloud for a node N having an ID equal to the host ID+1. The request is redirected to another node in the cloud, and a best match for N is resolved. If the best-match is closer to the host than any node in the host's cache, a cloud split is presumed. The cloud split is repaired by flooding the host's address to the newly found node and sending repair messages to nodes in the host's top cache level. Each node receiving a repair message repeats a similar process, and sends repair messages to nodes in its next lower cache level.
摘要翻译：提出了一种在分布式系统（如P2P）系统中检测和修复云分割的方法。云中的节点维护云中节点子集的条目的多级缓存。多层缓存构建在循环数字空间上，云中的每个节点都分配有唯一的标识符（ID）。节点根据与主机节点的距离记录在高速缓存的级别中。使用缓存估计云的大小，并且以与云的大小成反比的频率执行云分割测试。最初通过轮询云中的种子服务器来检测具有等于主机ID + 1的ID的节点N的云分割。该请求被重定向到云中的另一个节点，并且N的最佳匹配被解决。如果最佳匹配比主机缓存中的任何节点更接近主机，则假定云分割。通过将主机地址淹没到新发现的节点并将修复消息发送到主机顶部缓存级别的节点来修复云分割。接收修复消息的每个节点重复类似的过程，并将修复消息发送到其下一个较低高速缓存级别的节点。

80. 发明申请

US20050108373A1 Method for establishing and maintaining a shared view of time in a peer-to-peer network 失效
标题翻译：在对等网络中建立和维护时间共享视图的方法
公开(公告)号：US20050108373A1
公开(公告)日：2005-05-19
申请号：US10702405
申请日：2003-11-05
申请人： Jeremy Dewey , Christian Huitema , Xiaohai Zhang
发明人： Jeremy Dewey , Christian Huitema , Xiaohai Zhang
IPC分类号： G06F15/173 , H04L29/06 , H04L29/08
CPC分类号： H04L67/104 , H04L67/1095 , H04L69/28
摘要： A shared concept of time, called “graph time,” is agreed upon by all nodes within a graph. Each node maintains its own local delta representative of a difference in the node's system clock and graph time. Upon connecting to a neighbor node in a graph, a node is sent graph time as perceived by the neighbor node. In accordance with an embodiment, the node assumes that the lag time in receiving the graph time from the neighbor node is one-half of the lag time between the request for the connection and the receipt of the graph time. Graph time as sent by the neighbor node is added to one-half of the total delay and the sum is subtracted from the node's system time to calculate the delta for the node requesting connection.
摘要翻译：一个共享的时间概念，称为“图形时间”，由图中的所有节点同意。每个节点维护其本身的局部增量，表示节点的系统时钟和图形时间的差异。在连接到图中的邻居节点时，节点被发送图形时间，如邻居节点所感知的。根据实施例，节点假设从邻居节点接收图形时间的滞后时间是连接请求与图形时间的接收之间的滞后时间的一半。由相邻节点发送的图形时间被添加到总延迟的一半，并且从节点的系统时间中减去总和以计算请求连接的节点的增量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式