METHOD AND SYSTEM FOR MANAGING A PEER OF A PEER-TO-PEER NETWORK TO SEARCH FOR AVAILABLE RESOURCES

• US 20100042727A1
• Filed: 10/21/2009
• Published: 02/18/2010
• Est. Priority Date: 06/04/2003
• Status: Active Grant

• Current Assignee: Sony Interactive Entertainment Inc. (Sony Group Corp.)
• Original Assignee: Sony Computer Entertainment Incorporated (Sony Group Corp.)
• Inventors: White, Payton R.
• Granted Patent: US 8,214,498 B2
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04L 67/1089 Hierarchical topologies
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services

Abstract

A method and apparatus for managing a peer of a peer-to-peer network to search for an available resource includes organizing peers of the peer-to-peer network in a hierarchical structure based upon locality of the peers. A request for the available resource is received at a parent from a peer as a request bit string. An aggregate availability bit string representing an aggregate of resources available at all children associated with the parent is accessed to determine if one or more children of the parent are able to fulfill the resource request. The determination is by performing a logical operation with bits of the request bit string and bits of aggregate availability bit string. When more than one child of the parent is able to provide the requested resource, a child with available resource that is closest to the peer requesting the resource is identified. The available resource of the identified child is used to satisfy the resource request of the peer.

Claims

1. A computer implemented method for managing a peer of a peer-to-peer network to search for an available resource, comprising method operations of:

organizing peers of the peer-to-peer network in a hierarchical structure based upon locality of the peers;

receiving a request for the available resource at a parent, the request received as a request bit string from the peer;

accessing an aggregate availability bit string associated with the parent, the aggregate availability bit string representing an aggregate resource available at all children of the parent;

determining if one or more children of the parent are able to provide the available resource, the determination is by performing a logical operation with bits of the request bit string and bits of the aggregate availability bit string;

when more than one child of the parent is able to provide the available resource, identifying a child with available resource that is closest to the peer to provide resource to satisfy the resource request of the request bit string.

2. The method of claim 1, wherein organizing peers further includes,

when a request for the available resource is received,

identifying the peers in the peer-to-peer network with available resources requested by the request bit string based on the locality;

and

dynamically organizing the peers into the hierarchical structure based on the availability of resources and locality of the peers, the peers closest to the peer requesting resources capable of providing at least a portion of the resources requested by the request bit string.

3. The method of claim 1, further includes,

when the parent is unable to provide available resources to satisfy the request bit string,

defining a plurality of sub-request strings from the request bit string;

determining one or more children of the parent to satisfy one or more of the plurality of sub-request strings;

when more than one child of the parent is able to satisfy a sub-request string, selecting a child with available resource that is closest to the peer to provide resource to satisfy the resource requested by the sub-request string.

4. The method of claim 3, further includes,

when the parent is able to satisfy only a portion of the request bit string,

identifying a second parent with one or more children to provide the resource to satisfy one or more of the sub-request strings, the identification of the second parent based on available resources of the one or more children of the second parent, locality of the second parent and locality of one or more children associated with the second parent.

5. The method of claim 4, further includes

selecting the remaining one or more children of the second parent to satisfy the requests of the remaining one or more sub-request strings based on the locality, the available resources to satisfy the one or more sub-request strings satisfying the resources requested by the request string.

6. A computer readable medium having computer readable code which when implemented by a computer system manages a peer of a peer-to-peer network to search for an available resource, comprising:

program code for organizing peers of the peer-to-peer network in a hierarchical structure based upon locality of the peers;

program code for receiving a request for the available resource at a parent, the request received as a request bit string from the peer;

program code for accessing an aggregate availability bit string associated with the parent, the aggregate availability bit string representing an aggregate resource available at all children of the parent;

program code for determining if one or more children of the parent are able to provide the available resource, the determination is by performing a logical operation with bits of the request bit string and bits of the aggregate availability bit string;

when more than one child of the parent is able to provide the available resource, program code for identifying a child with available resource that is closest to the peer to provide resource to satisfy the resource request of the request bit string.

7. The computer readable medium of claim 6, wherein program code for organizing peers further includes,

when a request for the available resource is received,

program code for identifying the peers in the peer-to-peer network with available resources requested by the request bit string based on the locality;

and

program code for dynamically organizing the peers into the hierarchical structure based on the availability of resources and locality of the peers such that the peers closest to the peer requesting resources capable of providing at least a portion of the resources requested by the request bit string.

8. The computer readable medium of claim 6, further includes,

when the parent is unable to provide available resources to satisfy the request bit string,

program code for defining a plurality of sub-request strings from the request bit string;

program code for determining one or more children of the parent to satisfy one or more of the plurality of sub-request strings;

when more than one child of the parent is able to satisfy a sub-request string, program code for selecting a child with available resource that is closest to the peer to provide resource to satisfy the resource requested by the sub-request string.

9. The computer readable medium of claim 8, further includes,

when the parent is able to satisfy only a portion of the request bit string,

program code for identifying a second parent with one or more children to provide the resource to satisfy one or more of the sub-request strings, the identification of the second parent based on available resources of the one or more children of the second parent, locality of the second parent and locality of one or more children associated with the second parent.

10. The computer readable medium of claim 9, further includes

program code for selecting the one or more children of the second parent to satisfy the requests of the remaining one or more sub-request strings based on the locality, the available resources to satisfy the one or more sub-request strings satisfy the resources requested by the request string.