-
公开(公告)号：US08161095B2
公开(公告)日：2012-04-17
申请号：US11716896
申请日：2007-03-12
申请人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
发明人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
IPC分类号： G06F15/16 , G06F15/173
摘要： Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.
摘要翻译： 用于启动和访问分布式路由表（DRT）功能的应用程序编程接口（API）。 API有助于通过寻求通过无服务器连接协作的一组设备（网格）的一个或多个设备来引导DRT，建立DRT的节点，其中每个节点是参与该应用的实例 网格和节点参与，允许应用程序搜索网格中其他节点发布的密钥，或通过发布密钥成为网格的一部分。 API有助于路由表的优化，以通过直接在高速缓存中查找密钥或通过询问本地路由表中与数字最接近的密钥的密钥的根节点快速找到网格中的特定密钥的根 正在搜索的关键
-
公开(公告)号：US08977686B2
公开(公告)日：2015-03-10
申请号：US13438771
申请日：2012-04-03
申请人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
发明人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
IPC分类号： G06F15/16 , H04L12/701 , H04L12/741 , H04L12/771
摘要： Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.
摘要翻译： 用于启动和访问分布式路由表（DRT）功能的应用程序编程接口（API）。 API有助于通过寻求通过无服务器连接协作的一组设备（网格）的一个或多个设备来引导DRT，建立DRT的节点，其中每个节点是参与该应用的实例 网格和节点参与，允许应用程序搜索网格中其他节点发布的密钥，或通过发布密钥成为网格的一部分。 API有助于路由表的优化，以通过直接在高速缓存中查找密钥或通过询问本地路由表中与数字最接近的密钥的密钥的根节点快速找到网格中的特定密钥的根 正在搜索的关键
-
公开(公告)号：US20080225860A1
公开(公告)日：2008-09-18
申请号：US11716896
申请日：2007-03-12
申请人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
发明人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
IPC分类号： H04L12/56
摘要： Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.
摘要翻译： 用于启动和访问分布式路由表（DRT）功能的应用程序编程接口（API）。 API有助于通过寻求通过无服务器连接协作的一组设备（网格）的一个或多个设备来引导DRT，建立DRT的节点，其中每个节点是参与该应用的实例 网格和节点参与，允许应用程序搜索网格中其他节点发布的密钥，或通过发布密钥成为网格的一部分。 API有助于路由表的优化，以通过直接在高速缓存中查找密钥或通过询问本地路由表中与数字最接近的密钥的密钥的根节点快速找到网格中的特定密钥的根 正在搜索的关键
-
公开(公告)号：US20120203835A1
公开(公告)日：2012-08-09
申请号：US13438771
申请日：2012-04-03
申请人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
发明人： Todd R. Manion , Kevin C. Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Travis C. Luke , Upshur W. Parks , Brian R. Lieuallen , Pritam De , Pallavi Choudhury
IPC分类号： G06F15/16
摘要： Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.
摘要翻译： 用于启动和访问分布式路由表（DRT）功能的应用程序编程接口（API）。 API有助于通过寻求通过无服务器连接协作的一组设备（网格）的一个或多个设备来引导DRT，建立DRT的节点，其中每个节点是参与该应用的实例 网格和节点参与，允许应用程序搜索网格中其他节点发布的密钥，或通过发布密钥成为网格的一部分。 API有助于路由表的优化，以通过直接在高速缓存中查找密钥或通过询问本地路由表中与数字最接近的密钥的密钥的根节点快速找到网格中的特定密钥的根 正在搜索的关键
-
公开(公告)号：US20110119400A1
公开(公告)日：2011-05-19
申请号：US13012789
申请日：2011-01-24
申请人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
发明人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
IPC分类号： G06F15/173
摘要： A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.
摘要翻译： 分布式路由表（DRT）网格可以包括两个或更多个节点，每个节点维护其自己的路由表，其表示DRT网格的一些或全部路由知识。 每个节点可以由可以执行各种定义的功能的模块化组件组成，使得节点的特征和能力可以由基于哪个模块化组件被实例化的应用来定制。 路由表管理模块可以在每个节点上维护单独的路由表，并且可以确保在路由表中仅保留网络拓扑意义上靠近节点的条目。 另外，安全模块可以根据约定的根证书验证接收到的消息。
-
公开(公告)号：US09270585B2
公开(公告)日：2016-02-23
申请号：US13012789
申请日：2011-01-24
申请人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
发明人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
IPC分类号： G06F15/16 , H04L12/741 , H04L12/751 , H04L12/773
摘要： A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.
摘要翻译： 分布式路由表（DRT）网格可以包括两个或更多个节点，每个节点维护其自己的路由表，其表示DRT网格的一些或全部路由知识。 每个节点可以由可以执行各种定义的功能的模块化组件组成，使得节点的特征和能力可以由基于哪个模块化组件被实例化的应用来定制。 路由表管理模块可以在每个节点上维护单独的路由表，并且可以确保在路由表中仅保留网络拓扑意义上靠近节点的条目。 另外，安全模块可以根据约定的根证书验证接收到的消息。
-
公开(公告)号：US07895345B2
公开(公告)日：2011-02-22
申请号：US11786820
申请日：2007-04-13
申请人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
发明人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
IPC分类号： G06F15/16
摘要： A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.
摘要翻译： 分布式路由表（DRT）网格可以包括两个或更多个节点，每个节点维护其自己的路由表，其表示DRT网格的一些或全部路由知识。 每个节点可以由可以执行各种定义的功能的模块化组件组成，使得节点的特征和能力可以由基于哪个模块化组件被实例化的应用来定制。 路由表管理模块可以在每个节点上维护单独的路由表，并且可以确保在路由表中仅保留网络拓扑意义上靠近节点的条目。 另外，安全模块可以根据约定的根证书验证接收到的消息。
-
公开(公告)号：US20080253306A1
公开(公告)日：2008-10-16
申请号：US11786820
申请日：2007-04-13
申请人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
发明人： Todd R. Manion , Kevin Charles Ransom , Jeremy L. Dewey , Scott A. Senkeresty , Brian R. Lieuallen , Pritam De , Sandeep Kishan Singhal
IPC分类号： H04L12/28
摘要： A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.
摘要翻译： 分布式路由表（DRT）网格可以包括两个或更多个节点，每个节点维护其自己的路由表，其表示DRT网格的一些或全部路由知识。 每个节点可以由可以执行各种定义的功能的模块化组件组成，使得节点的特征和能力可以由基于哪个模块化组件被实例化的应用来定制。 路由表管理模块可以在每个节点上维护单独的路由表，并且可以确保在路由表中仅保留网络拓扑意义上靠近节点的条目。 另外，安全模块可以根据约定的根证书验证接收到的消息。
-
9.发明申请EFFICIENT SECURE DATA MARSHALING THROUGH AT LEAST ONE UNTRUSTED INTERMEDIATE PROCESS 有权通过至少一个非阻塞的中间过程进行有效的安全数据挖掘公开(公告)号：US20130054917A1
公开(公告)日：2013-02-28
申请号：US13221290
申请日：2011-08-30
CPC分类号： G06F9/544 , G06F9/468 , G06F12/1416
摘要： Secure marshaling of data via one or more intermediate processes is provided. A source process may create a named shared memory section resulting in a first handle to the shared memory section. The source process may populate the shared memory section with information. An access control list may secure the shared memory section by preventing the one or more intermediate processes from accessing content of the shared memory section, while allowing a target process to access the content. The first handle and a name of the shared memory section may be marshaled to a first intermediate process resulting in a respective new handle to the shared memory section. A last intermediate process may marshal the name to a target process, which may use the name to obtain access to the content of the shared memory section.
摘要翻译： 提供了通过一个或多个中间过程来对数据进行安全的封送。 源进程可以创建命名的共享存储器部分，从而产生共享存储器部分的第一句柄。 源进程可以用信息填充共享存储器部分。 访问控制列表可以通过防止一个或多个中间进程访问共享存储器部分的内容，同时允许目标进程访问内容来保护共享存储器部分。 共享存储器部分的第一句柄和名称可以被编组到第一中间过程，导致对共享存储器部分的相应新的句柄。 最后一个中间过程可以将名称编组到目标进程，目标进程可以使用该名称来获取对共享内存部分的内容的访问。
-
公开(公告)号：US20050289244A1
公开(公告)日：2005-12-29
申请号：US10876775
申请日：2004-06-28
申请人： Himansu Sahu , Pritam De , Shashank Merchant , Gopi Krishna
发明人： Himansu Sahu , Pritam De , Shashank Merchant , Gopi Krishna
IPC分类号： G06F15/16 , G06F15/173 , H04L29/08
摘要： The invention relates to a method, system, network node and computer program for processing packet data in a communication network, which comprises at least a first network node. In the method a first packet is received at the first network node. In the first network node is assigned for the first packet a chain comprising at least two logical service entities based on at least one service determination rule. A data unit comprising at least part of the first packet is formed. The data unit is processed in at least one logical service entity in the chain and a second packet is transmitted from the first network node comprising data sent by at least one logical service entity in the chain. The benefits of the invention relate to improved flexibility in introducing new value-added service for packet data and improved performance in the first network node.
摘要翻译： 本发明涉及一种在通信网络中处理分组数据的方法，系统，网络节点和计算机程序，其包括至少第一网络节点。 在该方法中，在第一网络节点处接收第一分组。 在第一网络节点被分配用于第一分组基于至少一个服务确定规则的包括至少两个逻辑服务实体的链。 形成包括第一包的至少一部分的数据单元。 数据单元在链中的至少一个逻辑服务实体中处理，并且从第一网络节点发送包括由链中的至少一个逻辑服务实体发送的数据的第二分组。 本发明的优点涉及在为第一网络节点引入用于分组数据的新增值服务和改进的性能方面的改进的灵活性。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.038 秒)
