IP Library › Granted Patent US 8,762,542
Granted Patent B2
US 8,762,542 · App. 11/565,168 · Granted Jun 24, 2014

Protocol for sharing information in a peer to peer service

Inventors: Havoc Pennington (Westford, MA); Donald Fischer (Westford, MA)
Assignee: Red Hat, Inc.
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,762,542
App. No.
11/565,168
Granted
Jun 24, 2014
Kind
B2
Abstract

An embodiment relates generally to a method of providing peer-to-peer services. The method includes selecting a peer-to-peer service and determining multiple participants from a social network to form a set of known peers. The method also includes executing the peer-to-peer service from the set of known peers using a peer-to-peer overlay.

Claims (20)

1. A method comprising:

receiving, by a processor of a first peer from a user, a selection of a peer-to-peer service maintaining a set of peers;

retrieving, by the processor, in response to the selection of the peer-to-peer service, from a social network independent of the peer-to-peer service, a list of participants associated with the user on the social network;

selecting, by the processor, without interaction by the user, a subset of known peers of the set of peers in view of the list of participants; and

invoking, by the processor, without interaction by the user, the selected peer-to-peer service between the first peer and only the subset of known peers using a peer-to-peer overlay.

2. The method of claim 1 , further comprising selecting the subset of known peers of the set of peers in response to the selection of the peer-to-peer service.

3. The method of claim 1 , further comprising associating a respective computer of each participant of the participants as a peer computer in the peer-to-peer service.

4. A non-transitory computer-readable medium comprising instructions for causing a processor to perform operations comprising:

receiving, by the processor from a user, a selection of a peer-to-peer service maintaining a set of peers;

retrieving, by the processor, in response to the selection of the peer-to-peer service, a file storing a list of participants associated with the user from a social network independent of the peer-to-peer service;

selecting, by the processor, without interaction by the user, a subset of known peers of the set of peers of the peer-to-peer service in view of the list of participants of the social network; and

invoking, by the processor, without interaction by the user, the selected peer-to-peer service between the user and only the subset of known the set of peers using a peer-to-peer overlay.

5. A system comprising:

a memory comprising instructions;

a processor, coupled to the memory, the processor executing the instructions to cause the processor to:

receive, from a user, a selection of a peer-to-peer service on a destination computing platform, the peer-to-peer service maintaining a set of peers,

retrieve, in response to the selection of the peer-to-peer service, a file storing a list of participants associated with the user on a social network associated with the destination computing platform, the social network being independent of the peer-to-peer service,

select, without interaction by the user, a subset of known peers of the set of peers in view of the list of participants, and

execute the peer-to-peer service between the destination computing platform and the subset of known peers using a peer-to-peer overlay.

6. The system of claim 5 , wherein the processor associates a respective computing platform of each participant of the participants as a peer computer in the peer-to-peer service.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 30, 2006
From: PENNINGTON, HAVOC; FISCHER, DONALD
To: RED HAT, INC.
Reel/Frame 018567/0976 →
Continuity (1)
Related Publication 20080130522A1 · Jun 5, 2008