Google Inc.

Juniper Networks, Inc.

Interdigital Patent Holdings, Inc.

Drnc Holdings, Inc.

Ashish Gupta

Haifeng Jiang

Manpreet Singh

Rajagopal Ananthanarayanan

Monica D Chawathe

Venkatesh Basker

Tianhao Qiu

Sumit Das

Rocco Di Girolamo

Guang Lu

Jean-Louis Gauvreau

Paul L Russell, Jr

Nicholas J Podias

Namit Sikka

Debjani Majumder

Ana Lucia A Pinheiro

Kaliraj Vairavakkalai

Robert C Keller

Sandesh Kumar Sodhi

Fenglin Liao

Shan He

Yuri Vasilevski

Vinayak Ganeshan

Navin Reginald Melville

A network node is configured to initiate a first authentication and key establishment procedure with a machine to machine (M2M) device. The network node is configured to determine a key agreement between the network node and the M2M device using the first authentication and key establishment procedure. The network node is configured to initiate a second authentication and key establishment procedure with an M2M server. The network node is configured to receive a request from the M2M server for the key agreement to be used to communicate with the M2M device using the second authentication and key establishment procedure. The network node is configured to send the key agreement to the M2M server using the second authentication and key establishment procedure.

Interface of an M2M server with the 3GPP core network

The disclosed computer-implemented method for classifying uplink and downlink traffic in networks may include (1) maintaining a routing table that includes a plurality of routes that define paths to a plurality of network destinations in connection with a network, (2) receiving a packet to be routed toward a network destination based at least in part on a route that defines a path to the network destination in connection with the MPLS network, (3) identifying, within the routing table, the route that defines the path to the network destination, (4) determining, based at least in part on the route identified within the routing table, whether the packet represents uplink or downlink traffic, and then (5) classifying the packet as uplink or downlink traffic based at least in part on the determination. Various other methods, systems, and apparatuses are also disclosed.

Method, system, and apparatus for classifying uplink and downlink traffic in networks

Systems and methods are disclosed herein for providing fault tolerant processing of events. The system includes multiple consensus computers configured to communicate with one another and multiple event processors configured to process data such as events. Each consensus computer is further configured to receive a request to process a unit of data from an event processor. A consensus computer communicates with at least one other consensus computer to reach consensus as to whether the unit of data has previously been assigned to an event processor for processing. Then, a consensus computer sends a message to the event processor that sent the inquiry including instructions to either process the unit of data or not process the unit of data. Because the consensus computers determine whether a unit of data has previously been assigned to an event processor, the system ensures that an event is not processed more than once.

Disaster-proof event data processing

An M2M Server may be integrated into a 3GPP network. A network node, for example a Serving General Packet Radio Service (GPRS) Support Node (SGSN) may include a dedicated interface with a M2M server. The interface may be called a GM2M interface. The interface may be a logical interface internal to the network node. The node may receive subscriber data and control data, wherein the control data facilitates a network control procedure and the subscriber data identifies a device involved in the network control procedure. The node may determine that the device involved in the network control procedure is a machine to machine device based on the subscriber data. The node may also send the control data to a machine to machine server using a message sent via a dedicated interface with the machine to machine server.

A method for handling data includes receiving a data record. The method further includes adding the count value of the data record to a count value of the top row of a stack when the data record field values are included among the field values of the top row. The method also includes rolling up the top row when less than all of the data record field values are included among the top row field values and the count value of the top row is less than a threshold value. The method further includes outputting the top row and inserting the data record onto the stack as the new top row. The method may also include removing the top row and adding its count value to the count value of a new top row. A system for handling data includes a streaming data handler and a sorter.

Streaming roll-ups on statistical data using a stack

Aspects of the disclosure relate generally to reducing latency for consensus in geographically distributed disaster-safe persistent data-store systems. These distributed systems may include registry system having redundant storage for maintaining the system status. Each registry system may include a server and a storage component. Consensus may be achieved by querying all of other servers of the registry system. In one example, the consensus data may be sharded into independent small groups. This may allow for multiple consensus transactions to be generated and run in parallel, which, in turn may reduce the latency. In addition, or alternatively, requests to a server to write or otherwise change the data-store may be batched at the server side. Thus, for the consensus, the server need only communicate with the other servers only once per batch. This may also reduce the latency of the distributed system.

Latency reduction in distributed computing systems

Aspects of the disclosure relate generally to a distributed event joining system for joining primary and secondary events based on a common key. In one example, a continuous stream of primary events may be submitted by a plurality of ad serving computers for storage at a cache layer. Each primary event may be associated with a primary event key. After a time T, the stream of primary events may be sent to long term memory. The system may also receive secondary events, each associated with a primary key. The primary key may be used to identify a primary event in the cache layer. If the primary event is not available in the cache layer, the long term memory may be searched for the primary key. Paired events may then be submitted to a distributed joined event storage system.

Multi-level caching event lookup

Aspects of the disclosure relate generally to a distributed event joining system for joining primary and secondary events based on a common key. In one example, a continuous stream of primary events may be stored at a cache layer. Each primary event may be associated with a primary event key which may be used to generate an index map for the cache layer. After a time T, the stream of primary events may be sent to long term memory. The system may also receive secondary events, each associated with a primary key. The primary key may be used to identify a primary event in the cache layer. If the primary event is not available in the cache layer, the long term memory may be searched for the primary key. Paired events may then be submitted to a distributed joined event storage system.

Real-time log joining on a continuous stream of events that are approximately ordered

A device may store information associated with a group of items in a database. The information associated with a particular item may include a group of versions of a particular attribute. A particular version of the particular attribute may include a value associated with the particular attribute and a timestamp. The device may receive a query that specifies a time; determine that the query is associated with the particular item; and determine, based on the specified time, which version of the particular attribute is associated with the query. The device may determine which version of the particular attribute is associated with the query by identifying, based on the timestamps associated with the versions of the particular attribute, a version of the particular attribute that is a newest version, of the versions of the particular attribute that are associated with timestamps that are before or concurrent with the specified time.

Versioned database cache

A log file processing system includes a data storage device and a processing circuit configured to retrieve log file data from the data storage device and to create a bundle including a plurality of data chunks using the log file data. The processing circuit is configured to assign the bundle to a first processing pipeline of a set of multiple processing pipelines in response to a request from the first processing pipeline. The processing circuit is configured to store a global available timestamp for the bundle upon assigning the bundle to the first processing pipeline. The global timestamp is a time threshold before which the bundle is ineligible to be assigned to any of the multiple processing pipelines.

Growing community of inventors

Sunnyvale, CA, United States of America

Ashish Gupta