Extensible peer-to-peer graphing messages

• US 20040254977A1
• Filed: 06/13/2003
• Published: 12/16/2004
• Est. Priority Date: 06/13/2003
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Zhang, Xiaohai
• Application Number:
  US10/460,943
• Publication Number:
  US 20040254977A1
• Time in Patent Office: Days
• US Class Current: 709/201
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 67/14 Session management for real-time applications in data packet communications networks H04L65/1066
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

An embodiment of the present invention provides for extensible peer-to-peer graphing messages that address the shortcomings of conventional serverless group creation and maintenance mechanisms. Extensible peer-to-peer graphing message formats are described. A connecting mode of peer-to-peer graphing communications includes peer-to-peer graphing authentication information, connect, refuse, welcome and disconnect messages. A synchronizing mode includes peer-to-peer graphing solicit new, solicit time, solicit hash, advertise, request and synchronize end messages. A flooding mode includes peer-to-peer graphing flood and acknowledge messages. A peer-to-peer graphing point-to-point message is also disclosed.

Claims

1. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a first peer-to-peer graphing connect message, wherein the first peer-to-peer graphing connect message comprises;

a peer-to-peer graph node identifier; and

a first variable size network protocol address array; and

processing a peer-to-peer graphing refuse message in response to the first peer-to-peer graphing connect message, wherein the peer-to-peer graphing refuse message comprises;

a refuse code comprising an indication of why a peer-to-peer graphing welcome message was not sent in response to the first peer-to-peer graphing connect message; and

a second variable size network protocol address array comprising at least one network protocol address of an alternative destination for a second peer-to-peer graphing connect message.

2. The computer-readable medium of claim 1, wherein the peer-to-peer graph node identifier comprises a pseudo-randomly generated number.

3. The computer-readable medium of claim 1, wherein each element of each network protocol address array comprises:

a network protocol specifier; and

a network protocol address.

4. The computer-readable medium of claim 1, wherein processing the peer-to-peer graphing message comprises formatting the peer-to-peer graphing message.

5. The computer-readable medium of claim 1, wherein processing the peer-to-peer graphing message comprises disassembling the peer-to-peer graphing message into one or more peer-to-peer graphing message frames.

6. The computer-readable medium of claim 1, wherein processing the peer-to-peer graphing message comprises parsing the peer-to-peer graphing message.

7. The computer-readable medium of claim 1, wherein processing the peer-to-peer graphing message comprises assembling the peer-to-peer graphing message from one or more peer-to-peer graphing message frames.

8. The computer-readable medium of claim 1, wherein each peer-to-peer graphing message further comprises a peer-to-peer graphing message header, and wherein the peer-to-peer graphing message header comprises:

a peer-to-peer graphing message size;

a peer-to-peer graphing message version; and

a peer-to-peer graphing message type.

9. The computer-readable medium of claim 1, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing authentication information message for initiating the negotiation of a secure underlying data transport mechanism, wherein the peer-to-peer graphing authentication information message comprises:

a peer-to-peer graph identifier; and

a source peer identifier.

10. The computer-readable medium of claim 1, wherein the computer-executable instructions for performing the method further comprise processing a second peer-to-peer graphing connect message in response to the peer-to-peer graphing refuse message.

11. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a first peer-to-peer graphing connect message, wherein the first peer-to-peer graphing connect message comprises;

a first peer-to-peer graph node identifier; and

a first variable size network protocol address array; and

processing a peer-to-peer graphing welcome message in response to the first peer-to-peer graphing connect message, wherein the peer-to-peer graphing welcome message comprises;

a second peer-to-peer graph node identifier; and

a current graph time.

12. The computer-readable medium of claim 11, wherein each peer-to-peer graph node identifier comprises a pseudo-randomly generated number.

13. The computer-readable medium of claim 11, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing authentication information message for initiating the negotiation of a secure underlying data transport mechanism, and wherein the peer-to-peer graphing authentication information message comprises:

a peer-to-peer graph identifier; and

a source peer identifier.

14. The computer-readable medium of claim 11, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing disconnect message subsequent to processing the peer-to-peer graphing welcome message, wherein the peer-to-peer graphing disconnect message comprises:

a disconnect reason corresponding to a peer-to-peer graph partition probability; and

a second variable size network protocol address array comprising at least one network protocol address of an alternative destination for a second peer-to-peer graphing connect message.

15. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a peer-to-peer graphing solicit new message, wherein the peer-to-peer graphing solicit new message comprises;

a peer-to-peer graph record type include count;

a peer-to-peer graph record type exclude count; and

a variable size peer-to-peer graph record type array; and

processing a peer-to-peer graphing flood message in response to the peer-to-peer graphing solicit new message, wherein the peer-to-peer graphing flood message comprises;

at least one variable size peer-to-peer graph record; and

for each peer-to-peer graph record, a peer-to-peer graphing message offset locating the next peer-to-peer graph record.

16. The computer-readable medium of claim 15, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing welcome message resulting in a peer-to-peer graphing message communication connection over which the peer-to-peer graphing solicit new message is sent, and wherein the peer-to-peer graphing welcome message comprises:

a peer-to-peer graph node identifier; and

a current graph time.

17. The computer-readable medium of claim 15, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing acknowledge message in response to the peer-to-peer graphing flood message, wherein the peer-to-peer graphing acknowledge message comprises a variable size acknowledge array having an array element for each peer-to-peer graph record in the peer-to-peer graphing flood message.

18. The computer-readable medium of claim 15, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing synchronize end message in response to the peer-to-peer graphing solicit new message.

19. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a peer-to-peer graphing solicit time message, wherein the peer-to-peer graphing solicit time message comprises;

a peer-to-peer graph record type include count;

a peer-to-peer graph record type exclude count;

a most recent modification time of a peer-to-peer graph record set; and

a variable size peer-to-peer graph record type array; and

processing a peer-to-peer graphing flood message in response to the peer-to-peer graphing solicit time message, wherein the peer-to-peer graphing flood message comprises;

at least one variable size peer-to-peer graph record; and

for each peer-to-peer graph record, a peer-to-peer graphing message offset locating the next peer-to-peer graph record.

20. The computer-readable medium of claim 19, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing welcome message resulting in a peer-to-peer graphing message communication connection over which the peer-to-peer graphing solicit time message is sent, and wherein the peer-to-peer graphing welcome message comprises:

a peer-to-peer graph node identifier; and

a current graph time.

21. The computer-readable medium of claim 19, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing acknowledge message in response to the peer-to-peer graphing flood message, and wherein the peer-to-peer graphing acknowledge message comprises a variable size acknowledge array having an array element for each peer-to-peer graph record in the peer-to-peer graphing flood message.

22. The computer-readable medium of claim 19, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing synchronize end message in response to the peer-to-peer graphing solicit time message.

23. The computer-readable medium of claim 19, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing solicit hash message, and wherein the peer-to-peer graphing solicit hash message comprises:

a peer-to-peer graph record type include count;

a peer-to-peer graph record type exclude count;

a variable size peer-to-peer graph record type array; and

a variable size peer-to-peer graph record bucket hash entry array.

24. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a peer-to-peer graphing solicit hash message, wherein the peer-to-peer graphing solicit hash message comprises;

a peer-to-peer graph record type include count;

a peer-to-peer graph record type exclude count;

a variable size peer-to-peer graph record type array; and

a variable size peer-to-peer graph record bucket hash entry array; and

processing a peer-to-peer graphing advertise message in response to the peer-to-peer graphing solicit hash message, wherein the peer-to-peer graphing advertise message comprises;

a variable size peer-to-peer graph record bucket hash entry boundary array; and

a first variable size peer-to-peer graph record abstract array.

25. The computer-readable medium of claim 24, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing solicit time message, and wherein the peer-to-peer graphing solicit time message comprises:

a peer-to-peer graph record type include count;

a peer-to-peer graph record type exclude count;

a most recent modification time of a peer-to-peer graph record set; and

a variable size peer-to-peer graph record type array.

26. The computer-readable medium of claim 24, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing request message in response to the peer-to-peer graphing advertise message, and wherein the peer-to-peer graphing request message comprises a second variable size peer-to-peer graph record abstract array.

27. A computer-readable medium having thereon computer-executable instructions for performing a method comprising:

processing a peer-to-peer graphing flood message, wherein the peer-to-peer graphing flood message comprises;

at least one variable size peer-to-peer graph record; and

for each peer-to-peer graph record, a peer-to-peer graphing message offset locating the next peer-to-peer graph record; and

processing a peer-to-peer graphing acknowledge message in response to the peer-to-peer graphing flood message, wherein the peer-to-peer graphing acknowledge message comprises a variable size acknowledge array having an array element for each peer-to-peer graph record in the peer-to-peer graphing flood message.

28. The computer-readable medium of claim 27, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing welcome message resulting in a peer-to-peer graphing message communication connection over which the peer-to-peer graphing flood message is sent, and wherein the peer-to-peer graphing welcome message comprises:

a peer-to-peer graph node identifier; and

a current graph time.

29. The computer-readable medium of claim 28, wherein the computer-executable instructions for performing the method further comprise processing a peer-to-peer graphing disconnect message subsequent to processing the peer-to-peer graphing welcome message, wherein the peer-to-peer graphing disconnect message comprises:

a disconnect reason corresponding to a peer-to-peer graph partition probability; and

a variable size network protocol address array comprising at least one network protocol address of an alternative destination for a peer-to-peer graphing connect message.

30. A computer-readable medium having stored thereon a peer-to-peer graphing message comprising a peer-to-peer graphing message header, the peer-to-peer graphing message header comprising:

a peer-to-peer graphing message size data field;

a peer-to-peer graphing message version data field;

a peer-to-peer graphing message type data field; and

padding such that the size in bytes of the peer-to-peer graphing message header is a multiple of a power of two.

31. The computer-readable medium of claim 30, wherein:

the peer-to-peer graphing message size data field occupies 4 bytes;

the peer-to-peer graphing message version data field occupies 1 byte;

the peer-to-peer graphing message type data field occupies 1 byte; and

the padding occupies 2 bytes.

32. The computer-readable medium of claim 30, wherein the data fields of the peer-to-peer graphing message are arranged in the peer-to-peer graphing message in the order that they are listed in the claim.

33. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph authentication flags data field;

a first peer-to-peer graphing message offset to a peer-to-peer graph identifier;

a second peer-to-peer graphing message offset to a source peer identifier;

a third peer-to-peer graphing message offset to a destination peer identifier;

the peer-to-peer graph identifier;

the source peer identifier; and

the destination peer identifier.

34. The computer-readable medium of claim 33, wherein:

the peer-to-peer graph authentication flags data field occupies 1 byte; and

each peer-to-peer graphing message offset occupies 2 bytes.

35. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph connect flags data field;

a network protocol address count data field;

a first peer-to-peer graphing message offset to a network protocol address array;

a second peer-to-peer graphing message offset to a friendly peer name;

a peer-to-peer graph node identifier;

the network protocol address array; and

the friendly peer name.

36. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph connection refuse code data field;

a network protocol address count data field;

a peer-to-peer graphing message offset to a network protocol address array; and

the network protocol address array.

37. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph node identifier;

a peer-to-peer graph time data field;

a network protocol address count data field;

a first peer-to-peer graphing message offset to a network protocol address array;

a second peer-to-peer graphing message offset to a peer identifier;

a third peer-to-peer graphing message offset to a friendly peer name;

the network protocol address array;

the peer identifier; and

the friendly peer name.

38. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph disconnect reason data field;

a network protocol address count data field;

a peer-to-peer graphing message offset to a network protocol address array; and

the network protocol address array.

39. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record type include count data field;

a peer-to-peer graph record type exclude count data field;

a peer-to-peer graphing message offset to a peer-to-peer graph record type array; and

the peer-to-peer graph record type array.

40. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises a peer-to-peer graph record set synchronize end flags data field.

41. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record type include count data field;

a peer-to-peer graph record type exclude count data field;

a peer-to-peer graphing message offset to a peer-to-peer graph record type array;

a peer-to-peer graph record set most recent modification time data field; and

the peer-to-peer graph record type array.

42. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record type include count data field;

a peer-to-peer graph record type exclude count data field;

a first peer-to-peer graphing message offset to a peer-to-peer graph record type array;

a peer-to-peer graph record bucket hash entry count data field;

a second peer-to-peer graphing message offset to a peer-to-peer graph record bucket hash entry array;

the peer-to-peer graph record type array; and

the peer-to-peer graph record bucket hash entry array.

43. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record bucket hash entry boundary count data field;

a peer-to-peer graph record abstract count data field;

a first peer-to-peer graphing message offset to a peer-to-peer graph record bucket hash entry boundary array;

a second peer-to-peer graphing message offset to a peer-to-peer graph record abstract array;

the peer-to-peer graph record bucket hash entry boundary array; and

the peer-to-peer graph record abstract array.

44. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record abstract count data field;

a peer-to-peer graphing message offset to a peer-to-peer graph record abstract array; and

the peer-to-peer graph record abstract array.

45. The computer-readable medium of claim 30, wherein:

the peer-to-peer graphing message further comprises one or more peer-to-peer graph records;

each peer-to-peer graph record in the peer-to-peer graphing message has a peer-to-peer graphing flood message record header;

the peer-to-peer graphing flood message record header for the first of the one or more peer-to-peer graph records comprises;

a first peer-to-peer graphing message offset to the first peer-to-peer graph record; and

a second peer-to-peer graphing message offset to the next peer-to-peer graphing flood message record header; and

the peer-to-peer graphing flood message record header for peer-to-peer graph records subsequent to the first of the one or more peer-to-peer graph records comprises;

a previous peer-to-peer graph record padding size data field; and

another peer-to-peer graphing message offset to the next peer-to-peer graphing flood message record header

46. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graph record acknowledge count data field;

a peer-to-peer graphing message offset to a peer-to-peer graph record acknowledge array; and

the peer-to-peer graph record acknowledge array.

47. The computer-readable medium of claim 30, wherein the peer-to-peer graphing message further comprises:

a peer-to-peer graphing message offset to a peer-to-peer graphing point-to-point message data array; and

the peer-to-peer graphing point-to-point message data array.