Communication techniques and generic layer 3 automatic switching protection
    81.
    发明申请
    Communication techniques and generic layer 3 automatic switching protection 有权
    通信技术和通用层3自动切换保护

    公开(公告)号:US20080212610A1

    公开(公告)日:2008-09-04

    申请号:US11713504

    申请日:2007-03-02

    IPC分类号: H04J3/16

    摘要: In one embodiment, software code in a respective computer system such as one or more data communication devices establishes multiple layer 2 network links between a first data communication device and a second data communication device. The first data communication device and the second data communication device include corresponding layer 3 interfaces enabling layer 3 network communications over each of the multiple layer 2 network links. The first and second data communication devices route traffic over one (e.g., a primary layer 2 link) of the multiple layer 2 network links using the layer 3 network communications. The private links are media independent. Upon detection of a failure associated with the primary layer 2 link, the data communication devices can automatically switch to sending traffic over a backup link of the multiple layer 2 network links without disrupting publicly advertised routing topology information.

    摘要翻译: 在一个实施例中,诸如一个或多个数据通信设备的相应计算机系统中的软件代码在第一数据通信设备和第二数据通信设备之间建立多个第2层网络链路。 第一数据通信设备和第二数据通信设备包括相应的层3接口,其能够在多层2网络链路中的每一个上实现层3网络通信。 第一和第二数据通信设备使用第3层网络通信路由多层2网络链路的一个(例如,主层2链路)上的业务。 私人链接是媒体独立的。 在检测到与主层2链路相关联的故障时,数据通信设备可以自动切换到通过多层2网络链路的备份链路发送流量,而不会中断公开发布的路由拓扑信息。

    Rerouting multicast traffic in response to detecting imminent network disruption
    82.
    发明申请
    Rerouting multicast traffic in response to detecting imminent network disruption 有权
    响应于即将发生的网络中断,重新路由多播流量

    公开(公告)号:US20070189193A1

    公开(公告)日:2007-08-16

    申请号:US11355525

    申请日:2006-02-16

    IPC分类号: H04L12/28

    摘要: Various systems and method for rerouting multicast traffic in response to detecting imminent network disruption are disclosed. One method involves detecting an imminent topology change and, in response, identifying a new multicast distribution tree for a multicast group. A join message for the multicast group is then sent towards a root of the new multicast distribution tree. Multicast traffic addressed to the multicast group continues to be forwarded via the current multicast distribution tree, subsequent to sending the join message. The multicast traffic is not forwarded via the new multicast distribution tree until one or more multicast data packets have been received via the new multicast distribution tree.

    摘要翻译: 公开了响应于即将发生的网络中断而重新组播多播流量的各种系统和方法。 一种方法涉及检测即将发生的拓扑变化,并且作为响应,识别组播组的新的多播分发树。 然后将多播组的加入消息发送到新的多播分发树的根。 发送加入消息后,寻址到组播组的组播流量将继续通过当前的组播分发树进行转发。 组播流量不会通过新的组播分发树转发,直到通过新的组播分发树接收到一个或多个组播数据包。

    System and methods for providing a network path verification protocol
    86.
    发明申请
    System and methods for providing a network path verification protocol 审中-公开
    提供网络路径验证协议的系统和方法

    公开(公告)号:US20060262772A1

    公开(公告)日:2006-11-23

    申请号:US11135253

    申请日:2005-05-23

    IPC分类号: H04L12/28

    摘要: A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a network path identifies connectivity and transmission characteristic attributes by defining, implementing, and analyzing path verification messages (PVMs) in a VPN environment. Typical VPN environments are characterized by service level agreements (SLAs) between service providers which specify particular service level and/or bandwidth level guarantees, typically in terms of megabits per second (MB/s) or other qualitative transfer criteria. Such guarantees are often expressed in contractual terms as Quality of Service (QoS) criteria. Configurations herein provide a mechanism for determination of paths and/or routes that satisfy a QoS or other delivery speed/bandwidth guarantee. Such a mechanism may therefore be employed to perform routing decisions for QoS based traffic. Further, such a mechanism is employable to verify QoS levels and related attributes related to contractual terms between service providers and customers.

    摘要翻译: 路径验证协议(PVP),其列举沿着网络路径发送到一组节点或路由器的一系列消息,通过在VPN环境中定义,实现和分析路径验证消息(PVM)来识别连接性和传输特性属性 。 典型的VPN环境的特征在于服务提供商之间的服务级别协议(SLA),其指定特定服务级别和/或带宽级别保证,通常以兆比特每秒(MB / s)或其他定性传输标准。 这种保证通常以合同条款表示为服务质量(QoS)标准。 本文中的配置提供了用于确定满足QoS或其他传送速度/带宽保证的路径和/或路由的机制。 因此可以采用这种机制来执行基于QoS的业务的路由决策。 此外,这种机制可用于验证与服务提供商和客户之间的合同条款相关的QoS等级和相关属性。

    Dynamic retrieval of routing information for inter-AS TE-LSPs

    公开(公告)号:US20060209716A1

    公开(公告)日:2006-09-21

    申请号:US11081097

    申请日:2005-03-15

    IPC分类号: H04L12/28 H04L12/56

    摘要: A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request/response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.

    Computation of a shortest inter-domain TE-LSP across a set of autonomous systems
    88.
    发明申请
    Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权
    跨一组自治系统的最短域间TE-LSP的计算

    公开(公告)号:US20060200579A1

    公开(公告)日:2006-09-07

    申请号:US11073348

    申请日:2005-03-04

    IPC分类号: G06F15/173

    摘要: A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.

    摘要翻译: 一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程(TE)标签交换路径(LSP)的最短路径。 新颖的路径计算技术确定了一组不同的远程域,TE-LSP可以通过该组来遍历尾端节点(例如沿着“域路由”)。 一旦确定了可能的路由集合,则前端节点向其本地域的一个或多个路径计算元件(PCE)发送路径计算请求,请求每个域路由的计算路径。 在接收每个可能的域路由的路径响应时,前端节点选择最优(最短)路径,并相应建立TE-LSP。

    Inter-domain TE-LSP selection
    89.
    发明申请
    Inter-domain TE-LSP selection 有权
    域间TE-LSP选择

    公开(公告)号:US20060120288A1

    公开(公告)日:2006-06-08

    申请号:US11001784

    申请日:2004-12-02

    IPC分类号: H04J1/16 H04L12/56

    摘要: A technique selects a traffic engineering (TE) label switched path (LSP) from among a plurality of TE-LSPs, each of which spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain, in order to reach one or more address prefixes within the remote domain. The inter-domain TE-LSP selection technique comprises a selection algorithm executed by the head-end node and based on predetermined TE-LSP attributes (e.g., bandwidth, cost, etc.) and/or address prefix reachability attributes (e.g., cost from a tail-end node to the prefix) to select an appropriate inter-domain TE-LSP for the reachable address prefix. The selection algorithm is embodied in one of two modes: (i) a hierarchical selection mode, or (ii) a weighted selection mode. In addition, the technique comprises a load balancing aspect that cooperates with the selection algorithm to enable the head-end node to balance traffic loads among the multiple TE-LSPs based on the results of the selection algorithm.

    摘要翻译: 一种技术从多个TE-LSP中选择流量工程(TE)标签交换路径(LSP),每个TE-LSP跨越从本地域的头端节点到终端节点的计算机网络的多个域 的远程域,以便达到远程域内的一个或多个地址前缀。 域间TE-LSP选择技术包括由前端节点执行并基于预定的TE-LSP属性(例如,带宽,成本等)和/或地址前缀可达性属性(例如,来自 到前缀的尾端节点)为可达地址前缀选择适当的域间TE-LSP。 选择算法以两种模式之一体现:(i)分层选择模式,或(ii)加权选择模式。 此外,该技术包括与选择算法配合的负载平衡方面,以使头端节点能够基于选择算法的结果来平衡多个TE-LSP之间的业务负载。

    Propagation of routing information in RSVP-TE for inter-domain TE-LSPs

    公开(公告)号:US20060117110A1

    公开(公告)日:2006-06-01

    申请号:US11001349

    申请日:2004-12-01

    IPC分类号: G06F15/16

    摘要: A technique dynamically retrieves reachability information from a target node, including a tail-end or any intermediate node, along a traffic engineering (TE) label switched path (LSP) that spans multiple domains in a computer network. The interdomain information retrieval technique is illustratively based on a request/response signaling exchange whereby at least a portion of the reachability, i.e., routing, information maintained by the target node is propagated to a head-end node of the TE-LSP. The routing information may comprise a list of address prefixes reachable by the target node, but may optionally include next-hop and metric attributes associated with those prefixes. The head-end node uses the retrieved routing information to calculate routes reachable from the target node for insertion into its routing table.