Abstract: Techniques described herein relate to a method for topology partition detection. Network devices within a network topology often share information to achieve desired network functionality. However, when a network topology becomes partitioned such that not all network devices are directly or indirectly connected to the other network devices, the information sharing may fail. Techniques described herein detect such network topology partitioning by analyzing information that represents the network topology, and the connections therein (e.g., a set of paths).

Abstract: Techniques described herein relate to a method for computation of network flooding topologies. A flooding topology may refer to a subset of a network which can be utilized by a network device to limit the flooding of link state updates. The flooding topology may be determined by an area leader (i.e., a designated network device) of the network. Computation of the flooding topology may entail the iterative incorporation (or absorption) of nodes and edges of a first connected graph, representing network devices and interconnections of a network topology of the network, into a second connected graph representing the flooding topology.

Abstract: Techniques described herein relate to a method for topology partition detection. Network devices within a network topology often share information to achieve desired network functionality. However, when a network topology becomes partitioned such that not all network devices are directly or indirectly connected to the other network devices, the information sharing may fail. Techniques described herein detect such network topology partitioning by analyzing information that represents the network topology, and the connections therein (e.g., a set of paths).

Abstract: Techniques described herein relate to a method for topology partition detection. Network devices within a network topology often share information to achieve desired network functionality. However, when a network topology becomes partitioned such that not all network devices are directly or indirectly connected to the other network devices, the information sharing may fail. Techniques described herein detect such network topology partitioning by analyzing information that represents the network topology, and the connections therein (e.g., a set of paths).

Abstract: A method and network device for embedded area abstraction. Specifically, the method and network device described herein implement the abstraction of one or more subareas of an area within a network implementing a link state protocol. Abstraction of a given subarea of a given area within a network may provide for routing using network devices in the given subarea without requiring that the network devices, in the complement of the given subarea within the given area, maintain link state information respective to the entire network topology of the given subarea.

Abstract: One or more embodiments of the invention may relate to a method, and/or non-transitory computer readable medium including instructions, for distributing link state information. In one or more embodiments of the invention, the method includes building a link state database on a plurality of network devices; electing a leader from among the plurality of network devices; computing, by the leader, a flooding topology; encoding, by the leader, the flooding topology to obtain an encoded flooding topology; distributing, by the leader, the encoded flooding topology to other network devices of the plurality of network devices.

Abstract: Techniques described herein relate to a method for topology partition detection. Network devices within a network topology often share information to achieve desired network functionality. However, when a network topology becomes partitioned such that not all network devices are directly or indirectly connected to the other network devices, the information sharing may fail. Techniques described herein detect such network topology partitioning by analyzing information that represents the network topology, and the connections therein (e.g., a set of paths).

Abstract: Embodiments of the invention may relate to a method for routing protocol area abstraction. The method may include electing an area leader from among network devices; generating, by the area leader, an area representation node identifier associated with the first area; distributing, by the area leader, the area representation node identifier to area edge devices; receiving, from the area edge devices, second area link state packets (LSPs); generating, by the area leader and using the second area LSPs, an area representation node LSP that includes the area representation node identifier and area neighbor adjacencies; and distributing, by the area leader, the area representation node LSP to a plurality of network devices in a second area of the network. In response to receiving a copy of the area representation node LSP, each of the network devices in the second area may advertise an adjacency to an area representation node.

Abstract: A method and network device for embedded area abstraction. Specifically, the method and network device described herein implement the abstraction of one or more subareas of an area within a network implementing a link state protocol. Abstraction of a given subarea of a given area within a network may provide for routing using network devices in the given subarea without requiring that the network devices, in the complement of the given subarea within the given area, maintain link state information respective to the entire network topology of the given subarea.

Abstract: Techniques described herein relate to a method for computation of network flooding topologies. A flooding topology may refer to a subset of a network which can be utilized by a network device to limit the flooding of link state updates. The flooding topology may be determined by an area leader (i.e., a designated network device) of the network. Computation of the flooding topology may entail the iterative incorporation (or absorption) of nodes and edges of a first connected graph, representing network devices and interconnections of a network topology of the network, into a second connected graph representing the flooding topology.

Abstract: Embodiments of the invention may relate to a method for routing protocol area abstraction. The method may include electing an area leader from among network devices; generating, by the area leader, an area representation node identifier associated with the first area; distributing, by the area leader, the area representation node identifier to area edge devices; receiving, from the area edge devices, second area link state packets (LSPs); generating, by the area leader and using the second area LSPs, an area representation node LSP that includes the area representation node identifier and area neighbor adjacencies; and distributing, by the area leader, the area representation node LSP to a plurality of network devices in a second area of the network. In response to receiving a copy of the area representation node LSP, each of the network devices in the second area may advertise an adjacency to an area representation node.

Abstract: One or more embodiments of the invention may relate to a method, and/or non-transitory computer readable medium including instructions, for distributing link state information. In one or more embodiments of the invention, the method includes building a link state database on a plurality of network devices; electing a leader from among the plurality of network devices; computing, by the leader, a flooding topology; encoding, by the leader, the flooding topology to obtain an encoded flooding topology; distributing, by the leader, the encoded flooding topology to other network devices of the plurality of network devices.

Abstract: Graceful restart in routers having redundant routing facilities may be accomplished by replicating network (state/topology) information.

Abstract: Graceful restart in routers having redundant routing facilities may be accomplished by replicating network (state/topology) information.

Abstract: A method and an apparatus for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.

Abstract: Graceful restart in routers having redundant routing facilities may be accomplished by replicating network (state/topology) information.

Abstract: In one embodiment, an operating system kernel and/or one or more processes of a high-availability system are modified while the system is operating and providing high-availability service. In accomplishing this, one embodiment uses a second virtual machine to operate a second operating system kernel including a second set of processes in the standby mode, which receive state information from corresponding process(es) in the active mode. Individually, the operating system kernel and processes within the second set of processes may be a same or different version of their counterpart in a first virtual machine and its processes which are being replaced. When the second set of processes have acquired sufficient state information to perform the standby role, the operation of the first virtual machine is typically ceased as the version modified second virtual machine is performing the version modified functionality of the first virtual machine.

Abstract: A method and an apparatus for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.

Abstract: A method and an apparatus for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.

Abstract: A method and an apparatus for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.