DIFFERENTIAL FORWARDING IN ADDRESS-BASED CARRIER NETWORKS
    1.
    发明申请
    DIFFERENTIAL FORWARDING IN ADDRESS-BASED CARRIER NETWORKS 有权
    基于地址的运营商网络的差异转发

    公开(公告)号:US20080310417A1

    公开(公告)日:2008-12-18

    申请号:US12196909

    申请日:2008-08-22

    IPC分类号: H04L12/56

    摘要: The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.

    摘要翻译: 本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。 描述了在包括诸如以太网交换机的节点(71-75和78)的基于帧的通信网络中建立连接(76,77)的方法和连接控制器。 通过在各种节点中配置用于转发数据帧(例如以太网帧)的映射来建立连接。 映射来自a)与该连接的目的地(或源)节点(73)对应的目的地(或源)地址的组合,以及b)诸如VLAN标签的标识符。 映射到各个节点的选定输出端口。 通过使用目的地(或源)地址AND标识符的组合,映射使得属于不同连接(76,77)的数据帧能够在节点(75)处差分地转发(即,在不同的输出端口上转发),尽管不同的连接 具有相同的目的地节点。 这使得路由连接的灵活性和执行流量工程的能力。

    Differential forwarding in address-based carrier networks
    2.
    发明授权
    Differential forwarding in address-based carrier networks 有权
    基于地址的运营商网络中的差分转发

    公开(公告)号:US08923292B2

    公开(公告)日:2014-12-30

    申请号:US10593108

    申请日:2005-04-06

    IPC分类号: H04L12/28 H04J3/24

    摘要: The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.

    摘要翻译: 本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。 描述了在包括诸如以太网交换机的节点(71-75和78)的基于帧的通信网络中建立连接(76,77)的方法和连接控制器。 通过在各种节点中配置用于转发数据帧(例如以太网帧)的映射来建立连接。 映射来自a)与该连接的目的地(或源)节点(73)对应的目的地(或源)地址的组合,以及b)诸如VLAN标签的标识符。 映射到各个节点的选定输出端口。 通过使用目的地(或源)地址AND标识符的组合,映射使得属于不同连接(76,77)的数据帧能够在节点(75)处差分地转发(即,在不同的输出端口上转发),尽管不同的连接 具有相同的目的地节点。 这使得路由连接的灵活性和执行流量工程的能力。

    Differential forwarding in address-based carrier networks
    3.
    发明授权
    Differential forwarding in address-based carrier networks 有权
    基于地址的运营商网络中的差分转发

    公开(公告)号:US08194668B2

    公开(公告)日:2012-06-05

    申请号:US12196909

    申请日:2008-08-22

    IPC分类号: H04L12/28

    摘要: The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.

    摘要翻译: 本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。 描述了在包括诸如以太网交换机的节点(71-75和78)的基于帧的通信网络中建立连接(76,77)的方法和连接控制器。 通过在各种节点中配置用于转发数据帧(例如以太网帧)的映射来建立连接。 映射来自a)与该连接的目的地(或源)节点(73)对应的目的地(或源)地址的组合,以及b)诸如VLAN标签的标识符。 映射到各个节点的选定输出端口。 通过使用目的地(或源)地址AND标识符的组合,映射使得属于不同连接(76,77)的数据帧能够在节点(75)处差分地转发(即,在不同的输出端口上转发),尽管不同的连接 具有相同的目的地节点。 这使得路由连接的灵活性和执行流量工程的能力。

    Differential Forwarding in Address-Based Carrier Networks
    4.
    发明申请
    Differential Forwarding in Address-Based Carrier Networks 有权
    基于地址的运营商网络的差分转发

    公开(公告)号:US20080279196A1

    公开(公告)日:2008-11-13

    申请号:US10593108

    申请日:2005-04-06

    IPC分类号: H04L12/28

    摘要: The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.

    摘要翻译: 本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。 描述了在包括诸如以太网交换机的节点(71-75和78)的基于帧的通信网络中建立连接(76,77)的方法和连接控制器。 通过在各种节点中配置用于转发数据帧(例如以太网帧)的映射来建立连接。 映射来自a)与该连接的目的地(或源)节点(73)对应的目的地(或源)地址的组合,以及b)诸如VLAN标签的标识符。 映射到各个节点的选定输出端口。 通过使用目的地(或源)地址AND标识符的组合,映射使得属于不同连接(76,77)的数据帧能够在节点(75)处差分地转发(即,在不同的输出端口上转发),尽管不同的连接 具有相同的目的地节点。 这使得路由连接的灵活性和执行流量工程的能力。

    TIE-BREAKING IN SHORTEST PATH DETERMINATION
    5.
    发明申请
    TIE-BREAKING IN SHORTEST PATH DETERMINATION 失效
    在最短路径确定中进行切割

    公开(公告)号:US20110128857A1

    公开(公告)日:2011-06-02

    申请号:US13023823

    申请日:2011-02-09

    IPC分类号: H04L12/26

    摘要: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

    摘要翻译: 通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短(最低成本)路径之间的一致的断开决定。 或者,通过使用树的分支分支的节点标识符选择等价路径,可以实时地实现与最短路径树相同的结果。 这两种变体允许对等成本路径进行一致的选择,而不管网络中哪些地方计算最短路径。 这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

    Failure notification in a network having serially connected nodes
    6.
    发明申请
    Failure notification in a network having serially connected nodes 失效
    具有串行连接节点的网络中的故障通知

    公开(公告)号:US20080259784A1

    公开(公告)日:2008-10-23

    申请号:US12148418

    申请日:2008-04-18

    IPC分类号: G01R31/08

    摘要: Multicast capabilities of a link state protocol controlled network are used to accelerate the flooding advertisement of topology change notifications within portions of the network. This flooding mechanism may be particularly efficient in a network with a large number of two-connected nodes such as a ring network architecture. A control plane specific multicast group address is used when flooding topology change notifications, and a process such as reverse path forwarding check is used as an additional control on forwarding of the notification to prevent looping of control plane packets. Two-connected nodes insert a forwarding entry into their FIB to enable frames containing the control message to be forwarded via the data plane on to the downstream node so that propagation of the control message along a chain of two-connected nodes may occur at data plane speeds.

    摘要翻译: 链路状态协议控制网络的组播功能用于加速网络部分内的拓扑变化通知的泛洪广告。 这种洪泛机制在具有大量双连接节点(例如环网架构)的网络中可能是特别有效的。 泛洪拓扑变化通知时使用控制平面特定的组播组地址,并且使用诸如反向路径转发检查之类的过程作为通知转发的附加控制,以防止控制平面分组的循环。 双连接节点将转发条目插入到其FIB中,以使包含控制消息的帧能够经由数据平面转发到下游节点,使得控制消息沿双连接节点链的传播可能发生在数据平面 速度。

    Engineered paths in a link state protocol controlled Ethernet network
    7.
    发明申请
    Engineered paths in a link state protocol controlled Ethernet network 审中-公开
    链路状态协议控制的以太网网络中的工程路径

    公开(公告)号:US20080107027A1

    公开(公告)日:2008-05-08

    申请号:US11732381

    申请日:2007-04-03

    IPC分类号: H04L12/56

    摘要: Traffic Engineered (TE) paths may be created over a link state protocol controlled Ethernet network by causing explicit paths to be installed by network elements on the link state protocol controlled Ethernet network and used to forward traffic on the network. The network elements exchange routing information using link state advertisements to enable each node on the network to build a link state database that may be used to determine shortest paths through the network. The shortest paths are used as a default forwarding state for traffic that is not associated with one of the traffic engineered paths. The link state advertisements may also be used to carry the TE path definitions. Where the TE paths are to be used exclusive of other routes, forwarding state for particular service instances may be removed to prevent traffic from traversing the network other than over the TE path.

    摘要翻译: 可以通过在链路状态协议控制的以太网上的网络元件安装明确的路径,并且用于在网络上转发流量来在链路状态协议控制的以太网上创建流量工程(TE)路径。 网络元件使用链路状态通告来交换路由信息,以使网络上的每个节点建立可用于确定通过网络的最短路径的链路状态数据库。 最短路径用作与未与某个交通工程路径相关联的流量的默认转发状态。 链路状态通告也可以用于承载TE路径定义。 在TE路径被排除在其他路由之外的情况下,可以去除特定服务实例的转发状态,以防止流经过TE路径以外的网络。

    Failure notification in a network having serially connected nodes
    8.
    发明授权
    Failure notification in a network having serially connected nodes 有权
    具有串行连接节点的网络中的故障通知

    公开(公告)号:US08885490B2

    公开(公告)日:2014-11-11

    申请号:US13528483

    申请日:2012-06-20

    摘要: Multicast capabilities of a link state protocol controlled network are used to accelerate the flooding advertisement of topology change notifications within portions of the network. This flooding mechanism may be particularly efficient in a network with a large number of two-connected nodes such as a ring network architecture. A control plane specific multicast group address is used when flooding topology change notifications, and a process such as reverse path forwarding check is used as an additional control on forwarding of the notification to prevent looping of control plane packets. Two-connected nodes insert a forwarding entry into their FIB to enable frames containing the control message to be forwarded via the data plane on to the downstream node so that propagation of the control message along a chain of two-connected nodes may occur at data plane speeds.

    摘要翻译: 链路状态协议控制网络的组播功能用于加速网络部分内的拓扑变化通知的泛洪广告。 这种洪泛机制在具有大量双连接节点(例如环网架构)的网络中可能是特别有效的。 泛洪拓扑变化通知时使用控制平面特定的组播组地址,并且使用诸如反向路径转发检查之类的过程作为通知转发的附加控制,以防止控制平面分组的循环。 双连接节点将转发条目插入到其FIB中,以使包含控制消息的帧能够经由数据平面转发到下游节点,使得控制消息沿双连接节点链的传播可能发生在数据平面 速度。

    Failure notification in a network having serially connected nodes
    9.
    发明授权
    Failure notification in a network having serially connected nodes 失效
    具有串行连接节点的网络中的故障通知

    公开(公告)号:US08223660B2

    公开(公告)日:2012-07-17

    申请号:US12148418

    申请日:2008-04-18

    IPC分类号: G01R31/08 H04L12/28

    摘要: Multicast capabilities of a link state protocol controlled network are used to accelerate the flooding advertisement of topology change notifications within portions of the network. This flooding mechanism may be particularly efficient in a network with a large number of two-connected nodes such as a ring network architecture. A control plane specific multicast group address is used when flooding topology change notifications, and a process such as reverse path forwarding check is used as an additional control on forwarding of the notification to prevent looping of control plane packets. Two-connected nodes insert a forwarding entry into their FIB to enable frames containing the control message to be forwarded via the data plane on to the downstream node so that propagation of the control message along a chain of two-connected nodes may occur at data plane speeds.

    摘要翻译: 链路状态协议控制网络的组播功能用于加速网络部分内的拓扑变化通知的泛洪广告。 这种洪泛机制在具有大量双连接节点(例如环网架构)的网络中可能是特别有效的。 泛洪拓扑变化通知时使用控制平面特定的组播组地址,并且使用诸如反向路径转发检查之类的过程作为通知转发的附加控制,以防止控制平面分组的循环。 双连接节点将转发条目插入到其FIB中,以使包含控制消息的帧能够经由数据平面转发到下游节点,使得控制消息沿双连接节点链的传播可能发生在数据平面 速度。

    Tie-breaking in shortest path determination
    10.
    发明授权
    Tie-breaking in shortest path determination 有权
    在最短路径确定中断断

    公开(公告)号:US07911944B2

    公开(公告)日:2011-03-22

    申请号:US11964478

    申请日:2007-12-26

    IPC分类号: G01R31/08

    摘要: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

    摘要翻译: 通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短(最低成本)路径之间的一致的打破决定。 或者,通过使用树的分支分支的节点标识符选择等价路径,可以实时地实现与最短路径树相同的结果。 这两种变体允许对等成本路径进行一致的选择,而不管网络中哪些地方计算最短路径。 这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。