MULTIPLE PATH AVAILABILITY BETWEEN WALKABLE CLUSTERS
    1.
    发明申请
    MULTIPLE PATH AVAILABILITY BETWEEN WALKABLE CLUSTERS 有权
    沃尔特群集之间的多路径可用性

    公开(公告)号:US20140122741A1

    公开(公告)日:2014-05-01

    申请号:US13768453

    申请日:2013-02-15

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

    Abstract: In one embodiment, a method comprises creating, in a computing network, a hierarchal routing topology for reaching a destination, the hierarchal routing topology comprising a single parent supernode providing reachability to the destination, and a plurality of child supernodes, each child supernode comprising one or more exit network devices each providing a corresponding link to the parent supernode; receiving, in one of the child supernodes, a data packet for delivery to the destination; causing the data packet to traverse along any available data link in the one child supernode independent of any routing topology established by network devices in the one child supernode, until the data packet reaches one of the exit network devices; and the one exit network device forwarding the data packet to the parent supernode, via the corresponding link, for delivery to the destination.

    Abstract translation: 在一个实施例中,一种方法包括在计算网络中创建用于到达目的地的分层路由拓扑,所述分层路由拓扑包括提供到达目的地的可达性的单个父超节点以及多个子超节点,每个子超节点包括一个 或多个出口网络设备,每个退出网络设备提供到父级超级节点的对应链路; 在其中一个子超文本中接收用于传送到目的地的数据包; 使得数据分组沿着所述一个子超节点中的任何可用数据链路遍历,独立于由所述一个子超节点中的网络设备建立的任何路由拓扑,直到所述数据分组到达所述退出网络设备之一; 并且一个出口网络设备经由相应的链路将数据分组转发到父超节点,以传送到目的地。

Patent Agency Ranking