Path optimizer for peer to peer networks

• US 20030208621A1
• Filed: 05/06/2002
• Published: 11/06/2003
• Est. Priority Date: 05/06/2002
• Status: Active Grant

• Current Assignee: PNI Canada Acquireco Corp. (Francisco Partners Management LLC)
• Original Assignee: Sandvine Incorporated ULC (Sandvine Corp.)
• Inventors: Bowman, Don
• Granted Patent: US 7,571,251 B2
• Time in Patent Office: Days
• US Class Current: 709/242
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1063 Discovery through centralising entities
• CPC Class Codes: H04L 67/1072 Discovery involving ranked list compilation of candidate peers
• CPC Class Codes: H04L 67/1091 Interfacing with client-server systems or between P2P systems
• CPC Class Codes: H04L 67/563 Data redirection of data network streams
• CPC Class Codes: H04L 67/564 Enhancement of application control based on intercepted application data
• CPC Class Codes: H04L 67/565 Conversion or adaptation of application format or content adding application control or application functional data H04L67/561
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

The invention disclosed is a path optimizer for Peer to Peer (P2P) networks. Large amounts of P2P file exchanges increase the costs to maintain a network. Network service providers typically pay for the amount of data they exchange with other network service providers. The present invention examines P2P messages between and within networks and provides a cost efficient path to handle each P2P message.

Claims

1. A peer to peer optimizer, said optimizer examining peer to peer messages between nodes within networks connected to said optimizer, for the purpose of optimizing behavior on each of said networks.

2. The optimizer of claim 1 wherein said optimizer utilizes path cost information in optimizing behavior.

3. The optimizer of claim 2 wherein said path cost information is derived from cost class information.

4. The optimizer of claim 1 wherein a peer to peer message may be redirected.

5. The optimizer of claim 1 wherein a peer to peer message may be modified.

6. The optimizer of claim 1 wherein a peer to peer message may be forwarded.

7. The optimizer of claim 1 wherein a peer to peer message may not be forwarded.

8. The optimizer of claim 1 wherein new peer to peer messages may be created.

9. The optimizer of claim 1 wherein if a peer to peer message is a query message, forwarding said query message to an optimized set of nodes.

10. The optimizer of claim 9 further comprising a content index.

11. The optimizer of claim 10 wherein said content index comprises a mapping of content to nodes.

12. The optimizer of claim 11 wherein said content index is used to limit the number of nodes a query message is forwarded to.

13. The optimizer of claim 11 wherein said content index is used to determine said optimized set of nodes.

14. The optimizer of claim 13 wherein said optimized set of nodes is selected based upon path cost.

15. The optimizer of claim 13 wherein if no nodes are found in said content index to satisfy said query message, forwarding said query message to a set of nodes determined by a weighted probabilistic function.

16. The optimizer of claim 1 wherein if a peer to peer message is a queryhit message, said optimizer modifying quality of service parameters of said queryhit message.

17. The optimizer of claim 1 wherein if a peer to peer message is a ping message from a first node, said optimizer creating one or more pong messages to nodes in the same cost class as said first node.

18. The optimizer of claim 17 wherein cost class information for a plurality of nodes is stored in a host cache.

19. The optimizer of claim 1 wherein if a peer to peer message is a connect, and if said connect is better than an existing connection, dropping said existing connection for said connect.

20. The optimizer of claim 3 wherein said cost class information is set by an administrator of said optimizer.

21. The optimizer of claim 3 wherein said cost class information is set by said optimizer.

22. A peer to peer optimizer, said optimizer examining peer to peer messages between nodes within networks connected to said optimizer, for the purpose of determining a cost efficient path for each of said peer to peer messages.

23. The optimizer of claim 22 wherein said optimizer in determining said cost efficient path combines a cost class for each of two nodes to create a path cost.

24. The optimizer of claim 22 wherein if a peer to peer message is not initially directed to said cost efficient path, redirecting said peer to peer message to said cost efficient path.

25. The optimizer of claim 22 wherein if a peer to peer message is not from a node in a first network and is a query message, forwarding said query message to one or more nodes not in said first network.

26. The optimizer of claim 22 wherein if a peer to peer message is from a node in a first network and is a query message and if said query message is unsuccessful, forwarding said query message to a weighted list of nodes in said first network.

27. The optimizer of claim 22 wherein if a peer to peer message is not from a node in a first network and is a query message, ignoring said query message.

28. The optimizer of claim 22 wherein if a peer to peer message is a queryhit message, determining if a matching query message has been observed and if so forwarding said queryhit message to the originator of said matching query message.

29. The optimizer of claim 22 wherein if a peer to peer message is a query message said optimizer determining;

a) if said query is from a node in a first network, determining if said query may be serviced by one or more nodes in said first network, if so, forwarding said query to said one or more nodes in said first network;

or

b) if said query is from a node not in said first network, dropping said query.

30. The optimizer of claim 22 wherein if a peer to peer message is a queryhit message, forwarding said queryhit message to the originator of a matching query message.

31. The optimizer of claim 22 wherein if a peer to peer message is a ping message from a node in a first network dropping said ping message so that it does not propagate from said first network.

32. The optimizer of claim 22 wherein if a peer to peer message is a pong and a matching ping message has not been seen, dropping said pong.

33. The optimizer of claim 22 wherein if a peer to peer message is a ping, said optimizer optionally dropping said ping.

34. The optimizer of claim 33 wherein if said optimizer has not dropped said ping, said optimizer providing a forged pong message.

35. The optimizer of claim 22 wherein if a peer to peer message is a connect, and if said connect is better than an existing connection, dropping said existing connection for said connect.

36. The optimizer of claim 23 wherein said cost class is set by an administrator of said optimizer.

37. The optimizer of claim 23 wherein said cost class is set by said optimizer.

38. The optimizer of claim 22 wherein each peer to peer message is examined to obtain information about the originator of said message.

39. The optimizer of claim 38 wherein said information is stored by said optimizer in a host cache.

40. A process for managing peer to peer messages between and within networks, said process comprising the step of determining a cost efficient path for each of said peer to peer messages.

41. The process of claim 40 further comprising the step of utilizing a message to obtain information about the originator of said message.

42. The process of claim 40 further comprising the step of matching a requested filename filenames stored in a content index.

43. The process of claim 42 further comprising the step of utilizing a content index in determining said cost efficient path.

44. The process of claim 40 further comprising the step of utilizing cost class information to determine said cost efficient path.

45. The process of claim 40 further comprising the step of if a peer to peer message is not initially directed to said cost efficient path, redirecting said peer to peer message to said cost efficient path.

46. The process of claim 40 further comprising the step of modifying a peer to peer message.

47. The process of claim 40 further comprising the step of forwarding a peer to peer message.

48. The process of claim 40 further comprising the step of not forwarding a peer to peer message.

49. The process of claim 40 further comprising the step of creating a new peer to peer message.

50. The process of claim 40 further comprising the step that if said peer to peer message is a query message, forwarding said query message to an optimized set of nodes.

51. A computer readable medium containing instructions for managing peer to peer messages between nodes in networks, said medium comprising instructions for optimizing behavior on said networks.

52. The medium of claim 51 further comprising instructions to utilize path cost information in optimizing behavior.

53. The medium of claim 52 further comprising instructions to derive said path cost information from cost class information.

54. The medium of claim 51 further comprising instructions for redirecting a peer to peer message.

55. The medium of claim 51 further comprising instructions for modifying a peer to peer message.

56. The medium of claim 51 further comprising instructions for forwarding a peer to peer message.

57. The medium of claim 51 further comprising instructions for not forwarding a peer to peer message.

58. The medium of claim 51 further comprising instructions for creating a new peer to peer message.

59. The medium of claim 51 further comprising instructions to determine if a peer to peer message is a query message, and if so, forwarding said query message to an optimized set of nodes.

60. The medium of claim 59 further comprising instructions to implement a content index.

62. The medium of claim 60 further comprising instructions to map content to nodes.

63. The medium of claim 60 further comprising instructions to utilize said content index to limit the number of nodes a query message is forwarded to.

64. The medium of claim 63 further comprising instructions to utilize said content index to determine said optimized set of nodes.

65. The medium of claim 64 further comprising instructions to select said optimized set of nodes based upon path cost.

66. The medium of claim 64 further comprising instructions to determine that if no nodes are found in said content index to satisfy said query message, forwarding said query message to a set of nodes determined by a weighted probabilistic function.

67. The medium of claim 51 further comprising instructions to determine if a peer to peer message is a queryhit message, if so, modifying quality of service parameters of said query hit message.

68. The medium of claim 51 further comprising instructions to determine if a peer to peer message is a ping message from a first node, if so, creating one or more pong messages to nodes in the same cost class as said first node.

69. The medium of claim 53 further comprising instructions for storing said cost class information in a host cache.

70. The medium of claim 51 further comprising instructions to determine if a peer to peer message is a connect, if so, and if said connect is better than an existing connection, dropping said existing connection for said connect.

71. The medium of claim 69 further comprising instructions to permit an administrator to set said cost class information.

72. The medium of claim 69 further comprising instructions to set said cost class information without human intervention.

73. The medium of claim 51 further comprising instructions for determining if a message is from a node in a first network, and instructions for preventing said message from reaching a node in a second network.

80. The medium of claim 51 further comprising instructions for utilizing a message to obtain information about the node from which said message originated.

81. The medium of claim 80 further comprising instructions to populate a host cache with said information.

82. The medium of claim 51 further comprising instructions to determine if a peer to peer message is not initially directed to a cost efficient path, redirecting said peer to peer message to said cost efficient path.

83. A system for optimizing peer to peer messages between nodes within networks, said system comprising a peer to peer optimizer, said system utilizing said optimizer to examine messages between said nodes for the purpose of optimizing behavior on each of said networks.

84. The system of claim 83 wherein said system further comprises means to utilize path cost information in optimizing behavior.

85. The system of claim 84 wherein said system comprises means to derive said path cost information from cost class information.

86. The system of claim 83 further comprising means for redirecting a peer to peer message.

87. The system of claim 83 further comprising means for modifying a peer to peer message.

88. The system of claim 83 further comprising means for forwarding a peer to peer message.

89. The system of claim 83 further comprising means for not forwarding a peer to peer message.

90. The system of claim 83 further comprising means for creating a new peer to peer message.

91. The system of claim 83 further comprising means to determine if a peer to peer message is a query message, and if so, utilizing means to forward said query message to an optimized set of nodes.

92. The system of claim 91 further comprising a content index.

93. The system of claim 92 wherein said content index comprises a mapping of content to nodes.

94. The system of claim 93 wherein said content index is used to limit the number of nodes a query message is forwarded to.

95. The system of claim 93 further comprising means to utilize said content index to determine said optimized set of nodes.

96. The system of claim 95 further comprising means to select said optimized set of nodes based upon path cost.

97. The system of claim 95 further comprising means to determine if any nodes are found in said content index to satisfy said query message, if no nodes were found, utilizing means for forwarding said query message to a set of nodes determined by means of calculating a weighted probabilistic function.

98. The system of claim 83 further comprising means to determine if a peer to peer message is a queryhit message, and if so utilizing means for modifying the quality of service parameters of said query hit message.

99. The system of claim 83 further comprising means to determine if a peer to peer message is a ping message and if so and if said peer to peer message is a ping message from a first node, utilizing means to create and send one or more pong messages to nodes in the same cost class as said first node.

100. The system of claim 99 further comprising cost class information for a plurality of nodes, said cost class information stored in a host cache.

101. The system of claim 83 further comprising means for determining if a peer to peer message is a connect, and if said connect is better than an existing connection, means for dropping said existing connection for said connect.