公开(公告)号：US07881307B2

公开(公告)日：2011-02-01

申请号：US12150184

申请日：2008-04-25

Applicant: Shaun Kazuo Wakumoto ,  Ballard Claude Bare ,  Cetin Ersoy

Inventor： Shaun Kazuo Wakumoto ,  Ballard Claude Bare ,  Cetin Ersoy

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L45/02 ,  H04L45/04 ,  H04L45/46

Abstract: One embodiment disclosed relates to a switching system. The switching system includes first, second, and third sets of switches. The first set of switches is configured with a first instance of meshing software such that the switches in the first set are members of a first mesh domain. The second set of switches is configured with a second instance of the meshing software such that the switches in the second set are members of a second mesh domain. The third set of switches is configured with both the first and second instances of the meshing software such that the switches in the third set are members of both the first and second mesh domains. Another embodiment disclosed relates to a packet switch apparatus executing multiple instances of meshing software. Another embodiment disclosed relates to a method of configuring a switching system having multiple mesh domains.

Abstract translation: 所公开的一个实施例涉及一种切换系统。 交换系统包括第一组，第二组和第三组开关。 第一组交换机配置有网格化软件的第一实例，使得第一组中的交换机是第一网格域的成员。 第二组交换机配置有网状软件的第二实例，使得第二组中的交换机是第二网格域的成员。 第三组交换机配置有网状软件的第一和第二实例，使得第三组中的交换机是第一和第二网状域的成员。 所公开的另一实施例涉及执行多个啮合软件实例的分组交换设备。 公开的另一实施例涉及一种配置具有多个网格域的交换系统的方法。

公开(公告)号：US20100296517A1

公开(公告)日：2010-11-25

申请号：US12847735

申请日：2010-07-30

Applicant: Kireeti Kompella

Inventor： Kireeti Kompella

IPC: H04L12/56

CPC classification number: H04L45/20 ,  H04L12/44 ,  H04L12/56 ,  H04L45/02 ,  H04L45/46 ,  H04L45/48 ,  H04L45/60

Abstract: A router maintains routing information including (i) route data representing destinations within a computer network, (ii) next hop data representing interfaces to neighboring network devices, and (iii) indirect next hop data that maps a subset of the routes represented by the route data to a common one of the next hop data elements. In this manner, routing information is structured such that routes having the same next hop use indirect next hop data structures to reference common next hop data. In particular, in response to a change in network topology, the router need not change all of the affected routes, but only the common next hop data referenced by the intermediate data structures. This provides for increased efficiency in updating routing information after a change in network topology, such as link failure.

Abstract translation: 路由器维护路由信息，包括（i）表示计算机网络内的目的地的路由数据，（ii）表示到相邻网络设备的接口的下一跳数据，以及（iii）映射路由表示的路由的子集的间接下一跳数据 数据到下一跳数据元素中的共同的一个。 以这种方式，路由信息的结构使得具有相同下一跳的路由使用间接的下一跳数据结构来引用公共的下一跳数据。 特别地，为了响应网络拓扑的变化，路由器不需要改变所有受影响的路由，而只能改变由中间数据结构引用的公共下一跳数据。 这提高了在网络拓扑变化（如链路故障）后更新路由信息的效率。

公开(公告)号：US07813351B2

公开(公告)日：2010-10-12

申请号：US11787008

申请日：2007-04-13

Applicant: Alok Shriram ,  Sujata Banerjee ,  Praveen Yalagandula ,  Sung-Ju Lee

Inventor： Alok Shriram ,  Sujata Banerjee ,  Praveen Yalagandula ,  Sung-Ju Lee

IPC: H04L12/26 ,  H04L12/28 ,  H04L12/56 ,  G06F15/173

CPC classification number: H04L45/123 ,  H04L41/147 ,  H04L43/0852 ,  H04L45/04 ,  H04L45/125 ,  H04L45/26 ,  H04L45/302 ,  H04L45/46 ,  H04L47/127

Abstract: Feature vectors for nodes in a network are computed based on a network metric. Clusters of the nodes are formed based on the feature vectors. A cluster head is selected for each cluster. Available bandwidths between the cluster head and nodes outside the cluster are determined. The available bandwidths between the cluster head and the nodes outside the cluster may be used as estimations of available bandwidths for the nodes in the cluster.

Abstract translation: 基于网络度量来计算网络中节点的特征向量。 基于特征向量形成节点簇。 为每个集群选择一个集群头。 确定集群头和集群外的节点之间的可用带宽。 群集头和群集外的节点之间的可用带宽可以用作群集中节点的可用带宽的估计。

公开(公告)号：US07792936B2

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

申请号：US10726002

申请日：2003-12-01

Applicant: Zhen Liu ,  George V. Popescu ,  Sambit Sahu

Inventor： Zhen Liu ,  George V. Popescu ,  Sambit Sahu

IPC: G06F15/173

CPC classification number: H04L41/12 ,  H04L45/46 ,  H04L45/64

Abstract: A method and apparatus for managing communications for collaborative applications. Middleware uses, network, application, and middleware resource information together with user information to facilitate communications between the application resources and the users via a hierarchical control structure that implements a communication overlay tree. That overlay tree is implemented in view of network constraints, and on the users and on their communication constraints. The middleware provides user index identifiers that inform the application that specific users have communication interests in specific parts of the application space. To send data to users that are interested in a specific part of the application space the application sends that data with a list of user index identifiers. The middleware then associates the user index identifiers with individual users and routes sent data to the individual users along the overlay tree.

Abstract translation: 一种管理协作应用通信的方法和装置。 中间件使用，网络，应用程序和中间件资源信息以及用户信息，以通过实现通信覆盖树的分层控制结构来促进应用程序资源和用户之间的通信。 鉴于网络约束，以及用户及其通信约束，实现了该覆盖树。 中间件提供用户索引标识符，通知应用程序特定用户在应用程序空间的特定部分具有沟通兴趣。 要将数据发送给对应用空间的特定部分感兴趣的用户，应用程序使用用户索引标识符列表发送该数据。 然后，中间件将用户索引标识符与个别用户相关联，并将发送的数据沿覆盖树路由到各个用户。

公开(公告)号：US20100214932A1

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

申请号：US12380238

申请日：2009-02-25

Applicant: Zhiqiang Qian ,  Paritosh Bajpay ,  Jackson Liu ,  Michael Zinnikas

Inventor： Zhiqiang Qian ,  Paritosh Bajpay ,  Jackson Liu ,  Michael Zinnikas

IPC: H04L12/26

CPC classification number: H04L45/46 ,  H04L41/0677 ,  H04L41/5074 ,  H04L43/0817 ,  H04L45/04

Abstract: Systems and methods are described that analyze Layer 3 network performance between a network and its Intelligent Route Service Control Point (IRSCP) architecture to identify problems without having to disrupt customer service.

Abstract translation: 描述了分析网络与其智能路由服务控制点（IRSCP）架构之间的第3层网络性能的系统和方法，以识别问题，而不必中断客户服务。

公开(公告)号：US07782882B2

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

申请号：US11856334

申请日：2007-09-17

Applicant: Muhammad Akber Qureshi ,  David Brian Lofquist

Inventor： Muhammad Akber Qureshi ,  David Brian Lofquist

IPC: H04J1/16 ,  H04L12/56

CPC classification number: H04L45/48 ,  H04L29/12792 ,  H04L45/04 ,  H04L45/46 ,  H04L45/54 ,  H04L45/7457 ,  H04L61/60 ,  H04L61/6095 ,  H04W40/30

Abstract: A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.

Abstract translation: 计算机实现的方法，装置和用于管理网络中的地址的计算机可用程序代码。 在一个有利的实施例中，使用计算机实现的方法来管理网络中的多个目的地的地址。 总结分配给多个网关的地址以形成包含多个网关的前缀和地址的汇总地址，其中多个网关中的每个网关与其中的每个网关处理的前缀和地址的一部分相关联， 多个网关。 在具有总结地址的最大部分的多个网关中的网关被分配给分配给网络的所有地址的前缀以形成所选择的网关。 所选网关的汇总地址的相关部分将被前缀替换。

公开(公告)号：US07747819B2

公开(公告)日：2010-06-29

申请号：US12222818

申请日：2008-08-18

Applicant: Masanori Fujii

Inventor： Masanori Fujii

IPC: G06F12/00

CPC classification number: G06F3/0658 ,  G06F3/0617 ,  G06F3/067 ,  H04L45/00 ,  H04L45/46

Abstract: A storage system comprises a router, which receives and transfers commands; a plurality of RAID modules; and a switch, which receives commands from the router and transmits the commands to any of the plurality of RAID modules. Each RAID module comprises a plurality of media drives, a RAID group is provided by the plurality of media drives. Each RAID module comprises an independent RAID group which does not extend into other RAID groups. In the storage system, the router performs transfer of commands without performing analysis of commands, and a processor within the RAID module performs command analysis.

Abstract translation: 存储系统包括接收和传送命令的路由器; 多个RAID模块; 以及从路由器接收命令并将命令发送到多个RAID模块中的任一个的交换机。 每个RAID模块包括多个媒体驱动器，由多个媒体驱动器提供RAID组。 每个RAID模块都包含一个不扩展到其他RAID组的独立RAID组。 在存储系统中，路由器执行命令传输，而不执行命令分析，RAID模块内的处理器执行命令分析。

公开(公告)号：US07739404B2

公开(公告)日：2010-06-15

申请号：US11616380

申请日：2006-12-27

Applicant: Hongzhou Li

Inventor： Hongzhou Li

IPC: G06F15/173

CPC classification number: H04L45/04 ,  H04L45/46

Abstract: Described are a Border Gateway Protocol (BGP) network device and method for distributing routing information to a plurality of BGP peers over a network. The BGP network device dynamically calculates a number of groups and a number of BGP peers in each group based on routing information to be distributed. A time interval is specified within which to generate an update message for each BGP peer in a select one of the groups. An update message is generated for each BGP peer in the select group during the time interval. Routes included in the update message for each BGP peer are based on an outbound routing policy for that BGP peer. The update messages are forwarded for transmission to the BGP peers in the select group after the time interval expires.

Abstract translation: 描述了一种用于通过网络向多个BGP对等体分发路由信息的边界网关协议（BGP）网络设备和方法。 BGP网络设备根据要分发的路由信息​​动态计算出每组中的组数和BGP对等体数量。 指定一个时间间隔，在该时间间隔内为所选组中的每个BGP对等体生成更新消息。 在该时间间隔内为选择组中的每个BGP对等体生成一条更新消息。 每个BGP对等体的更新消息中包含的路由都基于该BGP对等体的出站路由策略。 在时间间隔到期后，更新消息转发给选择组中的BGP对等体。

公开(公告)号：US07738404B2

公开(公告)日：2010-06-15

申请号：US11656465

申请日：2007-01-23

Applicant: Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

Inventor： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

IPC: H04L12/28

CPC classification number: H04L67/104 ,  H04L45/46 ,  H04L67/1046 ,  H04L67/1051 ,  H04L67/12

Abstract: A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

Abstract translation: 提供了一种在分布式网络内对节点进行分组的方法。 示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。 接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。 在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。 从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。 在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。 基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

公开(公告)号：US07702765B1

公开(公告)日：2010-04-20

申请号：US10791630

申请日：2004-03-01

Applicant: Robert Raszuk

Inventor： Robert Raszuk

IPC: G06F15/173 ,  H04L12/26

CPC classification number: H04L45/04 ,  H04L45/02 ,  H04L45/32 ,  H04L45/46

Abstract: Techniques for automatically creating a BGP mesh, and more specifically, an iBGP mesh, are provided. Peering information is flooded to routers within a network AS. The peering information is analyzed and a list of neighbors is created. BGP sessions are then performed with the neighbors to establish the BGP mesh.

Abstract translation: 提供了自动创建BGP网格的技术，更具体地说是iBGP网格。 对等信息被洪泛到网络AS内的路由器。 分析对等信息，并创建一个邻居列表。 然后与邻居执行BGP会话以建立BGP网格。