Optimizing communication using scalable peer groups

• US 7,496,602 B2
• Filed: 01/04/2006
• Issued: 02/24/2009
• Est. Priority Date: 09/30/2004
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Wilson, Hervey Oliver, Kaler, Christopher G., Hasha, Richard L., Kakivaya, Gopala Krishna R.
• Primary Examiner(s): Woo; Isaac M
• Application Number:
  US11/325,690
• Publication Number:
  US 20060117024A1
• Time in Patent Office: 1,147 Days
• Field of Search: 707 1- 10, 707100-1041, 707200-206
• US Class Current: 1/1
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: H04L 61/30 Managing network names, e.g. use of aliases or nicknames name-to-address mapping H04L61/45
• CPC Class Codes: H04L 61/3015 Name registration, generation or assignment
• CPC Class Codes: H04L 61/4552 Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

Claims

1. At a peer computer in a peer-to-peer communication system in which one or more peers communicate messages with one or more other peers in a peer group, a method of managing peer group communication within a network namespace, comprising the acts of:

identifying a first peer group of one or more peers associated in a peer-to-peer communication system, the first peer group being associated with a first namespace wherein a namespace identifies a set of names in hierarchical format;

sending a group join request message to the first namespace; and

receiving a confirmation message from the first namespace that membership in the first peer group has been accepted, such that the peer has been added to a membership list of the first peer group, and such that the peer is subscribed to the first namespace, wherein the membership list for the first peer group comprises one or more peers and an identifier of a second peer group of one or more peers, the second peer group being associated with a second namespace wherein messages sent to the first peer group are forwarded to each member of the membership list such that each of the one or more peers of the first peer group and also each of the one or more peers of the second peer group receive the messages.

2. The peer-to-peer communication system as recited in claim 1, further comprising an act of sending a peer message to the first peer group by publishing the peer message to the first namespace.

3. The peer-to-peer communication system as recited in claim 1 further comprising the acts of:

storing at least a portion of the membership list for the first group at the peer computer; and

sending a group join request message to the second namespace associated with the second peer group.

4. The peer-to-peer communication system as recited in claim 3, further comprising the acts of:

receiving a new confirmation message from the second namespace that membership in the second peer group has been accepted; and

adding the first peer group to the membership list for the second peer group.

5. The peer-to-peer communication system as recited in claim 4, further comprising an act of creating a namespace bridge between the first and second namespace, such that peer messages sent to the first namespace are automatically chained to the second namespace.

6. The peer-to-peer communication system as recited in claim 4, wherein the peer computer is a node in the peer-to-peer communication system, and wherein the at least a portion of the membership list is stored at the peer computer in a hash table.

7. In a peer-to-peer communication system in which one or more peers communicate messages with one or more other peers in a peer group, a computer program product comprising a storage medium having computer-executable instructions stored thereon that, when executed, cause one or more processors at a peer computer system to execute a method comprising the following:

identifying a first peer group of one or more peers associated in a peer-to-peer communication system, the first peer group being associated with a first namespace wherein a namespace identifies a set of names in hierarchical format;

sending a group join request message to the first namespace; and

receiving a confirmation message from the first namespace that membership in the first peer group has been accepted, such that the peer has been added to a membership list of the first peer group, and such that the peer is subscribed to the first namespace, wherein the membership list for the first peer group comprises one or more peers and an identifier of a second peer group of one or more peers, the second peer group being associated with a second namespace wherein messages sent to the first peer group are forwarded to each member of the membership list such that each of the one or more peers of the first peer group and also each of the one or more peers of the second peer group receive the messages.