Search

Sridhar S Machiraju

from Belmont, CA
Age ~46
Get Report
Related to:
Kasinath Balaji Machiraju, 72
Connected to:
Harita Machiraju, 42Nagabhushan Machiraju, 77Diane M Machita, 64Gregory Machkovsky, 50Ryan L Machleit, 41Ken Machlin, 82Andrea Machlis, 34Matthew A Machlis, 57Crystle G Machlitt, 45Jackie S Machmer, 55

Sridhar Machiraju Phones & Addresses

  • 1823 Oak Knoll Dr, Belmont, CA 94002
  • San Mateo, CA
  • Burlingame, CA
  • Oakland, CA
  • Berkeley, CA

Work

Company: Google Jul 2009 Position: Software engineer

Education

Degree: Ph.D. School / High School: University of California, Berkeley 2000 to 2006 Specialities: Computer Science

Skills

Distributed Systems • Software Engineering • C++ • Object Oriented Design • Python • Scalability • Data Mining • Software Development • Software Design • Algorithms • Computer Science • C

Industries

Internet

Resumes

Resumes

Sridhar Machiraju Photo 1

Senior Staff Software Engineer And Manager

View page
Location:
1823 Oak Knoll Dr, Belmont, CA 94002
Industry:
Internet
Work:
Google since Jul 2009
Software Engineer
Sprint Nextel May 2005 - Jul 2009
Research Scientist
Education:
University of California, Berkeley 2000 - 2006
Ph.D., Computer Science Indian Institute of Technology, Madras 1996 - 2000
B.Tech., Computer Science
Skills:
Distributed Systems
Software Engineering
C++
Object Oriented Design
Python
Scalability
Data Mining
Software Development
Software Design
Algorithms
Computer Science
C

Publications

Us Patents

Algorithms For Constructing Sets Of Frequently Occurring Strings

View page
US Patent:
7773634, Aug 10, 2010
Filed:
Dec 6, 2007
Appl. No.:
11/951708
Inventors:
Sridhar Machiraju - Oakland CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04J 3/00
US Classification:
370476, 370477
Abstract:
Media and methods are provided for constructing data structures associating data segments in packets with reference identifiers to optimize bandwidth usage within a network during transmission. In one embodiment, a data structure is initialized to contain no data. A minimum length of a data segment to be examined is determined. For each packet in the transmission, data segments of the packet are examined. Data segments are added to the data structure as necessary. Examination is repeated along with an appropriate addition until the packet contains less data than a segment of the minimum length and further continued until all packets are examined. The data structure is constructed associating the portions of the packet and respective reference identifiers. In certain embodiments, the count can be a total count of frequently occurring segments, the count of unique segments or the count of packets containing unique segments. In other embodiments, the construction is accomplished by a compression library.

In-Network Per Packet Cashes

View page
US Patent:
7787368, Aug 31, 2010
Filed:
Feb 28, 2008
Appl. No.:
12/038842
Inventors:
Sridhar Machiraju - Burlingame CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04L 12/26
US Classification:
370229, 370390
Abstract:
Methods, systems, and media are provided for the improved efficiency in bandwidth usage for transmitting repeated packets in a manner that is transparent to users. Fast, in-network per-packet caches (INPPC) at each node of a transmission retain packets for a configurable period of time or a number of packets. Rather than retransmit data from a first node to a second node within the time period for retention, an identifier is sent. The identifier allows the receiving node to access the first packet still in cache memory and reduces the size of the transmission, thereby optimizing bandwidth usage. Signatures that allow for efficient determination of packet redundancy, such as hashes, can be used. Accordingly, less bandwidth is utilized for repeated transmissions, such as transmission control protocol (TCP) retransmissions, or users accessing the same content within close proximity both physically and temporally.

Parallel Adaptive Quantile Wireless Scheduler

View page
US Patent:
7796551, Sep 14, 2010
Filed:
Jul 11, 2007
Appl. No.:
11/776113
Inventors:
Sridhar Machiraju - Oakland CA, US
Soshant Bali - Lawrence KS, US
Hui Zang - Burlingame CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04L 5/22
US Classification:
370330, 370328, 370348, 455450, 455451, 455452, 455453
Abstract:
A method, medium, and wireless system are provided for scheduling access terminals to prevent starvation of other access terminals connected to a communication network. The wireless system includes access terminals and base stations that are configured with a first wireless scheduler and a parallel wireless scheduler that select access terminals to communicate during specified time slots. The access terminals measure channel conditions associated with communications to the base station and transmit requests that specify a desired communication rate to the base station. The wireless schedulers on each base station receive the requests from each access terminal and select an access terminal to communicate during a subsequent time slot that may be based on, for example, the channel conditions and a combination of the probability estimates associated with the communication rate and a faction of unallocated slots or a second fraction—corresponding to the access terminal—generated by either the first wireless scheduler or the parallel wireless scheduler.

Churn Prediction Using Relationship Strength Quantification

View page
US Patent:
8265992, Sep 11, 2012
Filed:
Mar 24, 2009
Appl. No.:
12/409853
Inventors:
Mukund Seshadri - Oakland CA, US
Sridhar Machiraju - Burlingame CA, US
Jean Bolot - Mountain View CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
G06Q 10/00
G06Q 50/00
G06N 5/02
US Classification:
705 1419, 705 1464, 705304
Abstract:
An embodiment of the current invention is directed to determining that a wireless-service subscriber using a given mobile computing device is likely to transition to another provider (“to churn”). A list of mobile computing devices that have communicated with the given mobile computing device is determined. A relationship-strength value for each mobile computing device in the list is determined. A risk value of the given mobile computing device is determined based on the relationship-strength values of each of the mobile computing devices in the list that have churned. If the risk value is not greater than a risk value threshold, the given mobile computing device is not likely to churn. If the risk value is greater than the risk value threshold, the given mobile computing device is likely to churn.

Secure Opportunistic Use Of External Interfaces

View page
US Patent:
8325133, Dec 4, 2012
Filed:
Jan 7, 2009
Appl. No.:
12/349936
Inventors:
Sridhar Machiraju - Burlingame CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
G09G 5/00
US Classification:
345156, 726 1, 726 4, 726 14, 726 26, 455410, 455411
Abstract:
Embodiments of the invention are directed to using external interfaces. One or more external interfaces that are available for use are discovered. One or more of the discovered external interfaces are selected as selected external interfaces. The selected interfaces are connected to a wireless device. The selected interfaces are used as primary interfaces subject to a security policy.

Scheduling Access Terminals Via One Or More Wireless Schedulers

View page
US Patent:
8369352, Feb 5, 2013
Filed:
Mar 11, 2010
Appl. No.:
12/722244
Inventors:
Sridhar Machiraju - Oakland CA, US
Soshant Bali - Lawrence KS, US
Hui Zang - Burlingame CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04J 3/22
US Classification:
370458, 370442, 455450
Abstract:
A method, medium, and wireless system are provided for scheduling access terminals to prevent starvation of other access terminals connected to a communication network. The wireless system includes access terminals and base stations that are configured with a first wireless scheduler and a parallel wireless scheduler that select access terminals to communicate during specified time slots. The access terminals may measure channel conditions associated with communications to the base station and transmit requests that specify a desired communication rate to the base station. The first and parallel wireless schedulers on each base station receive the requests from each access terminal and select an access terminal to communicate during a subsequent time slot that may be based on, for example, the channel conditions and weighted average functions of the communication rates—corresponding to the access terminal—generated by the first and parallel wireless schedulers.

Cellular Authentication For Authentication To A Service

View page
US Patent:
8442527, May 14, 2013
Filed:
Jan 23, 2009
Appl. No.:
12/358324
Inventors:
Sridhar Machiraju - Burlingame CA, US
Francis A. Hsu - Davis CA, US
Hao Chen - Kensington CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04W 4/00
G06F 15/16
G06F 21/00
G06F 7/04
H04K 1/00
US Classification:
4554351, 709229, 713182, 713184, 726 2, 380270
Abstract:
An identification system comprises a communication interface. The communication interface is configured to receive from a mobile device a registration request to initiate an access session between the mobile device and a communication network, wherein the registration request comprises a device identifier that identifies the mobile device. In response to the registration request, the communication interface is configured to transfer a packet address to the mobile device, wherein the mobile device transfers a service request for a service on the communication network during the access session, wherein the service request includes the packet address. The communication interface is configured to receive an identification request transferred from an authentication system in response to the service request, wherein the identification request indicates the packet address. In response to the identification request, the communication interface is configured to transfer the device identifier for delivery to the authentication system to authenticate the mobile device for the service using the device identifier.

Adaptive Initialization For Wireless Schedulers

View page
US Patent:
8526417, Sep 3, 2013
Filed:
Jun 27, 2007
Appl. No.:
11/769522
Inventors:
Sridhar Machiraju - Oakland CA, US
Soshant Bali - Lawrence KS, US
Hui Zang - Burlingame CA, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04B 7/212
H04L 12/413
H04W 72/00
US Classification:
370347, 370447, 370230, 370329, 455453, 455450
Abstract:
A method, medium, and wireless system are provided for scheduling access terminals to prevent starvation of access terminals connected to a communication network when one or more recently-connected access terminals having limited historical information about their channel conditions request time slots to initiate network communications. The wireless system includes access terminals and base stations that communicate over the communication network. The access terminals measure channel conditions associated with communications to the base station and transmit requests that specify a desired communication rate to the base station. The base stations receive the requests from each access terminal and select an access terminal to communicate during a subsequent time slot based on, among other things, the channel conditions and weighted average functions of the communication rate corresponding to the access terminal.
Control profile
Sridhar S Machiraju from Belmont, CA, age ~46 Get Report