High Level Design | System Design Part - 5

 In the last few parts of the SYSTEM DESIGN SERIES, we have discussed multiple concepts from web servers to databases and load balancing to data replication. 

In this article, we are going to put all our learnings together and see how architecture is developed so far.




Let's try to traverse and see how a  user request reaches down to the database layer and goes back

  • Whenever a user requests for a website [let's say linkedIn.com] it gets a respective IP address of LinkedIn's load balancer from DNS.
  • Users can connect to the load balancer with the given IP address.
  • Loadbalancer routers the user request to either of the webservers based on the availability or load
  • The web server routes the reads operations to the slave database.
  • It routers all the data-modifying operations like write, update, and delete to the master database.

Now we have a solid understanding of how web and data tiers work, Now let's focus on reducing the load/response time for each request.

This can be done by implementing a cache layer in the webservers and we can also shift all the static content like [CSS, images, JavaScript, video files] to the Content Delivery Network (CDN).

An in-depth understanding of Cache and CDN will be explained in upcoming articles.

Comments

Post a Comment

Popular posts from this blog

A complete guide to K-means clustering algorithm

Image
What is K-means Clustering K-Means is a simple and unsupervised machine learning algorithm, Basically, K-Means clustering is nothing but segregating the given data points of the dataset into multiple groups based on similar characteristics and identifying the underlined patterns, here the cluster refers to a collection of data points aggregated together because of certain similarities. K-Means clustering comes under unsupervised machine learning because, we won't be having the target values here, instead we group the data points which are similar in nature Where is the K-means Clustering algorithm used? There are multiple scenarios in the real world, where K-Mean clustering is being used, some of them are movie recommendations and to identify the type of the customer in any organizations Without any further delay, let's dive in understanding how K-Means clustering works  How is the K-means clustering algorithm works Step-1  K-Means clustering will keep few centroids in a rando...
Read more

What is Exploratory Data Analysis? | Part 1

Image
What is EDA (Exploratory Data Analysis) In layman terms, EDA is nothing but going through the dataset, identifying the features, how they are related to each other, and how those features will be helpful for you in identifying the target values Now let us try to understand the textbook definition of EDA in Datascience  Exploratory Data Analysis (EDA) is an approach/philosophy for data analysis that employs a variety of techniques to maximize insight into a data set. Techniques used in EDA   Let us step back for a moment and try to understand how we are deciding whether the mobile is good or not and whether the features might satisfy your needs we will check for RAM / MEMORY / CAMERA / DISPLAY SIZE and many more. and with each one, again we will deep dive and analyze the specifications and whether those are sufficient for our usage  Similar to that even in EDA we have a lot of parameters and techniques to implement and check on our dataset and see whether our dataset is in...
Read more

COMPARABLE VS COMPARATOR

Image
In this article, I will be explaining why java came up with COMPARATOR in the latest versions even though it already has a  COMPARABLE interface You can find small code snippets along the way for better understanding. Let's dive into the article Whenever we are designing the class, we will have some idea of what variables we need to store as part of this class Similarly, if we also know how to sort that object then we will implement the Comparable interface and we will override the compareTo method  In that compareTo method, we will be writing the sort logic whether it should return 1, -1, or 0, and based on that we will sort elements in the objects class Movie implements Comparable < Movie >{   private int id;   private String name;   private int rating;   @Override   public int compareTo (Movie o) {       if ( this .rating < o.rating) return - 1 ;       if ( this .rating > o.rating) retu...
Read more