System for determining an optimal arrangement of servers in a mobile network

• US 20070297344A1
• Filed: 06/21/2006
• Published: 12/27/2007
• Est. Priority Date: 06/21/2006
• Status: Abandoned Application

• Current Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Original Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Inventors: Hartman, Michael James, Kulkarni, Amit Bhavanishankar, Spackmann, Richard Martin
• Application Number:
  US11/471,899
• Publication Number:
  US 20070297344A1
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1031 Controlling of the operation of servers by a load balancer, e.g. adding or removing servers that serve requests
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04W 88/02 Terminal devices
• CPC Class Codes: H04W 88/14 Backbone network devices

Abstract

A system determines an optimal arrangement of servers within a mobile network. The system includes a plurality of nodes of the mobile network. Each node decides whether to become a server by determining whether a cost of accessing a server is greater than a cost of synchronization with another server. The system attains and remains in a stable state by the decisions of each individual node.

Claims

1. A system for determining an optimal arrangement of servers within a mobile network, said system comprising:

a plurality of nodes of the mobile network, each node deciding whether to become a server by determining whether a cost of accessing a server is greater than a cost of synchronization with another server,

said system attaining and remaining in a stable state by the decisions of each individual node.

2. The system as set forth in claim 1 wherein the stable state is a non-optimum state of the network.

3. The system as set forth in claim 2 further including a factor for urging said system from the non-optimum state.

4. The system as set forth in claim 3 wherein said factor operates to remove said system from a state having no servers.

5. The system as set forth in claim 1 further including a new node introduced into the network.

6. The system as set forth in claim 5 wherein said new node decides whether to become a server by determining whether a cost of accessing a server is greater than a cost of synchronization with another server.

7. The system as set forth in claim 6 wherein said system attains and remains in another stable state by the decisions of each individual node and said new node.

8. The system as set forth in claim 7 wherein the other stable state is a non-optimum state of the network.

9. The system as set forth in claim 8 further including a factor for urging said system from the non-optimum state.

10. The system as set forth in claim 9 wherein said factor operates to remove said system from a state having no servers.

11. A computer program product for determining an optimal arrangement of servers within a mobile network, said computer program product comprising:

a first instruction for deciding whether to become a server by each of a plurality of nodes;

a second instruction for determining whether a cost of accessing a server is greater than a cost of synchronization with another server;

a third instruction for performing said second instruction by each of the plurality of nodes; and

a fourth instruction for attaining and remaining in a state determined by said third instruction until a change occurs to the network.

12. The computer program product as set forth in claim 11 wherein the state determined by said third instruction is a non-optimum state of the network.

13. The computer program product as set forth in claim 12 further including a fifth instruction for urging the network from the non-optimum state.

14. The computer program product as set forth in claim 11 further including a fifth instruction for removing the network from a state having no servers.

15. The computer program product as set forth in claim 11 further including a fifth instruction for introducing a new node into the network.

16. The computer program product as set forth in claim 11 further including a fifth instruction for deciding, by a new node, whether to become a server by determining whether a cost of accessing a server is greater than a cost of synchronization with another server.

17. The computer program product as set-forth in claim 16 further including a sixth instruction for attaining and remaining in another stable state by the decisions of each individual node and the new node.

18. The computer program product as set forth in claim 17 wherein the other stable state is a non-optimum state of the network.

19. The computer program product as set forth in claim 11 further including a seventh instruction for urging the network system from the non-optimum state.

20. A method for determining an optimal arrangement of servers within a mobile network, said method comprising the steps of:

deciding whether to become a server by each of a plurality of nodes;

determining whether a cost of accessing a server is greater than a cost of synchronization with another server;

performing said determining step by each of the plurality of nodes;

attaining and remaining in a state determined by said performing step until a change occurs to the network; and

removing the network from a state having no servers.