Deepak Merugu

20120226532, Sep 6, 2012

Mar 1, 2012

13/410155

Balaji S. Prabhakar - Palo Alto CA, US
Deepak Merugu - Stanford CA, US
Naini R. Gomes - Stanford CA, US

G06Q 30/02
G06F 15/16

705 1414

Congestion of a network being accessed by users is mitigated by providing predetermined incentive credits to users who follow network use recommendations and allowing the users to redeem accumulated credits for entry in a game of chance that provides a chance of winning a large reward. A server collects network use data to determine network congestion states and to determine whether users followed network use recommendations. The server also implements a web portal through which users can view historical network use and awarded credits, and redeem their credits. Application domains of the method to mitigate congestion include public transportation networks, wireless communication networks, and energy distribution networks. The techniques may also be enhanced by integration with online social networking features.

20120284096, Nov 8, 2012

May 4, 2012

13/464860

Naini Rose Gomes - Palo Alto CA, US
Deepak Merugu - Stanford CA, US
Shivakumar Narayanan - Los Altos CA, US
Balaji S. Prabhakar - Palo Alto CA, US
Damon J. Wischik - Palo Alto CA, US

G06Q 30/02

705 1414

Conservation of a utility resource is incentivized by a method in which a utility customer records utility meter readings with a smart phone and submits the readings to a server for processing. The server processes the meter readings and awards the customer with credit awards contingent upon customer compliance with behavior that is being incentivized by the system, e.g., reduced resource use during peak hours, resource use below a target level set by the server, resource use below a goal set by the customer, frequent and accurate resource meter submissions, or verification of resource submissions of other customers. Cumulative awarded credits may be redeemed by a customer in exchange for participation in a micro-raffle or other game of chance. Preferably, a consumer awarded more credits has a greater chance of winning a prize, and a greater chance of winning a larger prize, than a user awarded fewer credits.

20100198671, Aug 5, 2010

Feb 2, 2010

12/698988

Balaji Prabhakar - Palo Alto CA, US
Deepak Merugu - Palo Alto CA, US
Neha Kumar - Berkeley CA, US

The Board of Trustees of the Leland Stanford Junior University - Palo Alto CA

G06Q 50/00
G06Q 30/00
G06Q 10/00

705 1416, 705 1425, 705308

Systems and methods are provided for incentivizing and rewarding consistent and repeated recycling of recyclable materials.

20210160046, May 27, 2021

Jan 6, 2021

17/142824

- Palo Alto CA, US
Deepak Merugu - Sunnyvale CA, US
Balaji S. Prabhakar - Palo Alto CA, US

H04L 7/033
G06N 20/10
H03L 7/087

Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.

20210091919, Mar 25, 2021

Sep 24, 2019

16/581171

- Palo Alto CA, US
Deepak Merugu - Sunnyvale CA, US
Balaji S. Prabhakar - Palo Alto CA, US

H04L 7/00
H04L 12/66
H04L 12/26

Systems and methods are disclosed herein for performing a time-ordered operation on messages transmitted from multiple sources to a region of networked machines. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, where each gateway is a machine on a perimeter of the region of networked machines and is connected to receive messages from multiple sources. The system receives messages that enter the region through one of the gateways, where the gateway timestamps the message. The system then performs the time-ordered operation on the received messages in an order based on an absolute time of entry into the region, where the absolute time of entry is relative to the reference clock and is determined based on the timestamp from the gateway.

20210091920, Mar 25, 2021

Sep 24, 2019

16/581196

- Palo Alto CA, US
Deepak Merugu - Sunnyvale CA, US
Balaji S. Prabhakar - Palo Alto CA, US

H04L 7/00
H04L 12/66
H04L 12/26

Systems and methods are disclosed herein for performing a time-triggered distribution of messages from a region of networked machines to multiple destinations. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, wherein each gateway is a machine on a perimeter of the region of networked machines and is connected to transmit messages to multiple destinations. The gateways receive messages from within the region of networked machines for distribution to multiple destinations outside the region of networked machines according to a distribution schedule based on absolute time relative to the reference clock. The gateways perform the distribution of received messages, wherein each gateway determines absolute time based on that gateway's synchronization with the reference clock.

20200396051, Dec 17, 2020

Mar 11, 2020

16/815486

- Palo Alto CA, US
Deepak Merugu - Sunnyvale CA, US
Balaji S. Prabhakar - Palo Alto CA, US

H04L 7/033
H03L 7/087
G06N 20/10

Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.

20180202827, Jul 19, 2018

Mar 12, 2018

15/918889

- Mountain View CA, US
Damon Jude Wischik - Palo Alto CA, US
Christopher David Pluntke - Palo Alto CA, US
Balaji Satyanarayana Prabhakar - Palo Alto CA, US
Deepak Merugu - Sunnyvale CA, US

G01C 21/34

A system for reconstructing vehicle itinerary include a processor and a memory storing instructions, implemented by the processor, to cluster historical trip records into a plurality of clusters, each of the plurality of clusters including a set of historical trip records that describe events occurring within a predetermined time range at one location; identify a sequence of clusters that includes a cluster at each location; and estimate an itinerary for a vehicle based on the sequence of clusters and constraint data describing physical constraints, the itinerary for the vehicle describing a sequence of arrival and departure times at a sequence of locations for the vehicle.