IP Library › Granted Patent US 8,650,259
Granted Patent B2
US 8,650,259 · App. 11/049,808 · Granted Feb 11, 2014

Method and apparatus for increasing the search space or peer-to-peer networks using time-to-live boosting

Inventors: Raymond B. Jennings, III (Ossining, NY); Jason D. LaVoie (Mahopac, NY)
Assignee: International Business Machines Corporation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,650,259
App. No.
11/049,808
Granted
Feb 11, 2014
Kind
B2
Abstract

Disclosed are methods and systems for expanding the search space in a Peer-to-Peer (“P2P”) network. In one embodiment, the search space is expanded by increasing the time-to-live value of the search request message. The P2P network may include a plurality of nodes, and the method for increasing the search space in the network includes the steps of receiving a search request message; changing a time-to-live value carried by the message; and forwarding the message to at least one peer node.

Claims (26)

1. In a peer-to-peer network comprising a plurality of nodes, a method for increasing a search space in the network comprising steps of:

receiving a search request message at a peer node within said peer-to-peer network, said search request message including a time-to-live value;

decrementing the time-to-live at every peer node receiving the search request message;

incrementing the time-to-live value in the message at an edge node where the time-to-live value of the message becomes zero; and

forwarding the message to at least one other peer node that has not received the message, wherein said incrementing and said forwarding increase a number of edge nodes, thereby expanding said search space in said peer-to-peer network;

retrieving from the message a count of the number of nodes along the message's path that have responded to the request before forwarding the message to the at least one peer node; and

comparing that count with a threshold, the threshold being different from the time-to-live value; and

increasing the time-to-live value in the message if the count is below the threshold.

2. The method of claim 1 , wherein the count is increased before forwarding the message to the at least one peer node.

3. The method of claim 1 , wherein the threshold is specified in the message.

4. In a peer-to-peer network comprising a plurality of nodes, a method for increasing a search space in the network comprising steps of:

receiving a search request message at a peer node within said peer-to-peer network, said search request message including a time-to-live value;

responding to a requester node from which the search request message is originated and increasing a responder count if said peer node has data that which requestor node searches for;

decrementing the time-to-live value in the message at said peer node;

determining at said peer node if the time-to-live value in the message is zero; and

if the time-to-live value is zero,

reading the responder count;

comparing the count with a threshold being different from the time-to-live value;

increasing the time-to-live value in the message if the count is below the threshold;

forwarding the message to at least one other peer node that has not received the message,

whereby increasing a number of edge nodes and expanding the search space in the network, the edge nodes representing nodes where the time-to-live value of the message becomes zero; and

if the time-to-live value is larger or smaller than zero,

forwarding the message to the at least one other peer node that has not received the message.

5. The method of claim 4 , wherein the at least one other peer node is not a node that sent the message.

6. The method of claim 4 , wherein the threshold is specified in the message.

7. A computer recordable-type medium storing instructions being executed by a data processing system for causing the data processing system to perform method steps for increasing a search space in a peer-to-peer network, said method steps comprising the steps of claim 4 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 24, 2005
From: JENNINGS, RAYMOND B., III; LAVOIE, JASON D.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 015793/0541 →
Continuity (1)
Related Publication 20060173967A1 · Aug 3, 2006