Service placement on hosts for a consumer based on their geographic location

Patent metadata

Field	Value
Publication number	US-10015061-B2
Application number	US-201314053984-A
Country	US
Kind code	B2
Filing date	Oct 15, 2013
Priority date	Oct 19, 2012
Publication date	Jul 3, 2018
Grant date	Jul 3, 2018

Abstract

Techniques are provided for service placement on hosts for a consumer based on geographic location The techniques include: determining a geographical location of a consumer; and inputting a topology model of an environment including multiple candidate hosts to support a service required by the consumer, the topology model including: a geographic location of each of resource in the environment; and connectivity details between the resources and between the resources and the consumer. The techniques also include: specifying bounding requirements for a host and/or bounding requirements for a path between the consumer to a host; calculating the distance from a candidate host to the consumer; determining if bounding requirements are met by a candidate host; and ordering candidate hosts that meet bounding requirements by distance.

First claim

We claim:

1. A method, comprising:
determining a geographical location of a consumer;
inputting a topology model of an environment including multiple candidate hosts to support a service required by the consumer, the topology model comprising:
a geographic location of each resource of a plurality of resources in the environment; and
connectivity details between each of the plurality of resources and between each of the plurality of resources and the consumer;

specifying bounding requirements for the candidate hosts and corresponding paths between the consumer and the candidate hosts, wherein the bounding requirements for each of the candidate hosts comprise:
ability to host the service;
storage space; and
processor capacity;

calculating a corresponding geographical distance from each candidate host of the multiple candidate hosts to the consumer;
determining, based upon the corresponding geographical distances, that bounding requirements are met by a subset of the candidate hosts; and
ordering the subset of candidate hosts by the corresponding geographical distances.

2. The method of claim 1 , further comprising:
periodically re-evaluating the geographical position of the consumer to determine the consumer is moving; and
in response to determining that the consumer is moving, iteratively for the new consumer position:
calculating the distance from a candidate host to the consumer;
determining if bounding requirements are met by a candidate host; and
ordering candidate hosts that meet bounding requirements by distance.

3. The method of claim 2 , further comprising applying a velocity vector to the consumer position such that direction and speed are known to determine a next position of the consumer.

4. The method of claim 1 , further comprising building a distance-ordered list of the ordered candidate hosts for selection of one or more hosts for the consumer.

5. The method of claim 1 , wherein the bounding requirements for a path between the consumer and a host further comprise:
propagation delay;
serialization delay;
queue delay;
forwarding delay;
available bandwidth;
minimum latency; and
round trip time.

6. The method of claim 1 , further comprising enabling a service for a consumer on a host based on the ordered candidate hosts.

7. The method of claim 1 , further comprising disabling a service for a consumer on a host based on the ordered candidate hosts.

8. An apparatus, comprising:
a processor;
a non-transitory, computer readable storage medium coupled to the processor; and
logic, stored on the computer-readable storage medium and executed on the processor, for:
determining a geographical location of a consumer;
inputting a topology model of an environment including multiple candidate hosts to support a service required by the consumer, the topology model comprising:
a geographic location of each resource of a plurality of resources in the environment; and
connectivity details between each of the plurality of resources and between each of the plurality of resources and the consumer;

specifying bounding requirements for the candidate hosts and corresponding paths between the consumer and the candidate hosts, wherein the bounding requirements for each of the candidate hosts comprise:
ability to host the service;
storage space; and
processor capacity;

calculating a corresponding geographical distance from each candidate host of the multiple candidate hosts to the consumer;
determining, based upon the corresponding geographical distances, that bounding requirements are met by a subset of the candidate hosts; and
ordering the subset of candidate hosts by the corresponding geographical distances.

9. The apparatus of claim 8 , the logic further comprising logic for:
periodically re-evaluating the geographical position of the consumer to determine the consumer is moving; and
in response to determining that the consumer is moving, iteratively for the new consumer position:
calculating the distance from a candidate host to the consumer;
determining if bounding requirements are met by a candidate host; and
ordering candidate hosts that meet bounding requirements by distance.

10. The apparatus of claim 9 , the logic further comprising logic for applying a velocity vector to the consumer position such that direction and speed are known to determine a next position of the consumer.

11. The apparatus of claim 8 , the logic further comprising logic for building a distance-ordered list of the ordered candidate hosts for selection of one or more hosts for the consumer.

12. The apparatus of claim 8 , wherein the bounding requirements for a path between the consumer and a host further comprise:
propagation delay;
serialization delay;
queue delay;
forwarding delay;
available bandwidth;
minimum latency; and
round trip time.

13. The apparatus of claim 8 , the logic further comprising logic for enabling a service for a consumer on a host based on the ordered candidate hosts.

14. The apparatus of claim 8 , the logic further comprising logic for disabling a service for a consumer on a host based on the ordered candidate hosts.

15. A computer programming product, comprising:
a non-transitory, computer readable storage medium; and
logic, stored on the computer-readable storage medium for execution on a processor, for:
determining a geographical location of a consumer;
inputting a topology model of an environment including multiple candidate hosts to support a service required by the consumer, the topology model comprising:
a geographic location of each resource of a plurality of resources in the environment; and
connectivity details between each of the plurality of resources and between each of the plurality of resources and the consumer;

specifying bounding requirements for the candidate hosts and corresponding paths between the consumer and the candidate hosts, wherein the bounding requirements for each of the candidate hosts comprise:
ability to host the service;
storage space; and
processor capacity;

calculating a corresponding geographical distance from each candidate host of the multiple candidate hosts to the consumer;
determining, based upon the corresponding geographical distances, that bounding requirements are met by a subset of the candidate hosts; and
ordering the subset of candidate hosts by the corresponding geographical distances.

16. The computer programming product of claim 15 , the logic further comprising logic for:
periodically re-evaluating the geographical position of the consumer to determine the consumer is moving; and
in response to determining that the consumer is moving, iteratively for the new consumer position:
calculating the distance from a candidate host to the consumer;
determining if bounding requirements are met by a candidate host; and
ordering candidate hosts that meet bounding requirements by distance.

17. The computer programming product of claim 16 , the logic further comprising logic for applying a velocity vector to the consumer position such that direction and speed are known to determine a next position of the consumer.

18. The computer programming product of claim 15 , the logic further comprising logic for building a distance-ordered list of the ordered candidate hosts for selection of one or more hosts for the consumer.

19. The computer programming product of claim 15 , wherein the bounding requirements for a path between the consumer and a host further comprise:
propagation delay;
seriali

Assignees

• IBM

Inventors

• Bradley Ivor
• Croy Timothy R
• Dinger John E
• Duggan Matthew E
• George Randy
• Graham Trevor

Classifications

• H04L67/1021

  based on client or server locations · CPC title

• H04W4/33

  for indoor environments, e.g. buildings · CPC title

• H04W4/02 Primary

  Services making use of location information · CPC title

• H04W4/026

  using orientation information, e.g. compass · CPC title

• H04W4/027

  using movement velocity, acceleration information · CPC title