Patent application number | Description | Published |
20080247392 | Validating Internal Routing Protocol Information Passed Through an External Routing Protocol - In one embodiment, a method includes receiving authenticated site data that includes site ID data and address data. The site ID data indicates a unique site ID for each site among multiple sites for a first network that uses an internal routing protocol. Multiple edge sites of those sites are separate from each other and connected to a second network that is under separate administrative control of at least one different party. The address data indicates network addresses associated with each site of the plurality of sites. An external routing protocol message is discounted based on the authenticated site data. | 10-09-2008 |
20080310433 | Fast Re-routing in Distance Vector Routing Protocol Networks - In one embodiment, a method includes sending an adjacency discovery message | 12-18-2008 |
20090059925 | Evaluation of Network Data Aggregation - In one embodiment, a method includes receiving topology data that indicates multiple communication links and multiple intermediate network nodes in communication based on the communication links. The intermediate network nodes include multiple leaf nodes that terminate communications and multiple transit nodes that facilitate the passage of information between leaf nodes. Aggregation point data is also received, which indicates all aggregation points on the intermediate network nodes. An aggregation point is an interface between a network node and a communication link, through which is output data that is a combination of data received through multiple different interfaces upstream of the interface. A set of paths is determined for which each path in the set connects a different pair of leaf nodes. A measure of aggregation is determined based on a number of aggregated paths of the set of paths. An aggregated path passes through an aggregation point. | 03-05-2009 |
20100008231 | Method and Apparatus for Automatic Sub-Division of Areas that Flood Routing Information - Techniques for sharing routing information over a network include determining whether the scale of a flooding domain exceeds a threshold. If so, then a router announcement message is sent over a particular link. The message indicates the local router is a flooding domain border router (FDBR). Summary routing information is determined with less than a certain level of detail used in the flooding domain for routers connected to the local router through links different from the particular link. The summary routing information is sent over the particular link in a link state message that includes type data that indicates summary routing information that crosses a FDBR. These techniques allow automatic favorable scaling of domains of shared routing information as the size of a mobile ad hoc network grows. | 01-14-2010 |
20100091823 | Two-hop Relay for Reducing Distance Vector Routing Information - In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol. | 04-15-2010 |
20100172237 | Building backup tunnels for fast reroute in communications networks - In one embodiment, a method includes identifying at a node, a destination for which a primary path is defined between the node and the destination, transmitting a request message to a neighbor node for routing information for a backup path between the node and the destination, receiving a reply message containing an address identifying the backup path, and building a backup tunnel to the address. The request message includes at least one node identified as a node to be avoided in the backup path and a request cost. An apparatus for building backup tunnels is also disclosed. | 07-08-2010 |
20100329463 | GROUP KEY MANAGEMENT FOR MOBILE AD-HOC NETWORKS - Group key management in a mobile ad-hoc network (MANET) may be provided. Each network node associated with the MANET may comprise a group distribution key and a list of authorized member nodes from which a group key manager may be elected. The group key manager may periodically issue a new group key to be used in protecting communications among the network nodes. A compromised node may be excluded from receiving updated group keys and thus isolated from the MANET. | 12-30-2010 |
20120195205 | 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. | 08-02-2012 |
20120198092 | Network Topologies for Energy Efficient Networks - One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node. | 08-02-2012 |
20130046864 | Deriving Unique Local Addresses From Device Names - In one embodiment, accessing a device name, which includes a hostname and a domain name, of a network device; applying a hash function to the domain name to obtain 40 bits as a Global ID of an Internet Protocol version 6 (IPv6) unique local address (ULA); and encoding the hostname to obtain 80 bits as a Subnet ID and an Interface ID of the IPv6 ULA. | 02-21-2013 |
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 |
Patent application number | Description | Published |
20080212494 | Ad hoc network formation and mangement based on aggregation of ad hoc nodes according to an aggregation hierarchy - Each mobile ad hoc node has an assigned hierarchy position within an identified tree-based aggregation group. Each ad hoc node is configured for selectively attaching to one of a plurality of available ad hoc nodes based on identifying a best match, for the assigned hierarchy position within the identified aggregation group, from among identifiable hierarchy positions of identifiable aggregation groups. Each ad hoc node also is configured for selectively attaching to any available ad hoc node based on a determined absence of any available ad hoc node advertising the identified aggregation group of the ad hoc node, or an aggregation group containing the identified aggregation group. Hence, a root node of an aggregation group can filter group-specific routing information from packets destined toward a network clusterhead, resulting in a scalable routing protocol that is not adversely affected by added nodes. | 09-04-2008 |
20090141651 | DETERMINING AN OPTIMAL ROUTE ADVERTISEMENT IN A REACTIVE ROUTING ENVIRONMENT - In an example embodiment, a method is provided. In this method, a network address query is received. A first network address of a known apparatus is retrieved from a routing table, in response to the network address query. A second network address may be determined based upon the network address query, the second network address having a smaller bit length than the first network address. An aggregate value may be advertised that represents a range of reachable network addresses, the range of reachable network addresses including the second network address. | 06-04-2009 |
20090157901 | SYSTEM AND METHOD FOR USING ROUTING PROTOCOL EXTENSIONS FOR IMPROVING SPOKE TO SPOKE COMMUNICATION IN A COMPUTER NETWORK - Systems and methods for using routing protocol extensions to improve spoke to spoke communication in a computer network are disclosed. Embodiments provide systems and methods to establish a tunnel between a first spoke and a hub, exchange routing information between the first spoke and the hub using a routing protocol, extend the routing protocol and an associated database to include next hop mapping information, and establish a tunnel between the first spoke and a second spoke according to information in the database. | 06-18-2009 |
20110019671 | Partitioned Forwarding of Packets Originated on a Broadcast Link Among Layer 2 Forwarding Devices of Different Adjacency Networks - The designated forwarding device functionality for forwarding of packets originated on a broadcast link among layer 2 is shared among multiple forwarding devices of different adjacency networks. As these networks do not form adjacencies, the forwarding devices do not natively participate in a same spanning tree for determining how to forward packets, and a designated forwarding device is used for forwarding packets originated on the common broadcast link. Distributing the role of a designated forwarding device among multiple of the forwarding devices provides a means for more efficiently forwarding packets to their destinations. | 01-27-2011 |
20120106395 | DETERMINING A ROUTE ADVERTISEMENT IN A REACTIVE ROUTING ENVIRONMENT - In an example embodiment, a method and system is provided to determine and advertise a route advertisement in a reactive routing environment. In response to receiving a network address query with respect to a destination address at a routing device, an aggregate value, e,g, an address prefix, is determined and advertised in reply to the network address query. Determining of the aggregate value may comprise identifying within a range of network addresses represented by the aggregate value respective addresses for which the routing device does not have reachability information. The routing device may send address queries with respect to the identified addresses, to determine reachability via the routing device of those addresses. The aggregate value may be advertised conditional upon determining that a percentage of addresses within the corresponding range that can be reached via the routing device satisfies a predefined minimal coverage value. | 05-03-2012 |
20140269734 | DETERMINING A ROUTE ADVERTISEMENT IN A REACTIVE ROUTING ENVIRONMENT - In an example embodiment, a method and system is provided to determine and advertise a route advertisement in a reactive routing environment. In response to receiving a network address query with respect to a destination address at a routing device, an aggregate value, e.g. an address prefix, is determined and advertised in reply to the network address query. Determining of the aggregate value may comprise identifying within a range of network addresses represented by the aggregate value respective addresses for which the routing device does not have reachability information. The routing device may send address queries with respect to the identified addresses, to determine reachability via the routing device of those addresses. The aggregate value may be advertised conditional upon determining that a percentage of addresses within the corresponding range that can be reached via the routing device satisfies a predefined minimal coverage value. | 09-18-2014 |