Patent application number | Description | Published |
20090010153 | Fast remote failure notification - A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification. | 01-08-2009 |
20090016365 | Intra-domain and inter-domain bridging over MPLS using MAC distribution via border gateway protocol - In one embodiment, a method includes receiving, by a first autonomous system border router (ASBR) of a first autonomous system (AS), a first plurality of provider-provisioned media access control (B-MAC) addresses via Interior Border Gateway Protocol (I-BGP). Each of first plurality of B-MAC addresses is associated with a provider edge (PE) device of the first AS. The first ASBR sends the first plurality of B-MAC addresses to a second ASBR of a second AS using Exterior Border Gateway Protocol (E-BGP). The first ASBR also receives via E-BGP a second plurality of B-MAC addresses each of which is associated with a PE device of the second AS. The first ASBR then distributes the second plurality of B-MAC addresses to each of the PE devices of the first AS using I-BGP. | 01-15-2009 |
20090144390 | OPTIMIZING NETWORK RESOURCES USAGE WITHIN AN ADMINISTRATIVE BOUNDARY - In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server. | 06-04-2009 |
20100202448 | ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS - A node in an overlay network requests a ranked list of other nodes in the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network. | 08-12-2010 |
20100309789 | ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS - A node in an overlay network requests a ranked list of other nodes in multiple areas of the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network. | 12-09-2010 |
20120102223 | REDIRECTION OF REQUESTS FOR TARGET ADDRESSES - In one embodiment, a first network device may receive a request for an identifier of at least one target to service a client. The first network device may obtain an identifier of each of two or more targets. The first network device may then determine whether to redirect the request. The first network device may redirect the request to a second network device according to a result of the determining step, where the first network device is in a first autonomous system and the second network device is in a second autonomous system. | 04-26-2012 |
20120188909 | ACKNOWLEDGEMENT-BASED REROUTING OF MULTICAST TRAFFIC - Various techniques for exchanging control messages in order to gracefully reroute multicast traffic are disclosed. For example, one method involves sending a join message for a multicast group towards a root of a new multicast tree and forwarding multicast traffic, addressed to the multicast group, on a current multicast tree until an acknowledgment corresponding to the join message is received. The new multicast tree can be identified in response to detection of a topology change within the network. Until the acknowledgment is received, multicast traffic that is received via the new multicast tree can be dropped. | 07-26-2012 |
20120233473 | Power Management in Networks - In one implementation, the power consumption by network devices may be managed by accessing a routing protocol that manages an allocation of processing resources in a network. The routing protocol may be used for generating a first configuration, for which a utilization of resources may be determined. A first cost for the first configuration may be determined. A second configuration may be identified to support the utilization of the resources. A second cost may be determined for the second configuration. The first cost may be compared to the second cost. The prospective performance of the network for the second configuration may be assessed. Based on the results of the comparison and the assessment, the network may be configured to use the second configuration. Processing resources may be activated on inactive network devices to support the second configuration and deactivated on active network devices that are not utilized in the second configuration. | 09-13-2012 |
20130013809 | MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS - In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network. | 01-10-2013 |
20130336103 | INTER-DOMAIN SIGNALING TO UPDATE REMOTE PATH COMPUTATION ELEMENTS AFTER A CALL SET-UP FAILURE - In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE. | 12-19-2013 |
20130336107 | DYNAMICALLY TRIGGERED TRAFFIC ENGINEERING ROUTING ADVERTISEMENTS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS - In one embodiment, a device (e.g., a path computation element, PCE) monitors a tunnel set-up failure rate within a computer network, and determines whether to adjust an accuracy of routing information based on the tunnel set-up failure rate. For instance, the tunnel set-up failure rate being above a first threshold indicates a need for greater accuracy. In response to the tunnel set-up failure rate being above the first threshold, the device may then instruct one or more routers to shorten their routing update interval in the computer network. | 12-19-2013 |
20130336108 | GLOBAL STATE RESYNCHRONIZATION FOR PATH COMPUTATION ELEMENT FAILURE DURING A REOPTIMIZATION PROCESS - In one embodiment, a router initiates reroutes of one or more tunnels at the router as part of optimization of a plurality of tunnels in a computer network, and stores an original state of the one or more tunnels at the router prior to the optimization. By detecting whether path computation element (PCE) failure occurs prior to completion of the optimization, the router may revert to the original state of the one or more tunnels in response to PCE failure prior to completion of the optimization. | 12-19-2013 |
20130336109 | ORDERED FLOODING REQUESTS FOR PATH COMPUTATION ELEMENTS - In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update. | 12-19-2013 |
20130336116 | CONGESTION-BASED NOTIFICATION DURING FAST REROUTE OPERATIONS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS - In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated. | 12-19-2013 |
20130336126 | TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT - In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time. | 12-19-2013 |
20130336159 | DISTRIBUTED STATEFUL PATH COMPUTATION ELEMENT OVERLAY ARCHITECTURE - In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device. | 12-19-2013 |
20140010232 | Intra-Domain and Inter-Domain Bridging Over MPLS Using MAC Distribution Via Border Gateway Protocol - In one embodiment, a method includes receiving, by a first autonomous system border router (ASBR) of a first autonomous system (AS), a first plurality of provider-provisioned media access control (B-MAC) addresses via Interior Border Gateway Protocol (I-BGP). Each of first plurality of B-MAC addresses is associated with a provider edge (PE) device of the first AS. The first ASBR sends the first plurality of B-MAC addresses to a second ASBR of a second AS using Exterior Border Gateway Protocol (E-BGP). The first ASBR also receives via E-BGP a second plurality of B-MAC addresses each of which is associated with a PE device of the second AS. The first ASBR then distributes the second plurality of B-MAC addresses to each of the PE devices of the first AS using I-BGP. | 01-09-2014 |
20140304427 | MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS - In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network. | 10-09-2014 |