Get began with Amazon OpenSearch Service: T-shirt dimension your area for log analytics

If you’re spinning up your Amazon OpenSearch Service area, it is advisable to work out the storage, occasion varieties, and occasion depend; determine the sharding methods and whether or not to make use of a cluster supervisor; and allow zone consciousness. Usually, we take into account storage as a tenet for figuring out occasion depend, however not different parameters. On this publish, we provide some suggestions primarily based on T-shirt sizing for log analytics workloads.

Log analytics and streaming workload traits

If you use OpenSearch Service on your streaming workloads, you ship knowledge from a number of sources into OpenSearch Service. OpenSearch Service indexes your knowledge in an index that you simply outline.

Log knowledge naturally follows a time sequence sample, and subsequently a time-based indexing technique (each day or weekly indexes) is really useful. For environment friendly administration of log knowledge, you have to implement time-based index patterns and set retention intervals. You additional outline time slicing and a retention interval for the information to handle its lifecycle in your area.

For illustration, take into account that you’ve a knowledge supply producing a steady stream of log knowledge, and also you’ve configured a each day rolling index and set a retention interval of three days. Because the logs arrive, OpenSearch Service creates an index per day with names like stream1_2025.05.21, stream1_2025.05.22, and so forth. The prefix stream1_* is what we name an index sample, a naming conference that helps group-related indexes.

The next diagram reveals three major shards for every each day index. These shards are deployed throughout three OpenSearch Service knowledge situations, with one duplicate for every major shard. (For simplicity, the diagram doesn’t present that major and duplicate shards are at all times positioned on completely different situations for fault tolerance.)

When OpenSearch Service processes new log entries, they’re despatched to all related major shards and their replicas within the energetic index, which on this instance is simply right this moment’s index as a result of each day index configuration.

There are a number of necessary traits of how OpenSearch Service processes your new entries:

• Complete shard depend – Every index sample could have a D * P * (1 + R) complete shards, the place D represents retention in days, P represents major shards, and R is the variety of replicas. These shards are distributed throughout your knowledge nodes.
• Energetic index – Time slicing signifies that new log entries are solely written to right this moment’s index.
• Useful resource utilization – When sending a _bulk request with log entries, these are distributed throughout all shards within the energetic index. In our instance with three major shards and one duplicate per shard, that’s a complete of six shards processing new knowledge concurrently, requiring 6 vCPUs to effectively deal with a single _bulk request.

Equally, OpenSearch Service distributes queries throughout the shards for the indexes concerned. If you happen to question this index sample throughout all 3 days, you’ll have interaction 9 shards, and wish 9 vCPUs to course of the request.

This may get much more sophisticated once you add in additional knowledge streams and index patterns. For every extra knowledge stream or index sample, you deploy shards for every of the each day indexes and use vCPUs to course of requests in proportion to the shards deployed, as proven within the previous diagram. If you make concurrent requests to a couple of index, every shard for all of the indexes concerned should course of these requests.

Cluster capability

Because the variety of index patterns and concurrent requests will increase, you possibly can rapidly overwhelm the cluster’s assets. OpenSearch Service contains inner queues that buffer requests and mitigate this concurrency demand. You possibly can monitor these queues utilizing the _cat/thread_pool API, which reveals queue depths and helps you perceive when your cluster is approaching capability limits.

One other complicating dimension is that the time to course of your updates and queries is determined by the contents of the updates and queries. As requests are available, the queues are filling on the charge you might be sending them. They’re draining at a charge that’s ruled by the obtainable vCPUs, the time they tackle every request, and the processing time for that request. You possibly can interleave extra requests if these requests clear in a millisecond than in the event that they clear in a second. You should utilize the _nodes/stats OpenSearch API to observe common load in your CPUs. For extra details about the question phases, consult with A question, or There and Again Once more on the OpenSearch weblog.

If you happen to see the queue depths growing, you might be transferring right into a “warning” space, the place the cluster is dealing with load. However in the event you proceed, you can begin to exceed the obtainable queues and should scale so as to add extra CPUs. If you happen to begin to see load growing, which is correlated with queue depth growing, you might be additionally in a “warning” space and may take into account scaling.

Suggestions

For sizing a site, take into account the next steps:

• Decide the storage required – Complete storage = (each day supply knowledge in bytes × 1.45) × (number_of_replicas + 1) × variety of days retained. This accounts for the extra 45% overhead on each day supply knowledge, damaged down as follows:
  • 10% for bigger index dimension than supply knowledge.
  • 5% for working system overhead (reserved by Linux for system restoration and disk defragmentation safety).
  • 20% for OpenSearch reserved area per occasion (section merges, logs, and inner operations).
  • 10% for extra storage buffer (minimizes affect of node failure and Availability Zone outages).
• Outline the shard depend – Approximate variety of major shards = storage dimension required per index / desired shard dimension. Spherical as much as the closest a number of of your knowledge node depend to keep up even distribution. For extra detailed steering on shard sizing and distribution methods, consult with “Amazon OpenSearch Service 101: What number of shards do I want” For log analytics workloads, take into account the next:
  • Really useful shard dimension: 30–50 GB
  • Optimum goal: 50 GB per shard
• Calculate CPU necessities – Really useful ratio is 1.25 vCPU:1 Shard for decrease knowledge volumes. Greater ratios are really useful for bigger volumes. Goal utilization is 60% common, 80% most.
• Select the proper occasion kind – Think about the next primarily based in your nodes:

Let’s take a look at an instance for area sizing. The preliminary necessities are as follows:

• Every day log quantity: 3 TB
• Retention interval: 3 months (90 days)
• Duplicate depend: 1

We make the next occasion calculation.

The next desk recommends situations, quantity of supply knowledge, storage wanted for 7 days of retention, and energetic shards primarily based on the previous pointers.

As with all sizing suggestions, these pointers symbolize a place to begin and are primarily based on assumptions. Your workload will differ, and so your precise wants will differ from these suggestions. Be certain that to deploy, monitor, and regulate your configuration as wanted.

For T-shirt sizing the workloads, an extra-small use case encompasses 10 GB or much less of information per day from a single knowledge stream to a single index sample. A small use case falls between 10–100 GB per day of information, a medium use case between 100–500 GB of information, and so forth. Default occasion depend per area is 80 for a lot of the occasion household. Discuss with the “Amazon OpenSearch Service quotas “ for particulars.

Moreover, take into account the next greatest practices:

Conclusion

This publish supplied complete pointers for sizing your OpenSearch Service area for log analytic workloads, protecting a number of crucial points. These suggestions function a strong start line, however every workload has distinctive traits. For optimum efficiency, take into account implementing extra optimizations like knowledge tiering and storage tiers. Consider cost-saving choices reminiscent of reserved situations, and scale your deployment primarily based on precise efficiency metrics and queue depths.By following these pointers and actively monitoring your deployment, you possibly can construct a well-performing OpenSearch Service area that meets your log analytics wants whereas sustaining effectivity and cost-effectiveness.

In regards to the authors