← Back
Home › Systems › Networking and edge

bgp-router

internet routing daemon

BIRD, FRR

SystemTechniques · 1Primitives · 10 bgp-router Link state routingnetworking · medium: OSPF/IS-IS link-state flooding and SPF route computationDijkstra's algorithmgraphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.›Longest prefix matchnetworking · low: IP prefix lookup structures (DIR-24-8, Poptrie, LC-trie) for routes, ACLs and geo-IPRadix triedata-structures · low: Compressed prefix tree for path routing, domain matching and prefix lookupsBfdnetworking · low: Bidirectional Forwarding Detection: sub-second link/path failure detection with tight hello timersBgpnetworking · low: BGP sessions, UPDATE messages, path attributes and best-path selectionEcmpnetworking · low: Equal-cost multipath: hash flows across next hops; resilient hashing on changesRpki route origin validationnetworking · low: RPKI ROAs and route origin validation to reject hijacked BGP announcementsMessage 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".›IP multicastnetworking · 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.›d-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.›

Similar systems

Share the most building blocks with this one.

ip-backbone 39 %sd-wan 17 %network-os 16 %