Patent application number | Description | Published |
20080225711 | DYNAMIC RESPONSE TO TRAFFIC BURSTS IN A COMPUTER NETWORK - In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay. | 09-18-2008 |
20080320166 | AUTOMATIC PRIORITIZATION OF BGP NEXT-HOP IN IGP CONVERGENCE - In one embodiment, an inter-domain routing protocol stores an inter-domain routing protocol route having an associated next-hop address. A routing table is searched for an for an intra-domain routing protocol route that may be used to reach the next-hop address of the inter-domain routing protocol route. Such route is marked as an important route for convergence. Later, in response to a change in the network requiring a routing table update, the intra-domain routing protocol route marked as an important route for convergence is processed by an intra domain routing protocol before any other intra-domain routing protocol routes are processed that are not marked as important routes for convergence. | 12-25-2008 |
20090182894 | DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS - In one embodiment, a first path computation element (PCE) operates between first and second network domains, and is adapted to service requests from path computation clients (PCCs) in at least the first domain. In response to a backup event (e.g., failure of a second PCE), a backup PCE in the second domain may be informed of path computation information for the first domain used by the first PCE, and tunnels may be bi-directionally established between the first PCE and the backup PCE. Once the tunnels are established, the backup PCE may be advertised into the first domain, and the backup PCE may operate to load balance service requests for the first domain through the bi-directionally established tunnels. | 07-16-2009 |
20090232031 | RECEIVER-BASED CONSTRUCTION OF POINT-TO-MULTIPOINT TREES USING PATH COMPUTATION ELEMENTS IN A COMPUTER NETWORK - In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node. | 09-17-2009 |
20090245259 | FAST REROUTE (FRR) PROTECTION AT THE EDGE OF A RFC 2547 NETWORK - In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path. | 10-01-2009 |
20100118732 | LOOP PREVENTION TECHNIQUE FOR MPLS USING SERVICE LABELS - In one embodiment, a loss of communication is detected between a first edge device of a computer network and a neighboring routing domain. A data packet is received at the first edge device, where the received data packet contains a destination address that is reachable via the neighboring routing domain. A determination is made whether a service label is located in a Multi-Protocol Label Switching (MPLS) label stack included in the received data packet. A service label in the MPLS label stack indicates that the received data packet was previously rerouted in accordance with fast reroute (FRR) operations. In response to a determination that the received data packet does not include a service label in the MPLS label stack, the received data packet is rerouted to a second edge device of the computer network for forwarding to the neighboring routing domain. | 05-13-2010 |
20100146149 | DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS - In one embodiment, one or more path computation requests from path computation clients (PCCs) in a first network domain are received at a first border router (BR) arranged at the border of the first network domain and a second network domain. The first BR learns of a path communication element (PCE) in the second network domain. The PCE in the second network domain is informed of path computation information for the first network domain. One or more tunnels are established between the first BR and the PCE in the second network domain. One or more path computation requests from PCCs in the first network domain are passed from the first BR, through the one or more tunnels, to the PCE in the second network domain, to be serviced by the PCE in the second network domain using the path computation information for the first network domain. | 06-10-2010 |
20110228785 | AUTOMATIC ROUTE TAGGING OF BGP NEXT-HOP ROUTES IN IGP - In one embodiment, a router in a routing domain exchanges routing information with one or more other routers located external to the routing domain using an exterior gateway protocol (EGP). The router exchanges routing information with one or more other routers located internal to the routing domain using an interior gateway protocol (IGP). The router detects a route to be advertised by the IGP is also used as a next-hop attribute of a route advertised by the EGP. In response, the router tags the route advertised by the IGP as an important route for convergence to indicate that the tagged route is to be processed before other routes that have not been tagged during convergence processing. The tagged route is advertised within the routing domain using the IGP. | 09-22-2011 |
20110258257 | PROXIMITY AGGREGATED NETWORK TOPOLOGY ALGORITHM (PANTA) - In one embodiment, each proximity server of a proximity network computes a distance from each particular location-community for which the proximity server is responsible to each location-community within the proximity network, wherein each distance is from a root location-community to a leaf location-community. The proximity servers may then share each computed distance with the other proximity servers within the proximity network, such that each proximity server in the proximity network maintains a distance between each location-community in the proximity network. Accordingly, a proximity server may then service proximity requests for content through performance of a lookup operation into the shared computed distances based on a root location-community being a location-community of an originator of the content requested within the proximity request and a leaf location-community being a location-community of a receiver of the content requested within the proximity request. | 10-20-2011 |
20140016644 | PROPAGATION OF ROUTING INFORMATION IN RSVP-TE FOR INTER-DOMAIN TE-LSPs - In one embodiment, a traffic engineering (TE) label switched path (LSP) is established between a head-end node in a local domain and a tail-end node in a remote domain. The TE-LSP spans one or more intervening domains located between the local domain and the remote domain. The head-end node sends a routing information request over the TE-LSP to a target node on the TE-LSP that is in the remote domain. The head end node receives routing information from the target node. The received routing information includes a list of address prefixes reachable by the target node. The head end node uses the received routing information to calculate routes reachable via the TE-LSP to the target node. The calculated routes have a next-hop interface set to be the TE-LSP. The calculated routes are inserted into a routing table of the head-end node. | 01-16-2014 |