← Back
Home › Systems › Networking and edge

wifi-mesh

home Wi-Fi mesh

eero, 802.11s

SystemTechniques · 3Primitives · 16 wifi-mesh Graph coloringgraphs · medium: Greedy/DSatur colouring for conflict-free assignment such as radio channelsActive queue managementnetworking · medium: RED, CoDel and PIE: drop or ECN-mark early to keep switch and router queues shortMesh routingsignal-processing · medium: Routing in low-power wireless meshes (RPL, Thread, mesh flooding) with link-quality metricsAEAD (AES-GCM, ChaCha20-Poly1305)security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.›Password-authenticated key exchange…security · low: Both sides blind a Diffie-Hellman message with a password-derived group element, so an attacker gets one guess per run and nothing to brute-force offline.›Airtime fairnesssignal-processing · low: Wi-Fi scheduling by airtime instead of packets so slow clients do not starve fast onesBeamformingsignal-processing · low: Phased-array weights that steer radio energy toward a receiver; per-client steering vectorsClient steeringsignal-processing · low: Band and AP steering plus fast roaming (802.11k/v/r) to move clients to the best radiod-ary heapdata-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.›BFS and DFSgraphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.›Fair queuingnetworking · low: Deficit round robin / weighted fair queuing to share capacity among tenants or flowsPacket header parsingnetworking · low: Parse graph state machines for Ethernet, IP, TCP and UDP headers in hardware and softwarePRNGs (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.›Message sequence numbersdistributed · 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".›Bellman ford negative cyclesgraphs · low: Bellman-Ford shortest paths with negative edges and negative-cycle (arbitrage) detectionSparse matrices (CSR)numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.›Constant time codesecurity · low: Writing secret-dependent code without branches or memory lookups on secrets; constant-time compare and selectCsprngsecurity · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough

Similar systems

Share the most building blocks with this one.

enterprise-wlan 50 %