Patent application number | Description | Published |
20090041037 | Border Router with Selective Filtering of Link State Advertisements - An example embodiment of the present invention provides a process relating to the selective filtering of an LSA at a not-so-stubby-sub-area (NSSSA) border router. In one embodiment, the border router receives an LSA from another router inside the NSSSA, which might be in the access layer of the hierarchical network design model and which might use OSPF as its IGP. If the LSA is Type 1 and includes a subnet route or forwarder address, the border router floods it to its neighboring routers, regardless of whether they are inside the NSSSA. If the LSA is Type 7 and includes a host address, the border router floods it to a neighboring router if the neighboring router is inside the NSSSA, but filters the LSA if the neighboring router is outside the NSSSA, for example, in an OSPF area in the distribution layer of the hierarchical network design model. | 02-12-2009 |
20090129387 | EXTENDING AN IP EVERYWHERE NETWORK OVER A PLURALITY OF FLOODING DOMAINS - In one embodiment, a border node receives a message that includes routing information indicating connection of a network device to a domain. The border node then updates a routing database with the routing information, and also uses a network address for the network device to determine whether to propagate the routing information. | 05-21-2009 |
20090196181 | TECHNIQUE TO AUTOMATICALLY DEAGGREGATE AN OPTIMUM SET TO PREVENT SUBOPTIMAL ROUTING OR ROUTING FAILURES WITHIN A LINK STATE FLOODING DOMAIN - In one embodiment, information is signaled between aggregating routers indicating the components of aggregated addresses. This information is used to dynamically leak, or deaggregate, specific parts of the aggregated address space to reduce sub-optimal routing and possibly prevent routing black holes from occurring in a network. | 08-06-2009 |
20090238076 | METHOD AND APPARATUS TO ENABLE AN IPe DOMAIN THROUGH EIGRP - In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list. | 09-24-2009 |
20100061246 | TRANSIT PREVENTION IN HUB-AND-SPOKE TOPOLOGIES USING LINK STATE PROTOCOLS - In one embodiment, a method and apparatus of controlling transmission of data packets in a communications network includes designating all networking devices in a portion of the communications network as either hubs or spokes, communicating a link-state advertisement to each connected hub and spoke in the portion of the communications network, computing a shortest path tree at all the hubs and the spokes based on the link-state advertisement, the computing including truncating the shortest path tree at the hubs only for links leading from the spoke to the hub, creating a routing table at each of the hub and the spoke based on the truncated shortest path tree, and transmitting the data packets in the communications network based on the link-state advertisement. The shortest path tree includes all data transmission routes in the tree except links leading from a spoke to a hub. | 03-11-2010 |
20110222550 | APPARATUS AND METHOD TO HIDE TRANSIT ONLY MULTI-ACCESS NETWORKS IN OSPF - In one embodiment, a Link State Advertisement (LSA) is received from a first router in a network at a second router in the network. The LSA advertises an address of an interface of the first router. The second router determines whether the LSA includes a transit-only identification that indicates the interface of the first router is a transit-only interface. If the LSA does not include a transit-only identification, the second router installs the advertised address of the interface of the first router in a Router Information Base (RIB) of the second router. If the LSA does include a transit-only identification, the second router declines to install the advertised address of the interface of the first router in the RIB of the second router. | 09-15-2011 |
20120327933 | Adjacency Discovery Through Multicast and Single-Hop Messaging - A first node of a network may send a multicast discovery message comprising a domain identifier of the first node. The first node may also send a single-hop discovery message to one or more single-hop neighbors of the first node. The single-hop discovery message may comprise the domain identifier of the first node. A plurality of neighbor discovery messages may be received. At least one node of the network may be identified through the neighbor discovery messages. A level of trust may be determined for each identified node of the network based on at least one of the neighbor discovery messages. | 12-27-2012 |
20120331555 | Performing A Defensive Procedure In Response To Certain Path Advertisements - In certain embodiments, performing a defensive procedure involves receiving at a first speaker of a first autonomous system a path advertisement from a second speaker of a second autonomous system. The path advertisement advertises a path from the second speaker of the second autonomous system. It is determined whether the second autonomous system is a stub autonomous system and whether a path length of the path is greater than one. If the second autonomous system is a stub and the path length is greater than one, a defensive measure is performed for the path. Otherwise, a default procedure is performed for the path. | 12-27-2012 |
20130286831 | BGP INTERCEPTS - Network devices, systems, and methods, including executable instructions and/or logic thereon, are provided to perform BGP intercepts. A network device includes a processing resource coupled to a memory. The memory includes program instructions executed by the processing resource to intercept BGP updates and process associated cryptographic signatures before receipt by a BGP router. | 10-31-2013 |
20140003289 | APPARATUS AND METHOD TO HIDE TRANSIT ONLY MULTI-ACCESS NETWORKS IN OSPF | 01-02-2014 |
20140211662 | Network Topologies for Energy Efficient Networks - One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set. | 07-31-2014 |