# US 8,280,970 B2 · Method and apparatus for improving data transfers in peer-to-peer networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,280,970 B2
- Document ID: US8280970B2
- Status: Granted
- Kind: B2
- Application number: 13/099,919
- Filed: 2011-05-03
- Published: 2011-08-25
- Granted: 2012-10-02
- Earliest claimed: 2005-05-27
- Assignees: International Business Machines Corporation
- Inventors: Mandis S. Beigi; Raymond B. Jennings, III; Jason D. Lavoie
- Web page: https://patentgrep.com/patent/US8280970B2

## CPC

- H04L 67/1038: Load balancing arrangements to avoid a single path through a load balancer
- G06F 16/148: {File search processing}
- G06F 16/1834: {implemented based on peer-to-peer networks, e.g. gnutella (p2p communication protocols H04L67/104)}
- H04L 67/1012: based on compliance of requirements or conditions with available server resources
- H04L 67/1001: for accessing one among a plurality of replicated servers
- H04L 67/104: Peer-to-peer [P2P] networks
- H04L 67/1068: {Discovery involving direct consultation or announcement among potential requesting and potential source peers}
- H04L 67/51: Discovery or management thereof, e.g. service location protocol [SLP] or web services
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

## Claims

### Claim 1

A method for facilitating a transfer of data between nodes in a network, the method comprising:
sending, by a first node, a test search message to a second node, wherein the second node previously retrieved requested data;
removing the second node from a referral message that identifies one or more nodes that have the requested data, when a response to the test search message indicates that the second node no longer has the requested data;
receiving, by the first node, a search request message from a third node, wherein the search request message requests the requested data; and
sending, by the first node, the referral message to the third node in response to the search request message, the sending the referral message is performed only when the first node determines that a time to live field associated with the search request message has expired.

### Claim 2 (depends on 1)

The method of claim 1, wherein the second node is believed to have the requested data on a basis of a previous retrieval of the requested data from the first node.

### Claim 3 (depends on 1)

The method of claim 1, wherein the previous retrieval occurred within a predefined period of time.

### Claim 4 (depends on 3)

The method of claim 3, wherein the predefined period of time is defined by the first node.

### Claim 5 (depends on 3)

The method of claim 3, wherein the predefined period of time is defined by a third node who has requested the requested data.

### Claim 6 (depends on 1)

The method of claim 1, wherein the test search message is sent upon an expiration of a predefined period of time.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
re-sending, by the first node, the test search message on a periodic basis.

### Claim 8

A computer readable storage device containing an executable program for facilitating a transfer of data between nodes in a network, the program when executed by a processor performs steps of:
sending, by a first node, a test search message to a second node, wherein the second node previously retrieved requested data;
removing the second node from a referral message that identifies one or more nodes that have the requested data, when a response to the test search message indicates that the second node no longer has the requested data;
receiving, by the first node, a search request message from a third node, wherein the search request message requests the requested data; and
sending, by the first node, the referral message to the third node in response to the search request message, the sending the referral message is performed only when the first node determines that a time to rive field associated with the search request message has expired.

### Claim 9 (depends on 8)

The computer readable storage device of claim 8, wherein the second node is believed to have the requested data on a basis of a previous retrieval of the requested data from the first node.

### Claim 10 (depends on 8)

The computer readable storage device of claim 8, wherein the previous retrieval occurred within a predefined period of time.

### Claim 11 (depends on 10)

The computer readable storage device of claim 10, wherein the predefined period of time is defined by the first node.

### Claim 12 (depends on 10)

The method computer readable storage device of claim 10, wherein the predefined period of time is defined by a third node who has requested the requested data.

### Claim 13 (depends on 8)

The computer readable storage device of claim 8, wherein the test search message is sent upon an expiration of a predefined period of time.

### Claim 14

Apparatus comprising:
means for sending, by a first node, a test search message to a second node, wherein the second node previously retrieved requested data;
means for removing the second node from a referral message that identifies one or more nodes that have the requested data, when a response to the test search message indicates that the second node no longer has the requested data;
means for receiving, by the first node, a search request message from a third node, wherein the search request message requests the requested data; and
means for sending, by the first node, the referral message to the third node in response to the search request message, the sending the referral message is performed only when the first node determines that a time to rive field associated with the search request message has expired.
