Following steps
- BIOS (Basic input and output system)
 - MBR (Master boot record)
 - GRUB (Grand unified boot loader)
 - Kernel
 - Init
 - Runlevel program
 
| {"lastUpload":"2021-06-05T05:53:58.253Z","extensionVersion":"v3.4.3"} | 
Containers
For establishing BGP connections between each Host and its corresponding leaf (router), we can advertise loopback IPs of Host to their respective Routers.
Create 2 VRFs and add required hosts on each of them, use these commands on Spine - R4,
# net add vrf vrf-1 vrf-table auto
| { | |
| "id": "basic-5", | |
| "cmd": "while [ true ] ; do echo 'Hello KKKK' ; sleep 5 ; done", | |
| "cpus": 0.1, | |
| "mem": 10.0, | |
| "instances": 1, | |
| "labels":{ | |
| "traefik.enable": "true", | |
| "traefik.http.routers.router0.rule": "Host(`192.168.100.242:80`)" | |
| } | 
Namespaces are a kernel mechanism for limiting the visibility that a group of processes has of the rest of a system.
The purpose of namespaces is to wrap a particular global system resource in an abstraction that makes it appear to the processes within the namespace that they have their own isolated instance of the global resource.
For example - you can limit visibility to certain process trees, network interfaces, user IDs or filesystem mounts.
namespaces were originally developed by Eric Biederman, and the final major namespace was merged into Linux 3.8.
BGP configuration among 3 nodes(R1,R2,R3) and 1 router(R4):
Ubuntu + FRR
VMs' configuration:
| Host | adapter | IP/mask | 
|---|---|---|
| R1 | enp0s3 | 
10.5.1.2/30 | 
| R2 | enp0s3 | 
10.5.1.6/30 | 
Aerospike uses certain standards and techniques for the data replication among its nodes.
The Aerospike Data Migration module intelligently balances data distribution across all nodes in the cluster, ensuring that each bit of data replicates across all cluster nodes and datacenters. This operation is specified in the system replication factor configuration.
Each node uses a distributed hash algorithm to divide the primary index space into data slices and assign owners. Each primary key is hashed into a 160-byte digest using the RipeMD160 algorithm.
Data Distribution Diagram: