公开(公告)号：US08171539B2

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

申请号：US12349924

申请日：2009-01-07

Applicant: Trevor Miranda

Inventor： Trevor Miranda

IPC: H04L29/06

CPC classification number: H04L63/0263

Abstract: Apparatus and methods are provided for implementing a firewall in a network infrastructure component. A method comprises generating a search tree for a plurality of rules. The search tree comprises a first node having a first field bounds and a first set of rules of the plurality of rules, and a plurality of child nodes for the first node. Each child node has child field bounds based on an intersection of the first field bounds and the first set of rules, and each child node is assigned a respective subset of the first set of rules based on the respective child field bounds. The method further comprises receiving a first packet, identifying a first child node of the plurality of child nodes based on values for one or more fields of the first packet, and applying the respective subset of rules assigned to the first child node to the first packet.

Abstract translation: 提供了用于在网络基础设施组件中实现防火墙的装置和方法。 一种方法包括生成用于多个规则的搜索树。 搜索树包括具有多个规则的第一字段边界和第一组规则的第一节点以及用于第一节点的多个子节点。 每个子节点具有基于第一字段边界和第一组规则的交集的子字段边界，并且基于相应的子字段边界为每个子节点分配第一组规则的相应子集。 所述方法还包括：接收第一分组，基于所述第一分组的一个或多个字段的值来识别所述多​​个子节点中的第一子节点，以及将分配给所述第一子节点的相应规则子集应用于所述第一分组 。

公开(公告)号：US07336800B2

公开(公告)日：2008-02-26

申请号：US10437070

申请日：2003-05-14

Applicant: Trevor Miranda ,  Manindra Mohan

Inventor： Trevor Miranda ,  Manindra Mohan

IPC: G06K9/00

CPC classification number: G06T1/005 ,  G06T2201/0052 ,  G06T2201/0065 ,  G06T2201/0081

Abstract: The present invention relates to a method, computer program product and a device for detecting watermarks in digital data for the purpose of electronic copyright management system. The invention includes transforming the original as well as unwatermarked data. Thereafter, tagging the resultant components of the transformed data using a pair of rows and columns. Then, selecting significant components in the said transformed data, transforming the suspected watermarked data and tagging the components in the transformed data. Further, selecting the tagged components from the transformed suspected watermarked data corresponding to those selected as significant in the original transformed data, and comparing said two groups of selected significant components to detect the watermarks.

Abstract translation: 本发明涉及一种电子版权管理系统的方法，计算机程序产品和用于检测数字数据中的水印的装置。 本发明包括转换原始以及未水印的数据。 此后，使用一对行和列来标记变换后的数据的合成分量。 然后，在所述变换的数据中选择重要组件，转换可怀疑水印数据并标记变换数据中的组件。 此外，从与原始变换数据中被选择为有意义的变换的疑似水印数据相对应的经变换的疑似水印数据中选择标记分量，并且比较所选择的两组选择的有效分量以检测水印。

公开(公告)号：US08352604B2

公开(公告)日：2013-01-08

申请号：US12914636

申请日：2010-10-28

Applicant: Trevor Miranda ,  Puneet Batta

Inventor： Trevor Miranda ,  Puneet Batta

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L67/1068 ,  H04L67/1078

Abstract: A technique for distributed propagation of data in a wireless communication network includes providing 600 a unique host identifier for each peer network entity in the wireless communication network, each host identifier having a length of B bits. A next step includes requesting 602 data from peer network entities using a request having a host identifier of the requesting network entity. A next step includes, if a peer network entity is hosting the requested data, comparing 608 the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match. A next step includes responding 610 to the request if a match is determined.

Abstract translation: 一种用于在无线通信网络中分布式传播数据的技术包括为无线通信网络中的每个对等网络实体提供600唯一的主机标识符，每个主机标识符具有B位长度。 下一步骤包括使用具有请求网络实体的主机标识符的请求从对等网络实体请求602数据。 下一步骤包括，如果对等网络实体承载所请求的数据，则比较608请求网络实体的主机标识符和接收请求的对等网络实体以确定匹配。 如果确定匹配，则下一步包括响应610请求。

公开(公告)号：US20100175124A1

公开(公告)日：2010-07-08

申请号：US12349924

申请日：2009-01-07

Applicant: Trevor Miranda

Inventor： Trevor Miranda

IPC: G06F21/00

CPC classification number: H04L63/0263

Abstract: Apparatus and methods are provided for implementing a firewall in a network infrastructure component. A method comprises generating a search tree for a plurality of rules. The search tree comprises a first node having a first field bounds and a first set of rules of the plurality of rules, and a plurality of child nodes for the first node. Each child node has child field bounds based on an intersection of the first field bounds and the first set of rules, and each child node is assigned a respective subset of the first set of rules based on the respective child field bounds. The method further comprises receiving a first packet, identifying a first child node of the plurality of child nodes based on values for one or more fields of the first packet, and applying the respective subset of rules assigned to the first child node to the first packet.

Abstract translation: 提供了用于在网络基础设施组件中实现防火墙的装置和方法。 一种方法包括生成用于多个规则的搜索树。 搜索树包括具有多个规则的第一字段边界和第一组规则的第一节点以及用于第一节点的多个子节点。 每个子节点具有基于第一字段边界和第一组规则的交集的子字段边界，并且基于相应的子字段边界为每个子节点分配第一组规则的相应子集。 所述方法还包括：接收第一分组，基于所述第一分组的一个或多个字段的值来识别所述多​​个子节点中的第一子节点，以及将分配给所述第一子节点的相应规则子集应用于所述第一分组 。

公开(公告)号：US20120149367A1

公开(公告)日：2012-06-14

申请号：US12967821

申请日：2010-12-14

Applicant: Trevor Miranda ,  Nicholas S. Dade

Inventor： Trevor Miranda ,  Nicholas S. Dade

IPC: H04W4/00

CPC classification number: H04W24/00 ,  H04W4/029 ,  H04W12/06

Abstract: A technique for synchronization of mobile device information in a wireless communication network includes associating 300 a mobile device (MD) to a first access point (AP). A next step includes transmitting 302 a roam notification message from the first AP to all APs in network. A next step includes associating 304 the MD to a second AP. A next step includes establishing 306 that the first and second APs are roaming neighbors. A next step includes building 308 a roaming neighbor list in the associated first and second APs for the MD, wherein the list includes those neighboring APs where the MD has been associated. A next step includes determining 310 that the MD is currently associated with an AP. A next step includes preemptively pushing 312 information about the MD to those APs in the list of the determined AP for synchronization.

Abstract translation: 一种用于在无线通信网络中同步移动设备信息的技术包括将移动设备（MD）300与第一接入点（AP）相关联。 下一步包括从网络向所有AP发送302来自第一AP的漫游通知消息。 下一步骤包括将MD与第二AP相关联。 下一步包括建立306第一和第二AP是漫游邻居。 下一步骤包括在相关联的用于MD的第一和第二AP中建立308漫游邻居列表，其中该列表包括其中MD已被关联的那些相邻AP。 下一步包括确定310当前与AP相关联的MD。 接下来的步骤包括先前将312关于MD的信息推送到所确定的AP列表中的同步的那些AP。

公开(公告)号：US08190150B1

公开(公告)日：2012-05-29

申请号：US12967821

申请日：2010-12-14

Applicant: Trevor Miranda ,  Nicholas S. Dade

Inventor： Trevor Miranda ,  Nicholas S. Dade

IPC: H04W4/00 ,  H04W36/00

CPC classification number: H04W24/00 ,  H04W4/029 ,  H04W12/06

Abstract: A technique for synchronization of mobile device information in a wireless communication network includes associating 300 a mobile device (MD) to a first access point (AP). A next step includes transmitting 302 a roam notification message from the first AP to all APs in network. A next step includes associating 304 the MD to a second AP. A next step includes establishing 306 that the first and second APs are roaming neighbors. A next step includes building 308 a roaming neighbor list in the associated first and second APs for the MD, wherein the list includes those neighboring APs where the MD has been associated. A next step includes determining 310 that the MD is currently associated with an AP. A next step includes preemptively pushing 312 information about the MD to those APs in the list of the determined AP for synchronization.

Abstract translation: 一种用于在无线通信网络中同步移动设备信息的技术包括将移动设备（MD）300与第一接入点（AP）相关联。 下一步包括从网络向所有AP发送302来自第一AP的漫游通知消息。 下一步骤包括将MD与第二AP相关联。 下一步包括建立306第一和第二AP是漫游邻居。 下一步骤包括在相关联的用于MD的第一和第二AP中建立308漫游邻居列表，其中该列表包括其中MD已被关联的那些相邻AP。 下一步包括确定310当前与AP相关联的MD。 接下来的步骤包括先前将312关于MD的信息推送到所确定的AP列表中的同步的那些AP。

公开(公告)号：US20120110183A1

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

申请号：US12914636

申请日：2010-10-28

Applicant: Trevor Miranda ,  Puneet Batta

Inventor： Trevor Miranda ,  Puneet Batta

IPC: G06F15/173 ,  G06F15/16

CPC classification number: H04L67/104 ,  H04L67/1068 ,  H04L67/1078

Abstract: A technique for distributed propagation of data in a wireless communication network includes providing 600 a unique host identifier for each peer network entity in the wireless communication network, each host identifier having a length of B bits. A next step includes requesting 602 data from peer network entities using a request having a host identifier of the requesting network entity. A next step includes, if a peer network entity is hosting the requested data, comparing 608 the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match. A next step includes responding 610 to the request if a match is determined.

Abstract translation: 一种用于在无线通信网络中分布式传播数据的技术包括为无线通信网络中的每个对等网络实体提供600唯一的主机标识符，每个主机标识符具有B位长度。 下一步骤包括使用具有请求网络实体的主机标识符的请求从对等网络实体请求602数据。 下一步骤包括，如果对等网络实体承载所请求的数据，则比较608请求网络实体的主机标识符和接收请求的对等网络实体以确定匹配。 如果确定匹配，则下一步包括响应610请求。