Abstract:
In one embodiment, a router receives a call request for establishing a multimedia exchange between two remote endpoints. The router selects a processing entity to manage a subset of connections with the remote endpoints according to an endpoint identification such as a remote address included in the call request. A different processing entity manages the remaining connections with the remote endpoints. Accordingly, the load of managing signaling for establishing the multimedia exchange is balanced between a plurality of processing elements that appear externally as a single entity such that modification of remote endpoint behavior is not required.
Abstract:
A virtual router (VR) communication arrangement enables services on different VRs executing on the same physical router to communicate without utilizing or substantially consuming communication resources, such as a network protocol stack and physical interfaces, of the physical router. The services are illustratively implemented as separately-scheduled VR processes executing on the physical router. A virtual router forwarding information base (vrFIB) is provided within a client socket library of each VR process and is used to determine whether the services are on the same physical router. If so, a lightweight interconnection is created between the services and a message (“packet”) is forwarded over that interconnection to effectuate communication. If the services are not on the same physical router, the packet is sent over the network protocol stack and communication is established using the communication resources of the router.
Abstract:
Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per-prefix reachability basis.
Abstract:
In one embodiment, a router generates a notification message that indicates the router is to be gracefully removed from service. The router sends the notification message to peers of the router in a network. The router then continues to forward packets for a grace period after sending the notification message, to permit backup paths to be propagated to peers, and to be put into service, prior to withdrawal from service of paths through the router. Thereafter, the router is removed from service at the expiration of the grace period.
Abstract:
An apparatus for providing reachability in a routing domain of a data communications network having as components nodes and links therebetween for a routing domain—external destination address is described. The apparatus is arranged to advertise destination address reachability internally to nodes in the routing domain and associate a reachability category with said internal advertisement of said destination address reachability.
Abstract:
A technique efficiently and dynamically maintains bidirectional forwarding detection (BFD) on a bundle of links in a computer network. According to the novel technique, one or more “standby” BFD sessions may be established on one or more corresponding line cards (LCs), the LCs having one or more links of the bundle (bundle links). Once established, one of the standby BFD sessions may be selected as an “active” BFD session based on activity of one of the bundle links of the corresponding LC. Also, BFD messages may be transmitted from one of the bundle links of the active BFD session, e.g., the link receiving BFD messages. In response to inactivity of the transmitting link (e.g., failure, removal, etc.), the active BFD session may switch to another available active bundle link, and if no other active bundle links are available to the active BFD session, one of the standby BFD sessions is selected as the new active BFD session. In the event no other standby BFD sessions exist, the link bundle is determined to have failed.
Abstract:
Systems and methods include providing a router that may be deployed as multiple logical routers that share a common fast interconnect. These logical routers may functionally serve as core routers, peering routers, aggregation routers, etc. A further aspect of the system and methods is that the resources assigned to a logical router are allocated from a pool potentially including multitude of hardware cards. A further aspect of the system and methods is that a logical router may be independently managed by the owner of the router or by an owner of the logical router.
Abstract:
A technique efficiently selects a Path Computation Element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, using (i) a low-pass filter algorithm to compute such resources, and (ii) threshold determinations to control distribution of those advertisements. To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to a Path Computation Client (PCC) by way of the controlled advertisements. In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
Abstract:
A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
Abstract:
An example method includes detecting a failure at a first network element, the failure is associated with a link between the first network element and a second network element. The method also includes generating a list of network elements to be notified based on the failure, the second network element is included on the list. The method further includes generating an alarm indication signal (AIS) message, the AIS message identifies a plurality of tunnels affected by the failure. The AIS message is communicated to the second network element. In more detailed embodiments, each link between the first network element and the second network element includes a globally unique link identifier, which includes an associated autonomous system number. The globally unique link identifier can represent a string to be associated with the plurality of tunnels, the globally unique link identifier includes a source address and a destination address.