Core idea:-
We've integrated the primary phases --> data ingestion, processing, storage & visualisation --> into a single cohesive pipeline.
and have utilised Kinesis, Lambda, Glue & OpenSearch.
Our point of emphasis:-
β‘οΈ We've optimised for non-functional aspects β scalability and performance throughout.
![Diagram for Streaming Analytics](https://private-user-images.githubusercontent.com/78227704/326161117-e18c449f-3511-402f-a324-8d7db755ce38.png?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3MjQwMzQ4MjgsIm5iZiI6MTcyNDAzNDUyOCwicGF0aCI6Ii83ODIyNzcwNC8zMjYxNjExMTctZTE4YzQ0OWYtMzUxMS00MDJmLWEzMjQtOGQ3ZGI3NTVjZTM4LnBuZz9YLUFtei1BbGdvcml0aG09QVdTNC1ITUFDLVNIQTI1NiZYLUFtei1DcmVkZW50aWFsPUFLSUFWQ09EWUxTQTUzUFFLNFpBJTJGMjAyNDA4MTklMkZ1cy1lYXN0LTElMkZzMyUyRmF3czRfcmVxdWVzdCZYLUFtei1EYXRlPTIwMjQwODE5VDAyMjg0OFomWC1BbXotRXhwaXJlcz0zMDAmWC1BbXotU2lnbmF0dXJlPTEwNmQyNWQ5MDQ4NzIxODZlZWI0NmQyZDE3MjdiNjJjNjJkNzJiZWNiNGVjZTkzMTU4ZmVkMjhlYjAyYzZkMWQmWC1BbXotU2lnbmVkSGVhZGVycz1ob3N0JmFjdG9yX2lkPTAma2V5X2lkPTAmcmVwb19pZD0wIn0.nY0dnMM7jyS0aSXm3ZyauZnTBDPlEOcm6GJOOOzZack)
We've utilised Kinesis Data Streams for capturing and storing real-time streaming data
Please make sure to check out this file -->
EnhancedProducer.java
We'll first quickly initialize the producer's configuration
Need to have some crucial parameters like timeouts, maxconnections in place, This will help optimize on kinesis' performance
β
With all the necessary configurations specified, we'll instantiate the producer instance.
β
It'll read data from the telemetry CSV file --> standardising the format, making it suitable for streaming
β
We've then set up ExecutorService to manage multiple threads. Increased concurrency has a direct correlation with increased throughput
β
I've discussed this below in much detail. We've utilised CompletableFuture for making my data ingestion process fully asynchronous to the Kinesis stream.
β
For data integrity/ reliability of the submissions, we'll check the responses β‘οΈ log successful shard IDs / capture error messages for the failed ones
β
As a non-functional enhancement, we'll have some graceful shutdown mechanisms in place, We'll ensure all our tasks are completed by shutting down the Executor Service and Kinesis Producer properly
β
Will continue to monitor metrics and then optimize on / fine-tune the paramaters/ configurations we've set to balance cost, performance plus reliability.
--> π Our data stream must scale automatically whenever there're variations in the workload.
We do not need to manually handle shard capacities, it'll automatically scale based on the influx of streaming data π
So, the ExecutorService we've been using here does enable concurrent execution. --> It allows multiple threads to run in parallel.
If we look at the methods that're provided by ExecutorService ex. submit() & invokeAll() deal with Future objects (Using Future.get() makes the submitting thread to wait/block, until we're through with our computation.)
Red Flag π©:-
It only manages the submission of these tasks asynchronously. The retrieval of results --> that's when we use future.get(), forces the calling thread to wait --> It's a BLOCKING operation
=> A partially asynchronous workflow
We had to quickly transform our approach.
π We anyhow wanted to get a fully asynchronous workflow for sending data to Kinesis.
We could not compromise on the efficiency / responsiveness of the application, as it was crucial for maintaining high levels of throughput we were looking at.
Differentiator => Integrated CompletableFuture
with ExecutorService
Okay, so what I mean here, is that
CompletableFuture
extends our concept of Future here,CompletableFuture
does support dependent operations --> like the actions that trigger upon future's completion. But without blocking the thread (example, thenApply())
I'll use thenApply()
here --> It'll enable us to transform the result without blocking the main thread.
I can now chain tasks, and manage them sequentially. My entire workflow is now fully asynchronous. = βͺοΈ Operational efficient because we've now improved throughput π π
Why did we go with such a heuristic? Why was the factor --> 2 * Number of CPU cores? Why was it not a static thread pool? I'll answer these questions here
A couple of reasons here:-
Reason 1 π Ours is a hybrid workload. It's a mix of CPU-bound & I/O-bound threads
(Check out the code -- it involves both computations plus sending data to Kinesis)
**In such a scenario, I'll advise to go with a factor of 2
***( 2 * the number of available cores)***
--> We're actively engaging all the cores, without overwhelming the system.
So, each CPU would now have two threads to work on:- the CPU-bound, and the I/O Bound ones. Once the I/O bound threads wait for the operations to complete, the cpu could then proceed with the computational operations. π
Reason 2 π Irrespective of the environment we've deployed the application on, our application can quickly adapt to a variety of machines/ VMs, making our application responsive and scalable from the get-go
Reason 3 π We had to save on the infra-costs as well, We're working on the cloud, wherein we'd be charged based on the number of running threads. We do not want too many threads competing for CPU Time --> (We do not want too much context-switching) Neither do we want too less threads means we aren't performant enough.
We're cognizant of the resources we're using --> There should neither be under-utilisation or over-allocation. βοΈ π
--
1 β We were adamant on implementing some sort of error handling mechanisms:-
Point 1 --> Something that assures us that despite of temporary setbacks or transient errors, our application will still be well-equipped to run reliably
β‘οΈ That'll help us maintain a good level of Operational stability + Service continuity π
Point 2 --> Plus a backoff mechanism in place, that progressively increases the time interval between two successive retries
We're basically achieving 3 things here:-A - We're minimizing system workload, we aren't overwhelming our resources B - We're making our application stable --> We'll limit the number of retries allowed, so, even in face of errors, our application would operate reliably (we do not want it to enter into a loop of infinite failures) C - We end up improvising the data consistency and processing, handling errors GRACEFULLY β‘οΈ We're giving errors more time to resolve, by increasing the time interval between two subsequent retries
More so, it's a predictable system behaviour, We have a well-defined retry policy with exponential backoff.
Services we've utilised :- Kinesis Data Firehose + Glue
--> We've used glue as a central metadata repository through data catalog. β‘οΈ Athena can then use this schema information for quering data in s3
Had we used firehose by itself, it would just aid in loading streaming data into S3. β The definitions we've stored in glue actually enhance Athena's querying capabilities
I've shared the Table Definition above, firehose references this definition in glue
1 => We had to weigh in the impact on downstream systems.
This means the processing logic on Lambda shouldn't be too heavy, such that it starts affecting our solution's overall latency. - We don't want bottlenecks.
2 => Plus if our volume of data and frequency of data processing requests is too high, lambda might start getting strained, especially if we're using a lot of lambda's memory or getting too close to the 15 minute cap on Lambda's execution. π©
3 => This also means we're bumping up our memory allocation and compute costs. For complex data transformations, and heavy data analytics, we've got other alternatives that work out better given the use case and viability
Solution π‘:-
So, we decided to have light-weight data processing and validation for lambda, offloading complex data processing logic/transformations to Flink in KDA (More on this subsequently):-
Our intent here was to keep the data processing and transformation logic very light-weight. This would actually align with lambda's stateless model. All of these transformations do not require the state to be retained across operations. None of these demand a stateful context.
Pls check out the CF template for details around this data transformation lambda
--
Lambda is first triggered with a batch of records coming in from KDS -->
Then, it'll deserialise the data -->
We're then performing some initial data validation / cleansing (Validation checks to remove corrupt/irrelevant data points,) -->
Timestamp standardisation to ISO Format -->
Plus, some lightweight data enrichment, Adding metadata 'source' to for traceability downstream -->
logging record's submission, capturing the record ID + metrics/errors -->
Will then assemble the records to be sent to firehose
This transformed data would now be dumped into the S3 bucket, ready for querying through Athena. Hence, we're throug with workflow #1
Now, let's quickly review te non-functional enhancements we've made for this workflow's transformation layer
I'll go component wise here, on the design consideration I've made in this layer
This is quite use-case specific. And involves a latency - throughput tradeoff. However, will be diving deep for better clarity
If we opt for a larger buffer size, it'll delay our delivery rates into S3 (; slightly)
But would be more cost-effective; we're cutting down on the transmission costsπ
π --> We're reducing the number of PUT requests to S3, cause our data is now accumulating in batches
This means --> Buffer Size β Latency in delivery β 1 / costs we'll incur
π --> We're also reducing on our "per-operation overhead". (There'll always be some operational overhead, like disk writes, network calls while data transmission...)
When we're performing batching, I'm effectively "spreading" this fixed overhead across multiple data items π π
π --> We wanted to ensure we're going conservative on CPU time on handling I/O operations. Also, we're cognizant of the API Limits π
I might also crank up the buffer interval to 900 seconds for absolutely low costs. But I'd appreciate the tradeoff, and 360 seconds looks like a good start for me.
Whenever we're dealing with Streaming data solutions, core objective that'll guide our decisions, will be reducing the amount of data transmitted over the network.
Why?
β charges would typically be based on data transfer rates plus data storage rates.
β lower the size of data transmitted --> higher transfer speed --> reduced costs
Hence, used Snappy for compressing the data.
Second, we had to modify the data formats we've used. Shifted to a columnar Parquet format.
I had three things in mind while making this decision :-
1 --> We had to optimise on the query performance. So, when we've got a columnar orientation, it'll help for selectively reading subsets of columns, That are actually needed for the query . This means less data needs to be read from disk, --> Faster Query performance. Awesome!
2 --> Once I reduce the amount of volume scanned during queries, I reduce the costs associated with data analytics π
3 - We'll subsequently have lower storage costs as well, Plus point for cost savings
Okay, so we're pretty good as far as the "data aspects" are concerned. Let's now move on to Error handling! π
π So, firehose automatically configures retries, that's not something we need to take care of.
However, we'll do some partitioning via S3 prefixes such that any failed data deliveries are differentiated from the normal outputs.
We'll use s3 prefixes, just akin to directory structures, helps me logically segment out the error outputs.
--> Faster troubleshooting + recovery π. Records that aren't delivered are segregated plus accessible.
We're already done with Encyption for S3 - using AWS-owned keys, so data at rest is now encrypted. IAM Policies have been locked down, they're resource- and action - specific.
Considerations would change when we're dealing with ingesting heavy volumes of data. We had to adapt the design to ensure it scales up well.
It answers 4 "whys":-
β¨ When I'm using a VPC Endpoint, this means my data would never traverse the public internet, It would be within AWS private network,
--> A - We're not leaving the AWS Private Network, this means any data communication between firehose and VPC Endpoint for S3 won't traverse the public internet --> significant cost savings, because we're working at scale
--> B - This also means that we're preventing any sort of public exposure. So, it does enhance our solution from a security standpoint
--> C - It's a plus point for performance as well, We're eliminating unnecessary hops through the public internet. = Less Latency π
--> D - VPC Endpoint Policies means we've got a tighter granular access control.
In the next revision/ re-iteration, we'd be setting up AWS lambda to send the processed data via firehose to the S3 VPC endpoint. This would be one of the prudent decisions we'll make, wherein we're actually adapting to scaling volumes, while still being cognizant of security plus performance aspects
These are the very typical considerations you'd opt for when looking to scale up. My project "ServerlessChatApp - DynamoWaveChat" - provides a very in-depth explanation on enhancing Lambda from a non-functional standpoint.
β°βͺΌ Went ahead with Provisioned Concurrency for lambda -- We're pre-warming instances to prevent cold starts
We've used the reserved concurrency parameter -- Something we've done for a fair utilisation amongst resources
β°βͺΌ I actually uphold stability and service continuity as one of my driving factors. We've implemented service limiting plus throttling as well.
β°βͺΌ We've integrated AWS X-Ray,
Purpose:- Figuring out potential bottlenecks = improvising on our performance β
β°βͺΌ Plus, some settings around memory allocation and timeouts This helps us prevent excessive running times ---> Optimizing on resource utilisation π
What kind of a value-add does it bring in?
Reason 1 β£ More data = More data processing. As we're adapting to scale, we could not afford leaving these data processing components un-optimised.
β© --> faster execution times and subsequently a better data throughput
Reason 2 β£ If we fine-tune on the resource allocation, we'll cut down on the number of DPUs consumed. This means lesser costs.
Reason 3 β£ As things scale up, so should it's reliability. Retry + Error Handling mechanisms =
A --> data integrity and consistency
B --> Plus, our solution bears the capability to reciver from transient-kind of failures, without our intervention
Just a quick note, we're using Glue more as a Metadata Repository, rather than as something for ETL, And, this is pivotal, because it'll help organise the data and improvise on the efficiency of our query services downstream, It'll leverage this metadat catalog, to parse and understand the structure of the data, that's stored in s3 So, all of our enhancements in this section would be geared towards the enhancing the cataloging capability of glue.
As and when, we'd introduce ETL capabilities utilising glue, we'll revisit and improvise glue from an ETL standpoint as well
1 - We've done some Partitioning schemes in glue -- First, time-based, aligned with the kind of query patterns. We've diversified further into granular partitioning as well, based on the VendorID
What was the reason? We're scanning only sections relevant to the partition
2 - Compression plus columnar storage - already done - This'll help us enhance query performance in Athena. Retrieval becomes easier in a columnar orientation.
3 - For S3, we've implemented some lifecycle policies, transitioning to a cheaper storage class --> Intelligent Tiering . Rest are typical to S# use-cases :- Versioning, KMS encryption etc.
We were planning of implementing something in lines with metadata caching, --> our structure / schema definition won't change frequently. In such a scenario, should we cache this data, such that query services downstream do not need to in turn query the data catalog repetitively for understanding the structure of data, and accordingly understand the structure of data in S3.
We've not got any native caching in Glue, so we'd have to go with something custom-made here.
So, we could have a lambda that pre-fetches the metadata through triggered queries to the catalog, And subsequently store it in either a Redis /Memcached cluster. --> Retrieving Data from an in-momory cache is faster than hitting the catalog for retrieving the specifics around metadata
5 - Another option, we've got is setting up some query result caching in Athena. This will ensure the most frequent query results have been cached. Reducing excution times of queries π
If we would be in a situation wherein the metadat changes quite frequently, we could ingrain some sort of automated schema management. Our current scenario doesn't demand a crawler setup to automatically scan data sources, and automatically update schema definitions in Glue, based on the schemas it has inferred. But, yes, we could definitely set up one. More of a cost and performance tradeoff, I'd say.
-----If we were to amp up Athena , one step further, in terms of organizational efficiency, we'd make use of Workgroups to separate different projects / teams, That'll help us enforce usage controls, and tighten up on the access controls---
The key service we've used here is Kinesis Data Analytics (KDA)
βοΈ This is Workflow #2
As we've mentioned, Streaming data is ingested through Kinesis Data Streams, This ingested data would then be processed by a Flink SQL Application deployed on KDA Studio --- that's Kinesis Data Analytics. Post processing, we've sent our processed data to OpenSearch, for visualisation and analytics of historic data.
I used Flink over SQL. Why? Because Flink excels at extracting real-time insights from streaming data.
So when my equation is = Huge Volumes + Huge Velocity, the answer has to be Flink
Also, whenever we're encountered with eventful processing, some complex computations, Flink wins over SQL
As I've mentioned above, all the complex data processing / heavy data transformations have been offloaded to Flink, It's best for running such kind of stateful computations (They require the state to be retained across operations, hence stateful) on the data as its being streamed in.
Flink is awesome for real-time data processing
β‘οΈ This means it'll help us in performing some complex computations, as data flows through the system
However, once we're done with processing, OpenSearch will be our search and analytics engine FOR HISTORIC DATA
--> It helps us in ACTUALLY EXTRACTING USEFUL INSIGHTS from the processed data + some data visualisation capabilities π
I hail from an Ops team, hence you'll always find a flavour or rather an emphasis on non-functional aspects in my design! π
1 βΎ We decided to incorporate "Parallelism" into our application code. It's basically the number of concurrent tasks, our application is capable of performing. And, we made it auto-scale, that means, it'll adjust dynamically based on the workload requirements, there won't be idle threads neither there would be too much context-switching --> An efficient Resource utilisation βοΈ π
2 βΎ We've implemented logging and monitoring specifically for KDA --> this'll aid in troubleshooting, and recovery. We could accordingly adjeust the volume of logs ingested into CloudTrail, based on our budget considerations.
We actually wanted to have a level of fault-tolerance / data recovery as one of the imperatives we were seeking to achieve.
3 βΎ Went ahead with some checkpointing --> it actually captures the state of the flink application at a given point in time. We can configure andadjust the checkpointing intervals , and min pause --> We would need to ensure that our application remains consistent and functional at all times, however, we shouldn't be introducing unnecessary overhead. Hence, we'll be good from a data recovery standpoint.
4 βΎ Plus, cost alerts and tightened up IAM policies would ensure we're covered in terms of budget considerations plus access security.
I'll quickly discuss this in brief, just to make our discussion more holistic.
β’ I'll start with the data stream configurations, Flink has been configured to continuously read data from our input stream - the kinesis stream. We've set up a Kinesis Connector that'll aid in pulling in data into Flink.
We'll have our data processed and aggregated in real time β‘οΈAs in raw data would then be transformed into something actionable.
β’ --> We'd be calculating some metrics --> like Avg trip durations, Total trip counts/ hour -- something that transforms raw data into something far more actionable, β‘οΈ statistics that actually provide real-time insights into trends and patterns
β’ We decided to go with some Data masking here, We've added a small random variation to the actual latitude-longitude co-ordinates, for the sake of respecting the privacy of the customers --> We're masking the specifics, while still retaining the utility of the data...
β’ Will then direct this processed output data to our OS table.
Okay, so now that we're quite clear with flink's real-time data processing/aggregation capabilities, and how it channelises the output to opensearch, we'll now dive deeper into the Opensearch specifics , and how it's well suited for the context we're in.
I actually had this question. Thought of reasoning this, befor I proceed with the workflow
The three "why's" which defend the choice of OpenSearch to be integrated into our architecture:-
OpenSearch allows for horizontal scaling, this means we could distribute our data across different nodes of a cluster. Plus, it helps us incorporate the concept of sharding
1 - We wanted our architecture to be tolerant to any node failures - this means we're averting potential chances of data loss, As shards would be basically independent partitions of data across nodes, and they've got their replicas as well.
2 - We'll be assured that our workload would be aptly redistributed horizontally. For instance, we're facing a surge in traffic, and we decide to scale up the number of nodes to improve overall capacity and throughput, Opensearch would automatically redistribute the shards across nodes. This means we'd be maintaining our performance, without any significant reconfiguration from our end.
3 - We wanted to speed up our query process --> This means multiple shards could be queried in parallel, reducing query response times. Also, if we've got som replica shards, that'll also enable us to increase our Read Capacity, as search queries could be directed to both primary and replica shards.
I'd say that this actually enables us to pivot on OS's distributed nature π
If we'd be using RDBs, the only option we'd have would be Vertical Scaling, And there'll always be limits to adding power to a server, both practical and physical...
--
β¨ Reason 2 :- Specifically, something we've focussing on :- Near-Real-Time processing - NRT Processing
That's what real-time analytics is all about. --> As soon as data is sent to Opensearch, it should be almost immediately available for querying. I'll explain how it achieves this
The core objective or rather the overarching goal of NRT processing is minimizing the latency between ingestion (the time it's indexed) and searchability (the time this data is ready/visible to search queries.)
This is a super-important availability metric whenever we're designing/ dealing with such real-time analytic solutions.
π First things first, the documents would initially be stored in an in-memory buffer in one of the nodes, --> the index-writer part of OpenSearch
π OS would then periodically commit these buffered documents to the disk for storage purposes β‘οΈ However, it'll first create an inverted index out of this buffered document - We'll call this a segment moving forward
π If we're cognizant of the fact, that freshly indexed documents should be immediately visible to search queries, we need to set a very minimal refrsh interval, In this case, the dafault interval is 1 s, --> This means that OS would refresh its search indices every 1 second --> Such that newly indexed data would be available/ visible to our serach queries.
Okay, so these operations are really lightweight. We're balancing out the performance and resource utilisation aspects in a way, that such backend activities do not hamper our search operations in any way π
π One thing I'd like to highlight here:- If you're striving to amp up on performance, do not accumulate your data in large batches. That's what OS does, It merges small segments into larger ones. Two reasons to support this:- One, we're keeping up with the latency here, as I've mentioned previously as well, newly indexed data would be quickly available or rather searchable for the users. The second point is that, we're reducing the number of segments, the search operations need to scan from = Better performance π
Our key takeaway here --> The key design element here was :- How we'd manage Fast data availability (data freshness) with resource consumption (without overloading the system with too many disk writes)
--
Whenever we're integrating any specific components into our architecture, it's essential to grasp the foundations -- that'll enable us to fine-tune configurations that improvise from a non-functional standpoint π
What do I mean when I say "The document is indexed"?
π The document is first submitted to opensearch. (I've discussed this before, document could be a single trip, a product (it's in a serialised JSON format))
π It'll perform certain steps like splitting the text into several token, filtering down and standardising the tokens (filtering out unnecessary tokens plus conversion to lower case , and yes, this does facilitate consistency in searching)
π --Building an inverted index-- :- It's actually a DS used to store the mapping from content tokens to their location in the documents.
I'll give a quick analogy, It's like an index behind the book, that tells you on which page a certain term can be found. π‘
--
This is something that sets OS apart from it's traditional RDB counterparts.
I'll go a bit deeper here --> traditional dbs require you to define a schema first, before we start inserting data into it. This would include, the structure, the type of data fields, so on and so forth.
This means changing the structure of the schema later or evolving the data model would be way disruptive, not recommended
Okay, so where does Opensearch score brownie points over these rdbs?
A --> Point 1, Opensearch auto-detects the type of field from the first document it encounters. For instance, if it comes across, a field containing something like "2024-05-01", it'll be mapped a date . technical term:- Dynamic Field Mapping π
B --> Point 2, For folks who need flexibility, as far as the data modelling is concerned, it does provide with ample flexibility in the kind of documents that can be indexed. It'll auto-update the the index, this means it'll accomodate any new fields, and accordingly update the index. More on this below π
A quick side note :- Our current use-case, wherein we're extracting data from a telemetry CSV, neither so we need a Glue crawler to automatically update the schema definitions, nor do we need a schema to be generated on the fly, (As of now, we do not have a continuously evolving schema.) But yes, this pointer stays relevant for teams building out log analytic solutions or similar scenarios.
The scenario/ considerations the team would make before going with the "Schema-on-fly" concept in Opensearch?
β Team would then have to weigh in if they're working in a very agile development environment where requirements change too often,
β Second, if they're aiming for ease of use, in cases where the schema hasn't been fully defined upfront
β Or if they're dealing with heteogenous types of dta streamed in from a wide variety of sourcesHowever, I feel that it'll be necessary to weigh in the potential repurcussions on performance/ query complexity issues, and would be advisable to define explicit schemas, as and when it's possible.
β₯ we've chosen a compute - optimised instance type --> Our application is geared towards heavy computation - based workload, as in the flink code comprises complex aggregations, queries, etc. In such a scenario, when you're having stateful computations, that too, on data that's being freshly streamed in, we need to opt for an instance specifically from the c5/ c6 family.
β₯ Scalability plus fault-tolerance ingrained --> We're having two nodes in the OpenSearch Cluster. Aids in both fault-tolerance capabilities, plus incorporates high availability and a better workload distribution, in case we're having a huge volume of influx of processed data from Flink.
β₯ We've made it a point, to have an array of security considerations implemented:-
We'll quickly summarise these:-
1 - We've implemented node-to-node encryption, plus encryption at rest. This means we're prevnting inadvertent data loss, and also preventing data from being intercepted --> preventing unauthorized access. Both data at rest and in transit have been secured π
2 - Plus, the root user / master user, as it's called in OS, has its credentials securley pulled from the AWS Secrets manager. So, we're securing teh root user against any privilege escalation. We've enforced HTTPS to secure the interactions/ communications between clients and OS cluster
3 - When I say, Advanced Security Options has been enabled, --> it means that we're not relying on some external third party user managemenet service, We'll utilise Opensearch's in-built user auth + management features, This means that I'll not be relying on typical enterprise auth systems / identity providers like LDAP or Active directory., Instead, it'll be more of a standalone OS cluster --> a simplified setup, wherein usre would be created / managed / authenticated within the OS dashboard itslef.
I'll take it up with a quick example, Let's assume we've got a scenario, wherein the OS cluster backs a product analytics dashboard, we can then create specific user accounts for different teams, with specific permissions / roles, as the case may be. Long story short, this is a standalone auth system, without inetgrating any external IdPs π‘
Sample visualisation:-
![image](https://private-user-images.githubusercontent.com/78227704/329202244-a149c51b-3999-48d6-a488-8fbe23985612.png?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3MjQwMzQ4MjgsIm5iZiI6MTcyNDAzNDUyOCwicGF0aCI6Ii83ODIyNzcwNC8zMjkyMDIyNDQtYTE0OWM1MWItMzk5OS00OGQ2LWE0ODgtOGZiZTIzOTg1NjEyLnBuZz9YLUFtei1BbGdvcml0aG09QVdTNC1ITUFDLVNIQTI1NiZYLUFtei1DcmVkZW50aWFsPUFLSUFWQ09EWUxTQTUzUFFLNFpBJTJGMjAyNDA4MTklMkZ1cy1lYXN0LTElMkZzMyUyRmF3czRfcmVxdWVzdCZYLUFtei1EYXRlPTIwMjQwODE5VDAyMjg0OFomWC1BbXotRXhwaXJlcz0zMDAmWC1BbXotU2lnbmF0dXJlPTMxZGRmMDZiZTIzYTEzN2E3NjA3NzI0OGNmYmQwZGUzNjA5YWFiMzc4NjJiODQ0ZjUwMzQ0YWMxM2U3NWNiZjUmWC1BbXotU2lnbmVkSGVhZGVycz1ob3N0JmFjdG9yX2lkPTAma2V5X2lkPTAmcmVwb19pZD0wIn0.5_glHZZjtmTAyxY0VWTt4b1MB1A4fq9AXmH2LhIHLWQ)
Thank you so much for accompanying me on my journey!
I'll quickly summarise all that we've built today:-
Ingested data via Kinesis Data Streams
β¬
Transferred to S3 via Firehose
β¬
Managed Schema in Glue
β¬
Enriched plus standardised data via Lambda
β¬
Stored in S3
Flink Application on KDA Studio for real-time processing
β¬
Aggregating the data
β¬
S3 as Durable Data Store
β¬
Visualising the data with OpenSearch
Really appreciate AWS Workshops for their resources and support in this project's development. AWS Workshops.