Methods, apparatuses, systems, and articles for determining and implementing an efficient computer network architecture

• US 20050138198A1
• Filed: 12/18/2003
• Published: 06/23/2005
• Est. Priority Date: 12/18/2003
• Status: Abandoned Application

• Current Assignee: It Works
• Original Assignee: It Works
• Inventors: May, John H.
• Application Number:
  US10/739,376
• Publication Number:
  US 20050138198A1
• Time in Patent Office: Days
• US Class Current: 709/233
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements
• CPC Class Codes: H04L 69/24 Negotiation of communication capabilities

Abstract

Methods, apparatuses, systems, and articles of the invention are used to enhance the efficiency of a computing environment, and to improve its responsiveness to one or more users. In the invention, queuing of data or computer instructions is avoided since this would detract from best case performance for a network environment. The rate-limiting factor for the network is determined, and all constraints imposed by the rate-limiting factor are determined. Business logic is programmed in modules sufficiently small to avoid queuing of instructions. Data is stored by frequency of access and persistence to increase responsiveness to user requests. Requests for data from a data storage device are fulfilled not only with the requested data, but also additional data which is likely to be requested in the navigational hierarchy of presentations to which the requested data belongs.

Claims

1. A method comprising:

determining a rate-limiting factor of a computing environment including at least one user device, a server, and a data storage device, the rate-limiting factor being at least one of a data rate of a connection between the user device and server, instruction and data processing speed of at least one processor in the server, and data access time required to generate and transmit a data request to the data storage device and receive responsive data from the data storage device at the server;

determining at least one constraint on the user device, server, and/or data storage device based on the rate-limiting factor, the constraints related to the time required to download a presentation with data from the server using the user device, the time required to execute a module by the user device, and the time required for the server to access and retrieve data from the data storage device; and

implementing the user device, server, and/or data storage device to meet the determined constraints.

2. A method as claimed in claim 1 further comprising:

determining a navigational hierarchy of presentations; and

programming the server to retrieve all data associated with a user for the hierarchy of presentations upon a request for the lead presentation of the hierarchy so that such data can be used to populate the presentations of the hierarchy upon request by the user.

3. A method as claimed in claim 1 further comprising:

determining the frequency of access of different classes of data;

determining whether persistence of the data as always dynamic, initially dynamic but later static, or always static;

storing data in the server and data storage device based on the determined frequency of access of different classes of data and the persistence.

4. A method as claimed in claim 1 further comprising:

programming the business logic of the server to have modules sufficiently small in size to be executed in response to a data request from a user of the user device so that the server responds within a predetermined period of time determined to be acceptable to the user.

5. A method as claimed in claim 4 wherein the modules are sufficiently small to be completely executed for a data request at the highest expected frequency of data requests in the network environment.

6. A method as claimed in claim 1 wherein the modules are sufficiently small in terms of the amount of code therein to be completely executed per data request at the highest expected frequency of data requests in the network environment.

7. A method as claimed in claim 1 wherein the server is selected to have a multi-processor configuration.

8. A method as claimed in claim 1 wherein the server uses a plurality of internet protocol (IP) addresses to address data in the data storage device.

9. A method as claimed in claim 8 wherein the server closes connections to the database as soon as the responsive data is received from the data storage device.

10. A method comprising:

determining a navigational structure of presentations; and

programming the server to retrieve all data associated with a user for the determined hierarchy of presentations upon a request for the lead presentation of the hierarchy so that such data can be used to populate the presentations of the hierarchy upon request by the user.

11. A method as claimed in claim 10 wherein at least one of the presentations is a web page.

12. A method as claimed in claim 10 wherein at least one of the presentations comprises a data file.

13. A method as claimed in claim 10 wherein at least one of the presentations comprises a graphics file.

14. A method as claimed in claim 10 wherein at least one of the presentations comprises a sound file.

15. A method as claimed in claim 10 wherein at least one of the presentations comprises a video file.

16. A method comprising:

determining the frequency of access of different classes of data;

determining persistence of the data as always dynamic, initially dynamic but later static, or always static;

storing data in the server and data storage device based on the determined frequency of access of different classes of data and the persistence.

17. A method as claimed in claim 16 wherein at least one of the presentations comprises a web page.

18. A method as claimed in claim 16 wherein at least one of the presentations comprises a data file.

19. A method as claimed in claim 16 wherein at least one of the presentations comprises a graphics file.

20. A method as claimed in claim 16 wherein at least one of the presentations comprises a sound file.

21. A method as claimed in claim 16 wherein at least one of the presentations comprises a video file.

22. A system for use with at least one network, the system comprising:

at least one user device operable by a user to generate a data request;

a server coupled to receive the data request from the user device via the network, and storing business logic in modules sufficiently small to be executed without queuing of instructions to process the data request, the server programmed to refer to a cache or data storage unit (DSU) thereof to obtain the data requested by the user, the data stored in the cache or DSU according to persistence and frequency of access, and if the data is not available in the cache or DSU, the server generating a request for the data of a lead presentation and all presentations in a hierarchy thereunder; and

a data storage device coupled to receive the forwarded data request from the server, and retrieving data responsive to the server, the data including data for a presentation hierarchy including all data that can be accessed by the user for the lead presentation and presentations linked thereunder and providing the same to the server over the network.

23. A system as claimed in claim 22 wherein the server has a multi-processor configuration.

24. A system as claimed in claim 22 wherein the server uses a plurality of internet protocol (IP) addresses to address data in the data storage device to avoid queuing of data requests.

25. A system as claimed in claim 22 wherein the server closes connections to the database as soon as the responsive data is received from the data storage device.

26. An apparatus as claimed in claim 22 wherein the server stores the data retrieved from the data storage device in the cache of the server during a session with the user.

27. An apparatus comprising:

a server having a memory and a data storage unit (DSU), and programmed to store data used by such server amongst the memory and DSU according to frequency of access and persistence of the data.

28. An apparatus as claimed in claim 27 wherein data that is always variable is associated with a variable in the business logic of an application executed by the server, and is not persisted in the memory, DSU, or external data storage system.

29. An apparatus as claimed in claim 27 wherein the memory comprises a cache for storing the data accessed on a relatively high frequency basis.

30. An apparatus as claimed in claim 27 wherein the DSU stores data accessed less frequently than the data stored in the memory.

31. An apparatus as claimed in claim 27 wherein data that is accessed on a low frequency basis is stored in an external data storage unit.

32. An apparatus as claimed in claim 27 wherein the business logic modules executed by the server are sufficiently small so as to be executable in a time period sufficiently small to avoid queuing of threads for execution.

33. An apparatus as claimed in claim 27 wherein the business logic module generates a request for all data in a presentation hierarchy to an external data storage device in response to a user request for a lead presentation in the hierarchy.

34. An apparatus as claimed in claim 27 wherein the server receives credential data from a user of a user device over a network, and transmits the credential data to an external data storage device to identify a user profile having data related to the user.

35. A data storage device comprising:

a data storage unit storing data in at least one user profile, the data associated with an index identifying a presentation hierarchy to which the data belongs, and at least one variable name identifying a field of the respective presentation for population with the data.

36. A data storage device as claimed in claim 35 further comprising:

a processor coupled to the data storage unit, the processor responsive to an external request for data and retrieving the requested data and additional data included in the corresponding presentation hierarchy, the processor responding to the external request for data by providing the requested and additional data.

37. A data storage device as claimed in claim 36 wherein the external request is generated by a server and received by the processor from such server over a communications network.

38. A data storage device as claimed in claim 36 wherein all additional data included in the corresponding presentation hierarchy is retrieved by the processor from the data storage unit in response to the external request.

39. A data storage medium storing data in accordance with the frequency of access and persistence of the data.

40. A data storage medium as claimed in claim 39 wherein the data is selectively stored in the data storage medium in dependence upon whether the data is accessed on a low, medium, or high frequency basis.

41. A data storage medium as claimed in claim 39 wherein the data storage medium is a cache that stores data accessed on a high frequency basis.

42. A data storage medium as claimed in claim 39 wherein the data storage medium is a data storage unit (DSU) that stores data accessed on a medium frequency basis.

43. A data storage medium as claimed in claim 39 wherein the data storage medium is a data storage device storing data accessed on a low frequency basis.

44. A data storage medium as claimed in claim 39 wherein the persistence of the data includes dynamic, static, and initially dynamic and later static.

45. A data storage medium as claimed in claim 39 wherein the data storage medium stores data that is static.

46. A data storage medium as claimed in claim 39 wherein the data storage medium stores data that is initially variable, but does not store the data when it becomes fixed.

47. A data storage medium as claimed in claim 39 wherein the data storage medium stores data that was initially variable, but has become fixed.

48. A data storage medium as claimed in claim 39 wherein the data storage medium stores data that is dynamic.

49. A processor-readable medium storing data in at least one user profile, the data associated with an index identifying a presentation hierarchy to which the data belongs, and at least one variable name identifying a field location of the respective presentation for population with the data.

50. A processor-readable medium as claimed in claim 49 wherein the presentation hierarchy comprises at least one web page.

51. A method as claimed in claim 49 wherein at least one of the presentations comprises a data file.

52. A method as claimed in claim 49 wherein at least one of the presentations comprises a graphics file.

53. A method as claimed in claim 49 wherein at least one of the presentations comprises a sound file.

54. A method as claimed in claim 49 wherein at least one of the presentations comprises a video file.

55. A processor-readable medium storing a computer program executable by a processor to respond to a request for data by retrieving the requested data and additional data included in a presentation hierarchy containing the requested data, the processor responding to the request for data by providing the requested data and additional data.

56. A processor-readable medium as claimed in claim 55 wherein the request is generated by a server and received by the processor from the server over a communication network.

57. A processor-readable medium as claimed in claim 55 wherein the computer program is executable by the processor to determine an index corresponding to the requested data, and to use the index to retrieve all data for the presentation hierarchy associated with the index.

58. A processor-readable medium as claimed in claim 55 wherein the presentation hierarchy comprises at least one web page.

59. A method as claimed in claim 55 wherein at least one of the presentations comprises a data file.

60. A method as claimed in claim 55 wherein at least one of the presentations comprises a graphics file.

61. A method as claimed in claim 55 wherein at least one of the presentations comprises a sound file.

62. A method as claimed in claim 55 wherein at least one of the presentations comprises a video file.