remove wrong format symbol
Vu
parent
477576ddca
commit
ade04566de
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Intro to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer) _
|
||||
[Source: Intro to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer)
|
||||
|
||||
Separating out the web layer from the application layer (also known as platform layer) allows you to scale and configure both layers independently. Adding a new API results in adding application servers without necessarily adding additional web servers.
|
||||
|
||||
|
|
|
|||
|
|
@ -35,7 +35,7 @@ The master serves reads and writes, replicating writes to one or more slaves, wh
|
|||
|
||||
|
||||
|
||||
_[Source: Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/) _
|
||||
[Source: Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||||
|
||||
## Disadvantage(s) : master-slave replication
|
||||
|
||||
|
|
@ -47,7 +47,7 @@ _[Source: Scalability, availability, stability, patterns](http://www.slideshare.
|
|||
Both masters serve reads and writes and coordinate with each other on writes. If either master goes down, the system can continue to operate with both reads and writes.
|
||||
|
||||
|
||||
_[Source: Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/) _
|
||||
[Source: Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||||
|
||||
## Disadvantage(s) : master-master replication
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: From cache to in-memory data grid](http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast) _
|
||||
[Source: From cache to in-memory data grid](http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast)
|
||||
|
||||
The application is responsible for reading and writing from storage. The cache does not interact with storage directly. The application does the following:
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
## Cache - Introduction
|
||||
|
||||
|
||||
_[Source: Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html) _
|
||||
[Source: Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html)
|
||||
|
||||
Caching improves page load times and can reduce the load on your servers and databases. In this model, the dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution.
|
||||
|
||||
|
|
|
|||
|
|
@ -2,4 +2,4 @@
|
|||
-------------
|
||||
---
|
||||
|
||||
_[Source: OSI 7 layer model](http://www.escotal.com/osilayer.html) _
|
||||
[Source: OSI 7 layer model](http://www.escotal.com/osilayer.html)
|
||||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Why use a CDN](https://www.creative-artworks.eu/why-use-a-content-delivery-network-cdn/) _
|
||||
[Source: Why use a CDN](https://www.creative-artworks.eu/why-use-a-content-delivery-network-cdn/)
|
||||
|
||||
A content delivery network (CDN) is a globally distributed network of proxy servers, serving content from locations closer to the user. Generally, static files such as HTML/CSS/JSS, photos, and videos are served from CDN, although some CDNs such as Amazon's CloudFront support dynamic content. The site's DNS resolution will tell clients which server to contact.
|
||||
|
||||
|
|
|
|||
|
|
@ -11,7 +11,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q) _
|
||||
[Source: Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q)
|
||||
|
||||
|
||||
A relational database like SQL is a collection of data items organized in tables.
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ isdraft = False
|
|||
## Introduction Domain Name System
|
||||
|
||||
|
||||
_[Source: DNS security presentation](http://www.slideshare.net/srikrupa5/dns-security-presentation-issa) _
|
||||
[Source: DNS security presentation](http://www.slideshare.net/srikrupa5/dns-security-presentation-issa)
|
||||
|
||||
A Domain Name System (DNS) translates a domain name such as [www.example.com](http://www.example.com/) to an IP address.
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q)_
|
||||
[Source: Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q)
|
||||
|
||||
Federation (or functional partitioning) splits up databases by function. For example, instead of a single, monolithic database, you could have three databases: forums,users, and products, resulting in less read and write traffic to each database and therefore less replication lag. Smaller databases result in more data that can fit in memory, which in turn results in more cache hits due to improved cache locality. With no single central master serializing writes you can write in parallel, increasing throughput.
|
||||
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Graph database](https://en.wikipedia.org/wiki/File:GraphDatabase_PropertyGraph.png)_
|
||||
[Source: Graph database](https://en.wikipedia.org/wiki/File:GraphDatabase_PropertyGraph.png)
|
||||
|
||||
|
||||
In a graph database, each node is a record and each arc is a relationship between two nodes. Graph databases are optimized to represent complex relationships with many foreign keys or many-to-many relationships.
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html)_
|
||||
[Source: Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html)
|
||||
|
||||
Load balancers distribute incoming client requests to computing resources such as application servers and databases. In each case, the load balancer returns the response from the computing resource to the appropriate client. Load balancers are effective at:
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@
|
|||
|
||||
|
||||
|
||||
_[Source: Crack the system design interview](http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/)_
|
||||
[Source: Crack the system design interview](http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/)
|
||||
|
||||
In an RPC, a client causes a procedure to execute on a different address space, usually a remote server. The procedure is coded as if it were a local procedure call, abstracting away the details of how to communicate with the server from the client program. Remote calls are usually slower and less reliable than local calls so it is helpful to distinguish RPC calls from local calls. Popular RPC frameworks include [Protobuf](https://developers.google.com/protocol-buffers/) , [Thrift](https://thrift.apache.org/) , and [Avro](https://avro.apache.org/docs/current/) .
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: Wikipedia](https://commons.wikimedia.org/wiki/File:Proxy_concept_en.svg) _
|
||||
[Source: Wikipedia](https://commons.wikimedia.org/wiki/File:Proxy_concept_en.svg)
|
||||
|
||||
A reverse proxy is a web server that centralizes internal services and provides unified interfaces to the public. Requests from clients are forwarded to a server that can fulfill it before the reverse proxy returns the server's response to the client.
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: How to make a multiplayer game](http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/)_
|
||||
[Source: How to make a multiplayer game](http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/)
|
||||
|
||||
TCP is a connection-oriented protocol over an [IP network](https://en.wikipedia.org/wiki/Internet_Protocol) . Connection is established and terminated using a [handshake](https://en.wikipedia.org/wiki/Handshaking) . All packets sent are guaranteed to reach the destination in the original order and without corruption through:
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ isdraft = False
|
|||
|
||||
|
||||
|
||||
_[Source: How to make a multiplayer game](http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/) _
|
||||
[Source: How to make a multiplayer game](http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/)
|
||||
|
||||
UDP is connectionless. Datagrams (analogous to packets) are guaranteed only at the datagram level. Datagrams might reach their destination out of order or not at all. UDP does not support congestion control. Without the guarantees that TCP support, UDP is generally more efficient.
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue