Prefetching for computing airline routes
Airline route information may be pre-fetched and cached in a routings engine to improve response time of the routings engine to generate routes from an origin to a destination location. For example, a method may include receiving, at a routings engine from an airline reservation system, a request for first airline routes between an origin and a destination based on specified route parameters; storing, by the routings engine, the request in a historical record of requests; fetching, by the routings engine, first airline routes matching the origin, the destination, and the specified route parameters; and pre-fetching, by the routings engine, second airline routes based, at least in part, on the historical record of requests.
1. A method, comprising:
receiving, at a routings engine from an airline reservation system, a request for first airline routes between an origin and a destination based on specified route parameters;
storing, by the routings engine, the request in a historical record of requests;
fetching, by the routings engine, first airline routes matching the origin, the destination, and the specified route parameters; and
pre-fetching, by the routings engine, second airline routes based, at least in part, on the historical record of requests, by:
computing a weighted arithmetic mean for a day of the historical record of requests;
determining an idle time of the routings engine during which a load of the routings engine is below a mean between the total weighted arithmetic mean and a lowest load, and
pre-fetching during the determined idle time of the routings engine.
2. The method of claim 1 , wherein the step of pre-fetching the second airline routes comprises pre-fetching the second airline routes at a scheduled time.
3. The method of claim 2 , wherein the step of pre-fetching the second airline routes further comprises:
identifying a frequency of requests in the historical record of requests;
retrieving schedule information based on the identified frequency; and
determining a busy time of the routings engine during which a load of the routings engine is above a mean between a total weighted arithmetic mean and a highest load.
4. The method of claim 2 , wherein the scheduled time is during a non-peak time range of the routings engine.
5. The method of claim 1 , wherein the step of pre-fetching the airline routes comprises storing the airline routes in a cache.
6. The method of claim 5 , wherein the step of fetching the airline routes comprises:
determining whether the cache stores a response to the request;
when the cache is determined to store a response to the request, fetch, by the routings engine, the first airlines routes from the cache; and
when the cache is determined to not store a response to the request, fetch, by the routings engine, the first airlines routs from a database.
7. A computer program product, comprising:
a non-transitory computer readable medium comprising instructions that, when executed by a processor of a computing system, cause the processor to perform the steps of:
receiving, at a routings engine from an airline reservation system, a request for first airline routes between an origin and a destination based on specified route parameters;
storing, by the routings engine, the request in a historical record of requests;
fetching, by the routings engine, first airline routes matching the origin, the destination, and the specified route parameters; and
pre-fetching, by the routings engine, second airline routes based, at least in part, on the historical record of requests by:
computing a weighted arithmetic mean for a day of the historical record of requests;
determining an idle time of the routings engine during which a load of the routings engine is below a mean between the total weighted arithmetic mean and a lowest load, and
pre-fetching during the determined idle time of the routings engine.
8. The computer program product of claim 7 , wherein the step of pre-fetching the second airline routes comprises pre-fetching the second airline routes at a scheduled time.
9. The computer program product of claim 8 , wherein the step of pre-fetching the second airline routes further comprises:
identifying a frequency of requests in the historical record of requests;
retrieving schedule information based on the identified frequency; and
determining a busy time of the routings engine during which a load of the routings engine is above a mean between a total weighted arithmetic mean and a highest load.
10. The computer program product of claim 8 , wherein the scheduled time is during a non-peak time range of the routings engine.
11. The computer program product of claim 7 , wherein the step of pre-fetching the airline routes comprises storing the airline routes in a cache.
12. The computer program product of claim 11 , wherein the step of fetching the airline routes comprises:
determining whether the cache stores a response to the request;
when the cache is determined to store a response to the request, fetch, by the routings engine, the first airlines routes from the cache; and
when the cache is determined to not store a response to the request, fetch, by the routings engine, the first airlines routs from a database.
13. An apparatus, comprising:
a memory;
a processor coupled to the memory, wherein the processor is further configured to perform the steps of:
receiving, at a routings engine from an airline reservation system, a request for first airline routes between an origin and a destination based on specified route parameters;
storing, by the routings engine, the request in a historical record of requests;
fetching, by the routings engine, first airline routes matching the origin, the destination, and the specified route parameters; and
pre-fetching, by the routings engine, second airline routes based, at least in part, on the historical record of requests by:
computing a weighted arithmetic mean for a day of the historical record of requests;
determining an idle time of the routings engine during which a load of the routings engine is below a mean between the total weighted arithmetic mean and a lowest load, and
pre-fetching during the determined idle time of the routings engine.
14. The apparatus of claim 13 , wherein the step of pre-fetching the second airline routes comprises pre-fetching the second airline routes at a scheduled time.
15. The apparatus of claim 14 , wherein the step of pre-fetching the second airline routes further comprises:
identifying a frequency of requests in the historical record of requests;
retrieving schedule information based on the identified frequency; and
determining a busy time of the routings engine during which a load of the routings engine is above a mean between a total weighted arithmetic mean and a highest load.
16. The apparatus of claim 14 , wherein the scheduled time is during a non-peak time range of the routings engine.
17. The apparatus of claim 13 , wherein the step of pre-fetching the airline routes comprises storing the airline routes in a cache.
18. The apparatus of claim 17 , wherein the step of fetching the airline routes comprises:
determining whether the cache stores a response to the request;
when the cache is determined to store a response to the request, fetch, by the routings engine, the first airlines routes from the cache; and
when the cache is determined to not store a response to the request, fetch, by the routings engine, the first airlines routs from a database.