公开(公告)号：US20060039286A1

公开(公告)日：2006-02-23

申请号：US10920750

申请日：2004-08-18

申请人： Anindya Basu ,  Brian Boshes ,  Sayandev Mukherjee ,  Sharad Ramanathan

发明人： Anindya Basu ,  Brian Boshes ,  Sayandev Mukherjee ,  Sharad Ramanathan

IPC分类号： H04J3/14 ,  H04L12/26

CPC分类号： H04W40/34 ,  H04L45/02 ,  H04L45/121 ,  H04W84/18

摘要： A method and apparatus for deforming the network topology of a multi-hop wireless network dynamically (i.e., in real time), in response to changing network traffic conditions and in order to advantageously reduce mean end-to-end network (transmission) delay. Two illustrative embodiments of the invention deform the network topology dynamically in response to traffic conditions (i) by changing the network connectivity between the existing network nodes and (ii) by adding one or more new nodes (and associated connections thereto and therefrom) to the network. In both cases, the traffic conditions may be fed into the algorithm in real time as, for example, a set of queue length measurements. Then, in response, the network is advantageously reorganized into a configuration that reduces the mean end-to-end network transmission delay.

摘要翻译： 一种用于响应于不断变化的网络业务状况来动态地（即实时地）变形多跳无线网络的网络拓扑的方法和装置，并且为了有利地减少平均的端到端网络（传输）延迟。 本发明的两个说明性实施例通过改变现有网络节点之间的网络连接性和（ii）通过将一个或多个新节点（以及与其相关的连接及其相关连接）添加到 网络。 在这两种情况下，可以将交通状况实时地馈送到算法中，例如，一组队列长度测量。 然后，作为响应，网络有利地被重组成减少平均端到端网络传输延迟的配置。

公开(公告)号：US06836888B1

公开(公告)日：2004-12-28

申请号：US09528381

申请日：2000-03-17

申请人： Anindya Basu ,  Suvo Mittra

发明人： Anindya Basu ,  Suvo Mittra

IPC分类号： G06F946

CPC分类号： G06F21/57

摘要： A reverse sandbox extends a private computing environment onto a standalone host in a public environment. The reverse sandbox includes a service director that receives service requests, classifies the service requests in accordance with security policies, selects a processing stack based on the classification and communicates the service request to the selected processing stack. A reverse sandbox embodiment may also include a compliance supervisor that constructs processing stacks with mediation modules based upon security policies. The mediation modules of the selected processing stack modify the service request and provide the modified service request to the resources of the standalone host.

摘要翻译： 反向沙箱将私有计算环境扩展到公共环境中的独立主机。 反向沙箱包括接收服务请求的服务指导者，根据安全策略对服务请求进行分类，根据分类选择处理堆栈，并将服务请求传送到所选择的处理堆栈。 反向沙箱实施例还可以包括遵守主管，其基于安全策略来构建具有中介模块的处理堆栈。 所选处理堆栈的中介模块修改服务请求，并将修改的服务请求提供给独立主机的资源。

公开(公告)号：US07260064B2

公开(公告)日：2007-08-21

申请号：US10269671

申请日：2002-10-11

申请人： Anindya Basu ,  Alvin Lai Lin ,  Sharad Ramanathan

发明人： Anindya Basu ,  Alvin Lai Lin ,  Sharad Ramanathan

IPC分类号： H04L12/28 ,  G06F15/173

CPC分类号： H04L45/00 ,  H04L45/12

摘要： A method and apparatus for network routing in packet-based networks which advantageously takes traffic conditions into account dynamically in determining the “best route” for routing a packet to its intended destination. Illustratively, a potential function is employed whereby hypothetical electrostatic potential values are calculated at each node or link of a network, and the packets are routed in accordance with these potential function values (e.g., in the direction of the lowest neighboring value). The potential function values may be advantageously calculated based on queue lengths at the various nodes (or links) in combination with a minimum-cost distance calculated to the packet's intended destination.

摘要翻译： 一种用于基于分组的网络中的网络路由的方法和装置，其有利地在确定用于将分组路由到其预期目的地的“最佳路由”时动态地考虑交通状况。 说明性地，使用潜在功能，其中在网络的每个节点或链路处计算出假想静电电势值，并且根据这些潜在功能值（例如，在最低相邻值的方向）路由分组。 可以有利地根据在各个节点（或链路）处的队列长度与针对分组的预定目的地计算的最小成本距离相结合来计算潜在功能值。

公开(公告)号：US07180864B2

公开(公告)日：2007-02-20

申请号：US10085568

申请日：2002-02-27

申请人： Anindya Basu ,  Chih-Hao Luke Ong ,  April Patricia Rasala ,  Frederick Bruce Sheperd ,  Gordon Thomas Wilfong

发明人： Anindya Basu ,  Chih-Hao Luke Ong ,  April Patricia Rasala ,  Frederick Bruce Sheperd ,  Gordon Thomas Wilfong

IPC分类号： H04L12/26

CPC分类号： H04L45/02 ,  H04L45/52

摘要： A method for exchanging routing information between I-BGP routers within an autonomous system (AS) advantageously enables a solution to both persistent route oscillation problems and transient route oscillation problems which may occur when using I-BGP in a given AS. Conventional I-BGP protocol techniques are extended by enabling I-BGP speakers (e.g., routers) to communicate a set of possible best paths to a given destination, rather than communicating only a single best path, to each of their I-BGP peers within the given AS. Specifically, a plurality of possible best paths to a destination are communicated (where there are in fact more than one) from an I-BGP speaker in a given AS to its I-BGP peers (within the given AS), for each neighboring AS that provides any such paths (i.e., routes to the destination).

摘要翻译： 在自治系统（AS）内的I-BGP路由器之间交换路由信息的方法有利地能够解决在给定AS中使用I-BGP时可能出现的持久路由振荡问题和瞬时路由振荡问题。 通过使I-BGP扬声器（例如，路由器）能够将一组可能的最佳路径传达给给定目的地而不是仅传达单个最佳路径，来扩展I / 给定的AS。 具体地，对于每个相邻的AS，向给定的AS中的I-BGP对等体（在给定的AS内）传送到目的地的多条可能的最佳路径（其中实际上不止一个）从给定AS中的I-BGP演讲者 它提供任何这样的路径（即，到达目的地的路由）。

公开(公告)号：US07171490B2

公开(公告)日：2007-01-30

申请号：US10246204

申请日：2002-09-18

申请人： Anindya Basu ,  Girija J. Narlikar

发明人： Anindya Basu ,  Girija J. Narlikar

IPC分类号： G06F15/173

CPC分类号： H04L45/00 ,  H04L45/54 ,  H04L45/742 ,  Y10S707/99953

摘要： A method and apparatus for reducing the number of write operations during route updates in router forwarding engines eliminates “excess” (i.e., “redundant”) writes to the routing trie. One or more writes are “redundant” with respect to another write if the timestamp of the other write is the same as or later than (by an amount less than a given threshold) the timestamp of each of the one or more writes, and if the state of the routing trie after the other write has been applied is equivalent whether or not any of the one or more writes have also been applied. Excess writes may be advantageously eliminated when routes are either added to or withdrawn from the routing trie, and deleted subtrees may be advantageously cached for subsequent re-addition thereto.

摘要翻译： 用于减少在路由器转发引擎中的路由更新期间的写入操作次数的方法和装置消除了对路由选择器的“过量”（即“冗余”）写入。 如果另一个写入的时间戳与一个或多个写入中的每一个的时间戳相同（或小于给定的阈值），则一个或多个写入相对于另一个写入是“冗余的”，如果 在应用另一个写入之后的路由选择的状态等同于是否还应用了一个或多个写入中的任一个。 当路由被添加到路由选择器中或从路由选择器撤回时，可以有利地消除过多的写入，并且可以有利地缓存删除的子树以便随后重新添加。

公开(公告)号：US07356033B2

公开(公告)日：2008-04-08

申请号：US10301242

申请日：2002-11-21

申请人： Anindya Basu ,  Girija J. Narlikar ,  Francis X Zane

发明人： Anindya Basu ,  Girija J. Narlikar ,  Francis X Zane

IPC分类号： H04L12/54

CPC分类号： H04L45/745 ,  H04L45/00 ,  H04L45/54 ,  H04L45/7453 ,  H04L45/7457 ,  Y02D30/20

摘要： A multi-stage (e.g., two-stage) packet-based lookup process using a Ternary Content Addressable Memory (TCAM) divided into partitions. The result of a first stage lookup is used to selectively search one of a plurality of TCAM partitions during the second stage. A subset of destination address bits may be used in the first stage to hash to a selected partition for the second stage. Alternatively, a partitioning algorithm segments a routing trie into partitions, and then, either a separate, small TCAM or one of the partitions is used in the first stage to map a prefix of the destination address to one of the TCAM partitions for use in the second stage. The “trie-based” algorithms may advantageously partition the trie such that each second stage partition comprises a substantially contiguous sequence of routing prefixes in a post-order traversal of the routing trie, together with one or more covering prefixes thereof.

摘要翻译： 使用分为分区的三进制内容可寻址存储器（TCAM）的多阶段（例如，两阶段）基于分组的查找过程。 第一阶段查找的结果用于在第二阶段选择性地搜索多个TCAM分区中的一个。 可以在第一阶段中使用目的地址位的子集来散列到用于第二阶段的所选择的分区。 或者，划分算法将路由选择划分成分区，然后在第一阶段中使用单独的小TCAM或分区中的一个来将目的地址的前缀映射到TCAM分区之一，以用于 第二阶段 “基于trie”的算法可以有利地划分该线索，使得每个第二级分区包括路由选择器的后序遍历中的基本上连续的路由前缀序列，以及一个或多个覆盖前缀。