Abstract: The disclosed embodiments provide a system for propagating network configuration policies using a publish-subscribe messaging system. During operation, the system receives, through the publish-subscribe messaging system, one or more messages containing a first representation of a configuration policy from a policy server. Next, the system uses a data model to convert the first representation into a second representation of the configuration policy. The system then uses the second representation to apply the configuration policy during processing of network traffic.

Abstract: The disclosed embodiments provide a system that automatically detects a role of a node in a network with a layered topology. During operation, the system uses a local shortest path tree (SPT) for a node in a network with a layered topology to identify one or more additional nodes in the network that are farthest from the node. Next, the system compares the local SPT with a remote SPT for the one or more additional nodes to identify a position of the node in the layered topology. The system then outputs the position of the node for use in configuring the operation of the node in the network.

Abstract: The disclosed embodiments provide a system for discovering address mobility events. Upon detecting a loss of data over a connection with a service at an Internet Protocol (IP) address, the system invalidates a domain name system (DNS) cache on the computer system without waiting for the connection to fail. Next, the system obtains, in response to the invalidated DNS cache, an updated DNS record for the service. The system then uses a new IP address in the updated DNS record to establish a new connection with the service.

Abstract: The disclosed embodiments provide a system that performs domain name resolution. During operation, the system uses one or more attributes of a Domain Name System (DNS) query to identify a membership of the DNS query in a grouping of related DNS queries. Next, the system obtains a set of DNS records for resolving the related DNS queries. The system then expedites resolution of subsequent DNS queries in the grouping by transmitting the set of DNS records in a response to the DNS query.

Abstract: The disclosed embodiments provide a system for propagating network configuration policies using a publish-subscribe messaging system. During operation, the system receives, through the publish-subscribe messaging system, one or more messages containing a first representation of a configuration policy from a policy server. Next, the system uses a data model to convert the first representation into a second representation of the configuration policy. The system then uses the second representation to apply the configuration policy during processing of network traffic.

Abstract: The disclosed embodiments provide a system for performing network routing using a publish-subscribe messaging system. During operation, a node in the system detects a first change in reachability within the network. Next, the node generates a first message comprising the first change for receipt by other nodes in the network through a publish-subscribe messaging system. The node then transmits the first message to the publish-subscribe messaging system. Another node receives the first message, updates a routing database at the other node to reflect the first change, and uses the updated routing database to process network traffic.

Abstract: The disclosed embodiments provide a system for performing sub-second network telemetry using a publish-subscribe messaging system. During operation, the system obtains, through the publish-subscribe messaging system, a stream of messages from a set of nodes connected by a set of links in a network. Next, the system analyzes network telemetry data associated with the nodes from the stream of messages. The system then outputs a telemetry result for the network based on the analyzed network telemetry data.

Abstract: The disclosed embodiments provide a system that automatically detects a role of a node in a network with a layered topology. During operation, the system uses a local shortest path tree (SPT) for a node in a network with a layered topology to identify one or more additional nodes in the network that are farthest from the node. Next, the system compares the local SPT with a remote SPT for the one or more additional nodes to identify a position of the node in the layered topology. The system then outputs the position of the node for use in configuring the operation of the node in the network.

Abstract: The disclosed embodiments provide a system for transmitting a link state message in a network. During operation, the system obtains a network topology for the network. Next, the system uses the network topology to identify a reflood set of neighbors of the flooding node for reaching a set of two-hop neighbors of the flooding node. The system then transmits a link state message with an indication to reflood the link state message to the reflood set of neighbors. Finally, the system transmits the link state message without the indication to reflood to remaining neighbors of the flooding node that form a non-reflood set.

Abstract: The disclosed embodiments provide a system that automatically detects a potential microloop condition associated with network convergence. During operation, the system obtains a topology for a network containing a set of nodes connected by a set of links. Next, the system uses the topology to detect a ring containing at least four hops in the network. The system then outputs an indication of a potential microloop condition associated with one or more nodes on the ring to improve improve routing of network traffic by the one or more nodes.

Abstract: The disclosed embodiments provide a system that performs load-based compression of a forwarding table for a node in a network. During operation, the system obtains link utilizations for a set of physical links connected to the node. Next, the system uses the link utilizations to update a set of entries in a forwarding table of the node for use in balancing load across the set of physical links. The system then uses the set of entries to process network traffic at the node.

Abstract: The disclosed embodiments provide a system for transmitting a link state message in a network. During operation, the system obtains a network topology for the network. Next, the system uses the network topology to identify a reflood set of neighbors of the flooding node for reaching a set of two-hop neighbors of the flooding node. The system then transmits a link state message with an indication to reflood the link state message to the reflood set of neighbors. Finally, the system transmits the link state message without the indication to reflood to remaining neighbors of the flooding node that form a non-reflood set.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: In an embodiment, a method is provided at which it is used in a device. In this method, a logical identifier assigned to the device is identified and additionally, a mesh group identifier identifying a mesh group is identified. The logical identifier and the mesh group identifier are encoded in a routing message, which is used in an inter-domain routing protocol, and this routing message is transmitted to a reflector device in communication with the device. The reflector device is configured to transmit the routing message to a remote device included in the computer network.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.