Nitin Gupta, 514365 Headen Way, Santa Clara, CA 95054

7739251, Jun 15, 2010

Mar 7, 2007

11/715603

Nitin Gupta - Sunnyvale CA, US
Sivasankaran Chandrasekar - Palo Alto CA, US
Sam Idicula - San Jose CA, US
Nipun Agarwal - Santa Clara CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/00

707696, 711200, 711219

Techniques are provided for incrementally maintaining an XML index built to access XML data that is encoded in binary XML form. Rather than delete and reinsert index entries of all the nodes of a modified XML document, only the index entries of the affected nodes are modified. Consequently, the order key values stored in the index may become inconsistent with the current hierarchical locations of the nodes to which the order key values correspond. Techniques are described for resolving the inconsistencies, and for addressing additional problems that result when the XML index is path-subsetted.

8010889, Aug 30, 2011

May 2, 2007

11/743563

Nitin Gupta - Sunnyvale CA, US
Sivasankaran Chandrasekar - Palo Alto CA, US
Ravi Murthy - Fremont CA, US
Nipun Agarwal - Santa Clara CA, US

Oracle International Corporation - Redwood Shores CA

G06N 3/00

715234

Various techniques are described hereafter for improving the efficiency of binary XML encoding and loading operations. In particular, techniques are described for incrementally encoding XML in response to amount-based requests. After encoding enough binary XML to satisfy an amount-based request, the encoder stops encoding the XML until a subsequent request is received. The incremental encoding may take place on the client-side or the server-side. Techniques are also described for reducing the character set conversion operations by having a parser convert tokens in text XML into one character set while converting non-token text in the text XML into another character set. Techniques are also described for generating self-contained binary XML documents, and for improving remap operations by providing a binary XML document on a chunk-by-chunk basis.

8180902, May 15, 2012

Sep 30, 2009

12/571430

Mark Stuart Day - Milton MA, US
Brian Miller - San Francisco CA, US
Nitin Gupta - Fremont CA, US
Alfred Landrum - San Francisco CA, US
Blanco Zee Leung Lam - Singapore, SG

Riverbed Technology, Inc. - San Francisco CA

G06F 15/16
G06F 12/00

709227, 709228

Transparent network devices intercept messages from non-transparent network devices that establish a connection. Transparent network devices modify these messages to establish an inner connection with each other. The transparent network devices mimic at least some of the outer connection messages to establish their inner connection. The mimicked messages and any optional reset messages are intercepted by the transparent network devices to prevent them from reaching the outer connections. Transparent network devices modify network traffic, using error detection data, fragmentation data, or timestamps, so that inner connection network traffic inadvertently received by outer connection devices is rejected or ignored by the outer connection network devices. Transparent network devices may use different sequence windows for inner and outer connection network traffic. To prevent overlapping sequence windows, transparent network devices monitor the locations of the inner and outer connection sequence windows and may rapidly advance the inner connection sequence window as needed.

8181060, May 15, 2012

Sep 30, 2009

12/571433

Mark Stuart Day - Milton MA, US
Brian Miller - San Francisco CA, US
Nitin Gupta - Fremont CA, US
Alfred Landrum - San Francisco CA, US
Blanco Zee Leung Lam - Singapore, SG

Riverbad Technology, Inc. - San Francisco CA

G06F 11/00

714 41, 709230, 709238, 370230

Transparent network devices intercept messages from non-transparent network devices that establish a connection. Transparent network devices modify these messages to establish an inner connection with each other. The transparent network devices mimic at least some of the outer connection messages to establish their inner connection. The mimicked messages and any optional reset messages are intercepted by the transparent network devices to prevent them from reaching the outer connections. Transparent network devices modify network traffic, using error detection data, fragmentation data, or timestamps, so that inner connection network traffic inadvertently received by outer connection devices is rejected or ignored by the outer connection network devices. Transparent network devices may use different sequence windows for inner and outer connection network traffic. To prevent overlapping sequence windows, transparent network devices monitor the locations of the inner and outer connection sequence windows and may rapidly advance the inner connection sequence window as needed.

8204058, Jun 19, 2012

Jul 26, 2006

11/494364

David Tze-Si Wu - Fremont CA, US
Soren Lasen - San Francisco CA, US
Nitin Gupta - Fremont CA, US
Vivasvat Keswani - Fremont CA, US

Riverbed Technology, Inc. - Sna Francisco CA

H04L 12/28

370392, 709227

Network traffic is monitored and an optimal framing heuristic is automatically determined and applied. Framing heuristics specify different rules for framing network traffic. While a framing heuristic is applied to the network traffic, alternative framing heuristics are speculatively evaluated for the network traffic. The results of these evaluations are used to rank the framing heuristics. The framing heuristic with the best rank is selected for framing subsequent network traffic. Each client/server traffic flow may have a separate framing heuristic. The framing heuristics may be deterministic based on byte count and/or time or based on traffic characteristics that indicate a plausible point for framing to occur. The choice of available framing heuristics may be determined partly by manual configuration, which specifies which framing heuristics are available, and partly by automatic processes, which determine the best framing heuristic to apply to the current network traffic from the set of available framing heuristics.

8307203, Nov 6, 2012

Jul 14, 2009

12/502983

Charles Fraleigh - Sunnyvale CA, US
Nitin Gupta - Fremont CA, US
Case Larsen - Union City CA, US
Shashidhar Merugu - Mountain View CA, US
Eric Ogren - San Francisco CA, US
Paras Shah - Mountain View CA, US
Oleg Smolsky - Santa Clara CA, US

Riverbed Technology, Inc. - San Francisco CA

H04L 29/06

713156, 713157, 713158, 713159, 726 10, 726 27, 726 28, 726 29, 726 30

A local network traffic processor and an application are resident on a common computer system. The application is configured to trust a server certificate issued by a local network traffic processor, the local network traffic processor operatively being paired with a remote network traffic processor. A proxy server certificate, generated using identification information of a server associated with the remote network traffic processor and signed by the local certification authority, is used to establish a secure session between a local network traffic processor and the application.

8346792, Jan 1, 2013

Nov 9, 2010

12/942950

Steven D. Baker - San Francisco CA, US
Michael Flaster - Menlo Park CA, US
Nitin Gupta - Santa Clara CA, US
Paul Haahr - San Francisco CA, US
Srinivasan Venkatachary - Sunnyvale CA, US
Yonghui Wu - Riverside CA, US

Google Inc. - Mountain View CA

G06F 17/30

707759, 707769

Methods, systems, and apparatus, including computer program products, for generating synthetic queries using seed queries and structural similarity between documents are described. In one aspect, a method includes identifying embedded coding fragments (e. g. , HTML tag) from a structured document and a seed query; generating one or more query templates, each query template corresponding to at least one coding fragment, the query template including a generative rule to be used in generating candidate synthetic queries; generating the candidate synthetic queries by applying the query templates to other documents that are hosted on the same web site as the document; identifying terms that match structure of the query templates as candidate synthetic queries; measuring a performance for each of the candidate synthetic queries; and designating as synthetic queries the candidate synthetic queries that have performance measurements exceeding a performance threshold.

8411570, Apr 2, 2013

Jul 26, 2006

11/494352

David Tze-Si Wu - Fremont CA, US
Nitin Gupta - San Francisco CA, US
Kand Ly - Richmond CA, US

Riverbed Technologies, Inc. - San Francisco CA

H04L 12/26

370235, 709232

Serial clustering uses two or more network devices connected in series via a local and/or wide-area network to provide additional capacity when network traffic exceeds the processing capabilities of a single network device. When a first network device reaches its capacity limit, any excess network traffic beyond that limit is passed through the first network device unchanged. A network device connected in series with the first network device intercepts and will process the excess network traffic provided that it has sufficient processing capacity. Additional network devices can process remaining network traffic in a similar manner until all of the excess network traffic has been processed or until there are no more additional network devices. Network devices may use rules to determine how to handle network traffic. Rules may be based on the attributes of received network packets, attributes of the network device, or attributes of the network.