Routing Mechanism for Distributed Hash Table Based Overlay Networks
First Claim
Patent Images
1. A node for use within an overlay network and comprising a decision unit for making a routing decision based upon a knowledge of the power consumption levels and/or power availability of a set of peer nodes in the overlay network.
1 Assignment
0 Petitions
Accused Products
Abstract
A node for use within an overlay network, such as a Distributed Hash Table based overlay network, and which is configured to route packets across the overlay network. The node comprises means for making a routing decision based upon a knowledge of the power consumption levels and/or power availability of a set of peer nodes in the overlay network.
-
Citations
32 Claims
- 1. A node for use within an overlay network and comprising a decision unit for making a routing decision based upon a knowledge of the power consumption levels and/or power availability of a set of peer nodes in the overlay network.
- 6. A node for use within an overlay network and being configured to provide power consumption levels for each of a plurality of operational states of the node to other nodes in the overlay network, and to notify one or more peer nodes in the network of an impending change in operational state of the node.
- 21. A method of making a routing decision at a routing node of an overlay network, the method comprising selecting one or more of a set of peer nodes in the overlay network to forward a message to based upon a knowledge of the power consumption levels and/or power availability of the peer nodes.
Specification