Limited broadcast, peering among DHTs, broadcast put of limited content only

Patent metadata

Field	Value
Publication number	US-9325787-B2
Application number	US-46773709-A
Country	US
Kind code	B2
Filing date	May 18, 2009
Priority date	May 18, 2009
Publication date	Apr 26, 2016
Grant date	Apr 26, 2016

Abstract

In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network.

First claim

What is claimed is:

1. An apparatus, comprising:
a processor, wherein the apparatus is configured for provisioning in a first network in a system of not fully meshed networks, the apparatus being configured to:
receive a distributed hash table (DHT) data transfer message from a sending network, wherein the DHT data transfer message is a GET message and the GET message includes a GET path that points back to a network of origination for the GET message; and
receive a second data transfer message, wherein the second data transfer message is a PUT message, wherein the PUT message includes a pointer identifying a home DHT where content is stored and not the content itself and a PUT path that points back to a network of origination for the PUT message, wherein an identification of a network receiving the PUT message is added to the PUT message such that the PUT message includes a changeable network path from a receiving network to a network where content associated with the PUT message is stored.

2. The apparatus of claim 1 , wherein a flood-limiting measure includes not generating a PUT message when the content is updated.

3. The apparatus of claim 1 , the apparatus being further configured to:
implement at least one flood-limiting measure that includes appending an identification of a receiving network to the list of the networks that have previously received the GET message such that the GET message is not forwarded to visited networks of the list, wherein the received GET message is forwarded to networks that are not on the list.

4. The apparatus of claim 1 , wherein the PUT message includes a dynamically changeable network path from a receiving network to a network storing content associated with the PUT message.

5. The apparatus of claim 1 , wherein the GET message and PUT message are influenced by a sharing policy.

6. The apparatus of claim 3 , wherein the flood-limiting measure includes not forwarding the GET message on if a hop count in the GET message exceeds a threshold.

7. A method comprising:
receiving a distributed hash table (DHT) data transfer message from a sending network, wherein the DHT data transfer message is a GET message and the GET message includes a GET path that points back to a network of origination for the GET message; and
receiving a second data transfer message, wherein the second data transfer message is a PUT message, wherein the PUT message includes a pointer identifying a home DHT where content is stored and not the content itself and a PUT path that points back to a network of origination for the PUT message, wherein an identification of a network receiving the PUT message is added to the PUT message such that the PUT message includes a changeable network path from a receiving network to a network where content associated with the PUT message is stored.

8. The method of claim 7 , wherein a flood-limiting measure includes not generating a PUT message when the content is updated.

9. The method of claim 7 , further comprising:
implement at least one flood-limiting measure that includes appending an identification of a receiving network to the list of the networks that have previously received the GET message such that the GET message is not forwarded to visited networks of the list, wherein the received GET message is forwarded to networks that are not on the list.

10. The method of claim 7 , wherein the PUT message includes a dynamically changeable network path from a receiving network to a network that stores content associated with the PUT message.

11. The method of claim 9 , wherein the flood-limiting measure includes not forwarding the GET message on if a hop count in the GET message exceeds a threshold.

12. A computer apparatus comprising:
a non-transitory medium bearing instructions executable by a processor for:
receiving, at a component in a subject network, from a sending network in a system of networks that is not fully meshed, a distributed hash table (DHT) data transfer message, wherein the DHT data transfer message is a GET message and the GET message includes a GET path that points back to a network of origination for the GET message; and
receiving a second data transfer message, wherein the second data transfer message is a PUT message, wherein the PUT message includes a pointer identifying a home DHT where content is stored and not the content itself and a GET path that points back to a network of origination for the PUT message, wherein an identification of a network receiving the PUT message is added to the PUT message such that the PUT message includes a changeable network path from a receiving network to a network where content associated with the PUT message is stored.

13. The apparatus of claim 12 , wherein the method is executed by a processor in a gateway component of a DHT.

14. The apparatus of claim 12 , the instructions comprising not generating the PUT message when content is updated.

15. The apparatus of claim 12 , the instructions comprising storing a path back to the content by storing a list of networks visited by the PUT message associated with the content in each DHT visited by the PUT message.

16. The apparatus of claim 15 , the instructions comprising appending to a “visited” list in a received PUT message an identification of a receiving network prior to forwarding the received PUT message on to other networks.

17. The apparatus of claim 16 , the instructions comprising not forwarding the PUT message on to networks appearing in the “visited” list of the PUT message.

18. The apparatus of claim 15 , the instructions comprising not forwarding the PUT message if a hop count in the PUT message exceeds a threshold.

Assignees

• Tian Jining
• Medved Jan
• Davie Bruce Stuart
• Cisco Tech Inc

Inventors

• Tian Jining
• Medved Jan
• Davie Bruce Stuart

Classifications

• H04L67/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 title

• H04L67/104 Primary

  Peer-to-peer [P2P] networks · CPC title

• H04L45/32

  Flooding (denial of service attacks H04L63/1458) · CPC title

• H04L67/1091

  Interfacing with client-server systems or between P2P systems · CPC title

• H04L67/107

  with limitation or expansion of the discovery scope · CPC title