Routing Mechanism for Distributed Hash Table Based Overlay Networks

• US 20110205949A1
• Filed: 08/27/2008
• Published: 08/25/2011
• Est. Priority Date: 08/27/2008
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Erke, Tuomas, Mäenpää, Jouni
• Application Number:
  US13/060,984
• Publication Number:
  US 20110205949A1
• Time in Patent Office: Days
• US Class Current: 370/311
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• 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/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04W 40/005 Routing actions in the presence of nodes in sleep or doze mode
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 52/0277 according to available power supply, e.g. switching off when a low battery condition is detected
• CPC Class Codes: Y02D 30/70 in wireless communication networks

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.

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.

2. A node according to claim 1, the node being a mobile user terminal.

3. A node according to claim 1 or claim 2, wherein the set of peer nodes are routing neighbour nodes, the node comprising:

a memory for storing a routing table containing, for each routing neighbour node, a mapping between an overlay network address of the node and a physical locator of the node, and parameters in, or associated with, the routing table for each routing neighbour, the parameters including;

power usage parameters indicating a level of power consumption for each of a plurality of operational states, and

a power management status, PMS, parameter indicating a current, or most recently notified, operational state of the routing neighbour; and

a processing unit configured to determine a routing neighbour to forward a message to, based on the power usage parameters and the PMS parameters of the routing neighbours.

4. A node according to claim 3 and being configured to receive a status update message from a routing neighbour indicating that the routing neighbour is about to change its operating state, the status update message including the routing neighbour'"'"'s new PMS parameter for the operating state it is about to enter, the node storing the new PMS parameter in the routing table entry for the routing neighbour.

5. A node according to claim 4 and being configured to determine from the parameters of the routing neighbours in the routing table, if any of the routing neighbours are in a sleep mode, and to store the status update message in the overlay network for later delivery to the sleeping routing neighbour when it changes state out of the sleep mode to an active or restricted mode.

12. A node according to any one of the preceding claims and being configured to access a Radio Resource Control, RRC, state machine to determine operating state information.

13. A node according to claim 12 and being configured for operation in a Wideband Code Division Multiple Access, WCDMA overlay network.

14. A node according to claim 12 or claim 13 and comprising an application running on a native platform of the node for accessing the RRC state machine.

15. A node according to claim 14, wherein the application comprises a vendor-specific application programming interface (API) configured to access the RRC state machine, or a Java application obtained by way of a Java Specification Request (JSR), the Java application enabling access to the RRC state machine.

16. A node according to any one of claims 1 to 11, configured to obtain power usage parameters of a node by reference to a terminal model of the node, and from a web server, or from data provided with a P2P application residing at the node.

17. A node according to claim 16 and configured to determine the model of the terminal by reference to a system property.

18. A node according to any one of the preceding claims, wherein the node is unable to determine the operating state of another peer, the node being configured to set a PMS parameter to ‘

unknown’

in peer protocol messages that it originates.

19. A node according to any one of the preceding claims, wherein the power consumption levels are specified in terms of power usage parameters that include one or more of:

a Sleep Mode Power Usage, SMPU, parameter specifying the power consumption of the node when it is in a power saving, or sleep, mode;

an Active Mode Power Usage, AMPU, parameter specifying the power consumption of the node when it is operating in an active mode; and

a Restricted Mode Power Usage, RMPU, parameter specifying power consumption when the node is operating in a restricted mode,

20. A node according to any one of the preceding claims, wherein the PMS parameter indicates an operational state selected from:

a power saving, or sleeping, state;

an active state;

a restricted state; and

an unknown state.

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.

7. A node according to claim 6, the node being a mobile user terminal.

8. A node according to claim 6 or claim 7 and comprising a memory storing power usage parameters indicative of said power consumption levels, and

a processing unit configured to provide said power usage parameters in peer protocol messages sent to other nodes in the overlay network, and to provide a PMS parameter indicating an operational state that the node is about to enter in a notification sent to other nodes of the network.

9. A node according to claim 8 and being configured to send a status update message to one or more of routing neighbours within said overlay network indicating that it is about to change its operating state, the status update message including the node'"'"'s PMS parameter for the operating state it is about to enter.

10. A node according to any one of claims 6 to 9 further configured to provide information relating to its remaining battery capacity to other nodes of the network.

11. A node according to of claim 10, wherein the remaining battery capacity comprises an indication that if the node remains in an active state it will run out of battery capacity within a certain amount of time.

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.

22. A method according to claim 21, wherein the overlay network employs a distributed hash table, DHT, and wherein the overlay network comprises nodes that maintain routing tables, a routing table containing, for each of a set of routing neighbour nodes in the overlay network, a mapping between an overlay network address of the node and a physical locator of the node, the method further comprising at each of said overlay network nodes:

maintaining parameters in, or associated with, the routing table for each routing neighbour, the parameters including;

power usage parameters indicating a level of power consumption for each of a plurality of operational states, and

a power management status, PMS, parameter indicating a current, or most recently notified, operational state of the routing neighbour.

23. A method according to claim 22, wherein maintaining parameters comprises receiving a status update message from a routing neighbour, the status update message including a PMS parameter specifying the next operational state that the routing neighbour is going to enter, and updating the routing neighbour'"'"'s PMS parameter in, or associated with, its routing table.

24. A method according to claim 22 or claim 23, further comprising checking the PMS status of the routing neighbours and either sending the status update message to a routing neighbour if it is not sleeping, or if it is sleeping storing the message in the overlay network for later delivery to the routing neighbour.

25. A method according to claim 24, wherein storing the status update message in the overlay network comprises checking the PMS status of direct routing neighbours of the sleeping routing neighbour to identify a non-sleeping direct routing neighbour, and sending the status update message destined for the sleeping routing neighbour to the non-sleeping direct neighbour for storage.

26. A method according to claim 25, wherein the non-sleeping direct routing neighbour is about to enter the sleep mode, the method further comprising forwarding the status update message to another non-sleeping direct routing neighbour of the sleeping routing neighbour.

27. A method according to any one of claims 21 to 26, wherein the overlay network operates in a Peer-to-Peer, P2P, network, information relating to the power consumption levels and/or power availability being provided in messages sent between nodes using a peer protocol such as P2PSIP.

28. A method according to any one of claims 21 to 27, wherein selecting a routing neighbour to forward a message to comprises:

determining a set of alternative routing neighbours as next hop peer nodes for a message that is to be routed to a destination peer;

checking the operating state of the next hop peer nodes; and

either

forwarding the message to a next hop peer node if no change of state will be required when the message is sent to that node;

or

checking the power consumption levels of the next hop peer nodes if there are no nodes that will not require a change of state, calculating the increase in power consumption involved in changing state of each of the next hop peers, and forwarding the message to the next hop peer requiring the smallest increase in power consumption.

29. A method according to any one of claims 21 to 28, wherein the DHT operates using a Chord algorithm, or a Kademlia algorithm.

30. A method according to any one of claims 21 to 29, wherein the DHT based overlay network routes messages in a recursive fashion or in an iterative fashion.

31. A method according to any one of claims 21 to 30, wherein the routing neighbours are super peers in a hierarchical overlay network.

32. A method according to any one of claims 28 to 31, wherein the operating states of routing neighbours are specified in terms of PMS parameters that include one or more ‘

unknown’

status parameters, the method comprising;

A) if the set of alternative next hop nodes contains at least one peer in an active mode forwarding the message to one of the peers in active mode; and

B) if the set of alternative next hop nodes contains no peers in the active mode, selecting a peer from among the peers with unknown status having the lowest power consumption in the active mode.