Abstract:
A technique may improve LDP-IGP synchronization in a MPLS network when an interface of a router coupled to a communications link along a shortest path between a source router and a destination router becomes newly active. Specifically, an IGP adjacency may be held down over the newly active link while a LDP adjacency is established over the link. The router may inject a temporary, non-redistributable route having a large administrative weight into its routing table utilizing addresses learned during establishment of the LDP adjacency. The injected route ensures that there is a reachable route to a peer router so that LDP may converge. After LDP has converged and all needed label bindings have been distributed in the MPLS network utilizing the injected route, IGP executing on the router may advertise a normal cost metric for the link associated with the newly active interface, and IGP convergence may be completed.
Abstract:
A method for establishing a Virtual Local Area Network (VLAN) connection is provided, which includes: receiving a first signaling message, in which the first signaling message includes an unused VLAN ID and explicit routing information; registering the VLAN ID by using the at least one unused VLAN ID; and sending the first signaling message according to the explicit routing information. Several node apparatuses and several systems are also provided in the present invention. Therefore, automatic VLAN configuration is performed in an environment without a spanning tree protocol, and traffic engineering is supported simultaneously.
Abstract:
A technique may improve LDP-IGP synchronization in a MPLS network when an interface of a router coupled to a communications link along a shortest path between a source router and a destination router becomes newly active. Specifically, an IGP adjacency may be held down over the newly active link while a LDP adjacency is established over the link. The router may inject a temporary, non-redistributable route having a large administrative weight into its routing table utilizing addresses learned during establishment of the LDP adjacency. The injected route ensures that there is a reachable route to a peer router so that LDP may converge. After LDP has converged and all needed label bindings have been distributed in the MPLS network utilizing the injected route, IGP executing on the router may advertise a normal cost metric for the link associated with the newly active interface, and IGP convergence may be completed.
Abstract:
Label Distribution Protocol (LDP) extensions are described that enable distribution of neighbor-label mappings for directly connected neighbor routers. A router capable of supporting the LDP extensions distributes neighbor-labels to be used by the router to label switch traffic destined for the directly connected neighbor router irrespective of a hop-by-hop Interior Gateway Protocol (IGP) path determined based on link metrics. In some examples, the neighbor-labels may increase backup coverage, e.g., link protection and/or node protection, in a network that, due to link metrics, does not have a viable loop-free alternate (LFA) path between an ingress router and an egress router of a label switched path (LSP). In other examples, the neighbor-labels may improve load balancing by enabling an ingress router in a first autonomous system (AS) to select a particular remote link on which to send traffic destined for remote routers in a second AS.
Abstract:
Techniques are disclosed for aggregating label-switched paths (LPSs). One method for aggregating LSPs may include a first node comparing forwarding equivalence classes (FECs) associated with respective label-switched paths (LSPs). The first node identifies FECs that differ by a given number of bits, such as one or two bits based on the comparison. The first node generates an aggregate FEC that masks out the differing bits, thereby reducing the number of LSPs. The first node transmits the aggregate FEC to an ingress node.
Abstract:
A path control system, includes: a forwarding network in which each forwarding node belongs to a group and forwards a packet based on a sub-label corresponding to the group; an edge node that adds a label including a plurality of sub-labels based on information contained in a received packet; and a control apparatus that performs path control of the forwarding network by controlling a combination of sub-labels added by the edge node and by controlling forwarding processing performed based on the sub-labels by the forwarding node(s). When a failure has occurred in a communication path, the control apparatus causes the edge node to change a sub-label corresponding to a failure section of the communication path in which a failure has occurred out of sub-labels added to a packet received after the failure, and causes the forwarding node(s) to forward a packet along a path that does not go through the failure section.
Abstract:
An application node advertises service(s), using a routing protocol, that it offers to other network nodes. For example, the routing protocol used to advertise service(s) in a Service Provider Network is typically an link-state, Interior Gateway Protocol (IGP), such as, but not limited to, Intermediate System to Intermediate System (IS-IS) or Open Shortest Path First (OSPF). Packets are encapsulated and sent from a service node (e.g., packet switching device) using one or more advertised services applied to a packet by an application node (e.g., a packet switching device and/or computing platform such as a Cisco ASR 1000).
Abstract translation:应用程序节点使用其提供给其他网络节点的路由协议来通告服务。 例如,用于在服务提供商网络中通告服务的路由协议通常是链路状态内部网关协议(IGP),例如但不限于中间系统到中间系统(IS-IS) 或开放最短路径优先(OSPF)。 使用由应用节点(例如,分组交换设备和/或诸如Cisco ASR 1000的计算平台)应用于分组的一个或多个通告的服务,将分组封装并从服务节点(例如,分组交换设备)发送。
Abstract:
In a central controller, a method for managing resources comprising sending a request to a node in a domain controlled by the central controller, wherein the request requests at least a portion of a resource of the node, receiving a response from the node, wherein the response contains information on the availability of the portion of the resource, and storing the information on the availability of the portion of the resource for use in establishing a multiprotocol label switching (MPLS) label switched path (LSP).
Abstract:
Methods, apparatus, systems and articles of manufacture (e.g., physical storage media, such as storage devices and/or storage disks) to implement label stack identification for lawful interception of virtual private network traffic are disclosed. Example methods disclosed herein can include detecting a trigger that is to cause synchronization of label stack data associated with first virtual private network traffic to be intercepted, the label stack data used to route the first virtual private network traffic in a network. Such example methods can also include, in response to detecting the trigger, initiating execution of a first command on a first router in the network to determine a first label used to route the first virtual private network traffic in the network. Such example methods can further include determining a current label stack for the first virtual private network traffic based on the first label.
Abstract:
A computer program product comprising computer executable instructions stored on a non-transitory medium of an upstream node in a network system comprising a plurality of nodes that when executed by a processor cause the node to advertise an upstream assigned label to a downstream node, receive a message from the downstream node, and if the received message confirms that no conflict with the upstream assigned label exists at the downstream node, assign the upstream-assigned label, or if the received message confirms that a conflict with the upstream-assigned label exists at the downstream node, either select a new upstream-assigned label or wait until indication is received that the label resource has become available.