Juniper Networks, Inc.

Vijay Paul

David M Katz

Srinath Bayareddy

Aditya Thakur

Samuel Jacob

Subin Cyriac Mathew

Pawankumar Harode

Michael H Nagle

A network device receives first objects defining first network data associated with an asynchronous distributed network and an asynchronous distributed network operating system and generates a natural name graph based on the first objects. The network device provides information describing the natural name graph to other network devices in the asynchronous distributed network and receives a second object defining second network data. The network device determines whether one of the first objects in the natural name graph is a duplicate of the second object and removes the one of the first objects from the natural name graph, to generate an updated natural name graph, when the one of the first objects in the natural name graph is a duplicate of the second object. The network device provides the updated natural name graph to the other network devices to prevent the other network devices from generating erroneous results.

Generating a natural name data structure to prevent duplicate network data associated with an asynchronous distributed network operating system

The disclosed computer-implemented method for facilitating atomic delivery of bundled data sets to applications within distributed systems may include (1) receiving, at a queue of an application, a data set from at least one other application, (2) determining that the data set is incorporated in a bundle whose contents have yet to completely arrive at the queue, (3) gating the data set at the queue until the bundle's contents have completely arrived at the queue, (4) receiving, at the queue, another data set incorporated in the bundle, (5) determining that the bundle's contents have completely arrived at the queue based at least in part on receiving the other data set, and then (6) notifying the application that the bundle is ready for atomic delivery such that the application is able to consume the bundle's contents on an as-needed basis. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for facilitating atomic delivery of bundled data sets to applications within distributed systems

A device identifies, based on a program code instruction, an attempted write access operation to a fenced memory slab, where the fenced memory slab includes an alternating sequence of data buffers and guard buffers. The device assigns read-only protection to the fenced slab and invokes, based on the attempted write access operation, a page fault operation. When a faulting address of the attempted write operation is not an address for one of the multiple data buffers, the device performs a panic routine. When the faulting address of the attempted write operation is an address for one of the multiple data buffers, the device removes the read-only protection for the fenced slab and performs a single step processing routine for the program code instruction.

Detecting memory corruption

A profiler may analyze processes being run by a processor. The profiler may include logic to periodically sample a value of an instruction pointer that indicates an instruction in the first process that is currently being executed by the processor and logic to update profile data based on the sampled value. The profiler may additionally include logic to determine, in response to a context switch that includes the operating system switching the active process from the first process to another of the plurality of processes, whether the first process executes for greater than a first length of time; logic to stop operation of the profiler when the first process executes for greater than the first length of time; and logic to clear the profile data when the first process fails to execute for greater than the first length of time.

Analysis of short term CPU spikes in an operating system kernel

In general techniques are described for allocating global identifiers to forwarding units of a network device. A network device having one or more hardware-based microprocessors and an allocation module executable by the microprocessors may implement the techniques. The allocation module may maintain a first map that indicates global identifiers that are allocable to a plurality of forwarding units of the network device, and a second map that indicates local identifiers that are allocated to one of the plurality of forwarding units. The local identifiers may be based at least in part on the global identifiers. The allocation module may allocate to the forwarding unit, a global identifier indicated by the first map that is not allocated to any one of the plurality of forwarding units by comparing the second map to one or more portions of the first map to identify the unallocated global identifier of the first map.

Allocation of interface identifiers within network device having multiple forwarding components

In general, techniques are described for providing thread-level tracing within an operating system kernel. A computing device comprising processes, an operating system and a control unit that executes the operating system may implement the techniques. Each of the processes comprises an instance of an application program. Each of the processes comprises one or more separate threads of instruction execution. The operating system concurrently executes the processes. The control unit traces execution of a system call issued to the operating system by one of the threads currently being executed by the control unit to generate a trace log that traces execution of the system call by the operating system without tracing execution of any other ones of the one or more threads corresponding to those of the plurality of processes that are also being executed by the operating system during execution of the system call.

Growing community of inventors

Bengaluru, India

Vijay Paul