Please enable JavaScript.

Coggle requires JavaScript to display documents.

CI / CD - Coggle Diagram

- - - - example 1 create order 2 get order
      - Behavior
  - - - 2.1 Anomaly detection
      - Error counts + latency breaches
- - - - In distributed systems, managing user state (e.g. sessions in web applications) requires special attention because sessions may be handled by different nodes.
      - Example: Load Balancer in web applications can use so-called "sticky sessions" to ensure that all requests from a given user are routed to the same node, making it easier to manage session state.
    - - Round Robin
        
        Round Robin is a CPU scheduling algorithm where each process is cyclically assigned a fixed time slot. It is the preemptive version of the First come First Serve CPU Scheduling algorithm.
      - Dynamic algorithm
      - IP hashing
        
        Source IP Hash load balancing uses an algorithm that takes the source and destination IP address of the client and server to generate a unique hash key. This key is used to allocate the client to a particular server. As the key can be regenerated if the session is broken, this method of load balancing can ensure that the client is directed to the same server that it was using previously. This is useful if it’s important that a client should connect to a session that is still active after a disconnection and reconnection.