Reducing Latency in Returning Online Search Results

• US 20100299349A1
• Filed: 05/20/2009
• Published: 11/25/2010
• Est. Priority Date: 05/20/2009
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Patel, Parveen Kumar, Padhye, Jitendra Dattatraya, Kern, Randall Friend, Sridharan, Murari, Greenberg, Albert Gordon, Maltz, David A., Yuan, Lihua
• Application Number:
  US12/469,160
• Publication Number:
  US 20100299349A1
• Time in Patent Office: Days
• US Class Current: 707/769
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching

Abstract

An embodiment of the invention is directed to reducing search-response latency. The closest intermediate server can be located between a client computing device and a search engine. A search query is sent to the intermediate server in a first packet of a transport protocol handshake. A plurality of packets are received from the intermediate server. The plurality of packets are used to open a window associated with a transport protocol. A response related to the search query is received by the client.

Claims

1. Computer-readable media having computer-executable instructions embodied thereon that, when executed, perform a method of reducing search-response latency, the method comprising:

determining a closest intermediate server, which is positioned between a client computing device (“

client”

) and a destination server;

sending a search query to the closest intermediate server;

receiving a plurality of packets from the closest intermediate server;

increasing a congestion window of the transport protocol; and

receiving a response related to the search query.

2. The media of claim 1, wherein determining the closest intermediate server includes requesting an address of a closest intermediate server from a domain name service utilizing a geographic-based proximity algorithm.

3. The media of claim 1, wherein increasing a congestion window includes sending a second plurality of packets, wherein said second plurality of packets are utilized to increase the congestion window.

4. The media of claim 1, wherein increasing the congestion window includes increasing an initial window size of the transport protocol.

5. The media of claim 1, further comprising sending one or more packets of the transport protocol a threshold number of times.

6. The media of claim 5, wherein the threshold number of times is two.

7. The media of claim 1, wherein the search query is contained in a first packet of a handshake of the transport protocol.

8. The media of claim 1, wherein the response includes a response to the search query and forward error correction data.

9. The media of claim 1, wherein the response related to the search query is received directly from the search engine.

10. The media of claim 1, wherein the response related to the search query is received from the closest intermediate server.

11. Computer-readable media having computer-executable instructions embodied thereon that, when executed, perform a method of reducing search-response latency, the method comprising:

receiving a search query from a client computing device (“

client”

);

sending the search query to a search engine utilizing a first transport protocol;

sending a number of packets to the client utilizing a second transport protocol;

utilizing said number of packets to open a congestion window of the second transport protocol;

receiving a response related to the search query from the search engine; and

sending the response to the client.

12. The media of claim 11, wherein the search query from the client computing device is received in a first packet of a handshake of a second transport protocol.

13. The media of claim 11, wherein the response related to the search query is received from the search engine in a packet of a handshake of the first transport protocol.

14. The media of claim 13, further comprising receiving the response related to the search query utilizing the first transport protocol a first threshold number of times.

15. The media of claim 14, further comprising sending the response related to the search query utilizing the second transport protocol a second threshold number of times.

16. The media of claim 15, wherein the first threshold and the second threshold are two.

17. The media of claim 11, wherein the response includes data related to the search query and forward error correction data.

18. Computer-readable media having computer-executable instructions embodied thereon that, when executed, perform a method of reducing query-response latency, the method comprising:

determining a closest intermediate server, which is positioned between a client computing device (“

client”

) and a destination server;

increasing an initial window size of a transport protocol from a first size to a second size;

sending a query to the closest intermediate server, wherein said query is sent a threshold number of times;

receiving a plurality of packets from the closest intermediate server;

utilizing said plurality of packets to open a sending window of the transport protocol; and

receiving a response related to the query from the intermediate server, said response including data related to the query and forward error correction data.

19. The media of claim 18, wherein determining the closest intermediate server includes requesting an address of a closest intermediate server from a domain name service utilizing a geographic-based proximity algorithm.

20. The media of claim 18, wherein said first size is two maximum segment sizes and said second size is eight maximum segment sizes.