Microsoft Technology Licensing, LLC

Maxim V Stepin

Deepak Bansal

Eran Yariv

Murari Sridharan

Ronen Barenboim

James T Pinkerton

Scott Colville

Alexander Malysh

Dan Boldo

Jason A Bolla

Alexander Malvsh

Sanaz Ahari

Nitin Agrawal

Bo-June Hsu

Robert A Williams

Farid Hosseini

Andrew Peter Oakley

Srinath Reddy Aaleti

Christopher A Meyers

Nikolay A Glushnev

Herrick J Andrews

Richard J Gruenhagen

Discovery of intermediate network devices is performed using a technique that piggybacks upon the existing standard TCP (Transport Control Protocol) 'SACK' (Selective Acknowledgment) option in a SYN/ACK packet so that discovery information may be shared between pair-wise-deployed peer intermediate devices when a TCP/IP connection (Transport Control Protocol/Internet Protocol) is first established between network endpoints using a conventional three-way handshake. Use of the SACK option is combined with another technique which comprises modifying the original 16-bit value of the TCP receive window size to a special arbitrary value to mark a SYN packet as being generated by a first peer device. The marked SYN when received by the second peer device triggers that device's discovery information to be piggybacked in the SACK option of the SYN/ACK packet. The first device then piggybacks its discovery information in the SACK option of the ACK packet which completes the three-way handshake.

Transparent auto-discovery of network devices logically located between a client and server

The present invention is directed to presenting a suggested search query. Responsive to receiving a user-devised search parameter, a suggested search query is identified. The user-devised search parameter might have been previously received by a search system, or alternatively, might be a unique query that has not been previously received. A suggested search query might be generated using various techniques, such as by applying an n-gram language model. A classification of the suggested search query is determined, and the suggested search query is presented together with a visual indicator, which signifies the classification.

Generating and presenting a suggested search query

Contiguous data packets of a single communication session between endpoints are gathered for compression, and at least the payloads are compressed collectively via a single compressible buffer. The original headers, which may or may not be compressed, and the compressed payloads are transmitted from a sending packet compression device to a receiving packet compression device that performs decompression to the compressed payload and may also decompress headers if they have been compressed at the sending end. The original contiguous data packets including headers and payload may be reconstructed at the receiving packet compression device by matching the headers to the corresponding payloads. The reconstructed data packets are injected back into the single communication session, and the presence of the original headers in the reconstructed data packets may thereby maintain the endpoint-to-endpoint authentication protocols.

Compression of data packets while maintaining endpoint-to-endpoint authentication

Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate providing suggested sites in accordance with target sites are provided. Web-browsed data is locally stored on a user device and uploaded to a suggestion engine. Additional web-browsed data is communicated to the suggestion engine via a suggested site request that provides a request for suggested sites related to a target site. In embodiments, the web-browsed data contained in the suggested site request includes data not previously uploaded to the suggestion engine. The suggestion engine utilizes the web-browsed data uploaded to the suggestion engine and the web-browsed data communicated via the suggested site request to provide suggested sites in association with the target site.

Providing suggested sites associated with target sites

Aspects of the subject matter described herein relate to locally terminating an established connection. In aspects, a connection between two nodes is established. A network device lies on the path over which packets associated with the connection travel to get to either of the two nodes. After the connection is established, the network device attempts to create a safe point at which the connection can be terminated at the network device. To do so, the network device begins buffering packets and looking for information that indicates that all outstanding packets between the two nodes have been received either by one of the two nodes or have been buffered by the network device. After a safe point is reached, the network device may terminate the connection locally in a way that is transparent to the two nodes.

Locally terminating an established connection

Optimization of encrypted traffic flowing over a WAN is provided by an arrangement in which WAN compression is distributed between endpoints (i.e., client machines or servers) in a subnet of a hub and branch network and a WAN compression server in the subnet. A client portion of the WAN compression running on each of one or more endpoints interfaces with a disposable local cache of data seen by endpoints in the subnet that is used for compressing and decompressing traffic using dictionary-based compression techniques. The local WAN compression server in a subnet stores a shared central database of all the WAN traffic in the subnet which is used to populate local disposable caches in the endpoints.

Optimizing encrypted wide area network traffic

A novel system and method provides a concrete relative measure for evaluating coding quality. The novel system and method do not rely on bug counting. Instead, the number of defective lines of code is compared to a total number of opportunities to create such defects. A defective line is a line that is deleted, added or changed subsequent to drafting of the prior version of the code. In an embodiment, a deletion and an addition are each treated as single defects, while modification of a line of code is treated as two defects. In this way, regardless of whether modification is viewed as deletion followed by addition, or rather simply a single step of modification, the number of defects in either case is the same.

Process for measuring coding productivity

Growing community of inventors

Bothell, WA, United States of America

Maxim V Stepin