mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Networking and edge
sd-wan
software-defined WAN
Cisco SD-WAN
System
Techniques · 5
Primitives · 23
sd-wan
Config distribution
distributed · medium: A control plane pushes versioned resource changes over long-lived streams; each node validates, ACKs or NACKs and keeps its last good copy, so a bad change stops at a canary.
›
Active queue management
networking · medium: RED, CoDel and PIE: drop or ECN-mark early to keep switch and router queues short
Link state routing
networking · medium: OSPF/IS-IS link-state flooding and SPF route computation
Watch notifications
distributed · medium: A store numbers every write; clients list at revision R, then watch from R+1 and receive an ordered change stream with no gap, no duplicate, and a resume point.
›
MVCC
storage · medium: Keep timestamped versions of each row so readers see a consistent snapshot without blocking writers; the default concurrency control in modern databases.
›
Fair queuing
networking · low: Deficit round robin / weighted fair queuing to share capacity among tenants or flows
Content defined chunking
compression · low: Rolling-hash chunk boundaries (Rabin, FastCDC) for deduplication that survives insertions
Active path probing
networking · low: Continuous loss/latency/jitter probes per WAN path to drive path selection
Bfd
networking · low: Bidirectional Forwarding Detection: sub-second link/path failure detection with tight hello timers
Bgp
networking · low: BGP sessions, UPDATE messages, path attributes and best-path selection
Deep packet inspection
networking · low: Classify flows by payload/SNI/protocol signatures for application-aware policy
Packet encapsulation
networking · low: IP-in-IP, GRE, GUE, VXLAN and Geneve tunnelling headers and MTU effects
Ipsec esp
security · low: IPsec ESP tunnels with IKEv2 key exchange and anti-replay
X509 certificates
security · low: Certificate chains, path validation, SANs, revocation and short-lived issuance
Forward error correction
signal-processing · low: Add redundancy (LDPC, Reed-Solomon, XOR parity) so receivers repair loss without retransmit
Delta encoding
compression · low: Store differences between consecutive values instead of the values, turning sorted IDs, timestamps and counters into small numbers that pack into few bits.
›
Message sequence numbers
distributed · low: A per-stream counter on every message lets the receiver detect loss, duplicates and reordering, ack cheaply and resume after reconnect with "send from N".
›
Grpc protocol
networking · low: GRPC framing over HTTP/2: unary and streaming RPCs, deadlines, status
Packet header parsing
networking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and software
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
+ 7 more primitives
System
Techniques · 5
Primitives · 23
sd-wan
Config distribution
distributed · medium: A control plane pushes versioned resource changes over long-lived streams; each node validates, ACKs or NACKs and keeps its last good copy, so a bad change stops at a canary.
›
Active queue management
networking · medium: RED, CoDel and PIE: drop or ECN-mark early to keep switch and router queues short
Link state routing
networking · medium: OSPF/IS-IS link-state flooding and SPF route computation
Watch notifications
distributed · medium: A store numbers every write; clients list at revision R, then watch from R+1 and receive an ordered change stream with no gap, no duplicate, and a resume point.
›
MVCC
storage · medium: Keep timestamped versions of each row so readers see a consistent snapshot without blocking writers; the default concurrency control in modern databases.
›
Fair queuing
networking · low: Deficit round robin / weighted fair queuing to share capacity among tenants or flows
Content defined chunking
compression · low: Rolling-hash chunk boundaries (Rabin, FastCDC) for deduplication that survives insertions
Active path probing
networking · low: Continuous loss/latency/jitter probes per WAN path to drive path selection
Bfd
networking · low: Bidirectional Forwarding Detection: sub-second link/path failure detection with tight hello timers
Bgp
networking · low: BGP sessions, UPDATE messages, path attributes and best-path selection
Deep packet inspection
networking · low: Classify flows by payload/SNI/protocol signatures for application-aware policy
Packet encapsulation
networking · low: IP-in-IP, GRE, GUE, VXLAN and Geneve tunnelling headers and MTU effects
Ipsec esp
security · low: IPsec ESP tunnels with IKEv2 key exchange and anti-replay
X509 certificates
security · low: Certificate chains, path validation, SANs, revocation and short-lived issuance
Forward error correction
signal-processing · low: Add redundancy (LDPC, Reed-Solomon, XOR parity) so receivers repair loss without retransmit
Delta encoding
compression · low: Store differences between consecutive values instead of the values, turning sorted IDs, timestamps and counters into small numbers that pack into few bits.
›
Message sequence numbers
distributed · low: A per-stream counter on every message lets the receiver detect loss, duplicates and reordering, ack cheaply and resume after reconnect with "send from N".
›
Grpc protocol
networking · low: GRPC framing over HTTP/2: unary and streaming RPCs, deadlines, status
Packet header parsing
networking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and software
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
IP multicast
networking · low: Send each datagram once to a class D group address; the network copies it to every joined receiver, and sequence numbers let receivers find loss.
›
Longest prefix match
networking · low: IP prefix lookup structures (DIR-24-8, Poptrie, LC-trie) for routes, ACLs and geo-IP
Bit packing and PFOR
compression · low: Store blocks of integers with exactly b bits each and patch rare outliers separately (PFOR); the fastest integer codec family, billions of values per second.
›
Varint (LEB128)
compression · low: Variable-length integers in 7-bit groups with a continuation bit; small numbers take 1 byte, the wire format of Protobuf, WebAssembly and DWARF.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
ip-backbone
20 %
enterprise-wlan
18 %
bgp-router
17 %