← Back
Home › Systems › Telecom

telecom-oss

network inventory, service orchestration and assurance: inventory graph, YANG/NETCONF orchestration, fault correlation, TM Forum APIs

Amdocs, Netcracker, Ericsson, Nokia

SystemTechniques · 30Primitives · 89 telecom-oss DAG workflow executiondistributed · medium: Run a graph of dependent tasks by releasing each one when its inputs are done, longest chain first, and skip any task whose input hashes are unchanged.›Desired-state reconciliationdistributed · medium: Declare the target in a store; controllers repeatedly diff actual against desired from full state and apply idempotent fixes, so missed events only delay convergence.›Deterministic simulation testingdistributed · medium: Run the whole system in one thread under a seeded scheduler with simulated network, disk and clock, so every failure replays from its seed.›Durable workflow executiondistributed · medium: Ordinary code made crash-proof by logging every side-effect result and replaying the code from that log; activities run at least once, workflow logic must be deterministic.›Partitioned commit logdistributed · medium: A topic split into replicated append-only partitions: key hash keeps per-key order, offsets give position, and a high watermark limits readers to fully replicated records.›Primary-backup replicationdistributed · medium: One node orders all writes and ships them to standbys; the acknowledgement rule (none, one, all) sets what a crash loses, and an external arbiter decides who takes over.›Saga patterndistributed · medium: Split a cross-service operation into local transactions, each paired with an undo; on failure run the undos in reverse, or retry forward.›Dijkstra's algorithmgraphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.›Event deduplication windowdistributed · low: Keep the ids of recently accepted events for a time window and drop repeats; memory stays bounded by rotating time buckets instead of per-entry timers.›Hdr histogramdata-structures · low: Log-linear bucketed histograms with bounded relative error for latency percentilesProcess supervisionhardware-os · low: A parent process starts services, reaps their exits and restarts them under a delay and burst-limit policy, then stops them with SIGTERM before SIGKILL.›Gnmi streaming telemetrynetworking · low: gNMI subscribe streams (on-change, sample) over gRPC for structured device telemetryNetconf config transactionnetworking · low: NETCONF candidate datastore, validate, commit-confirmed and rollback for transactional device configurationYang data modelingnetworking · low: YANG schemas for configuration and state with leafrefs, constraints and generated APIsMutual TLSsecurity · low: TLS where the client also proves a certificate key, so every connection carries a verified, rotatable machine identity.›OAuth 2 and OpenID Connectsecurity · low: Delegated authorization (OAuth 2) and login on top of it (OIDC); use authorization code + PKCE for every user-facing client.›Row-level security (multi-tenant is…security · low: Append a policy predicate to every query inside the database, so a forgotten WHERE tenant_id = ? in application code cannot leak another tenant's rows.›Closure tablestorage · low: Storing trees and hierarchies in relational tables (closure table, materialized path) for fast subtree queriesIndex-free adjacencystorage · low: Store each node's edges as direct references to neighbouring records, so a hop costs O(degree) pointer reads instead of an index search; know when plain tables or CSR beat it.›Graceful drainingsystems · low: On a termination signal, stop taking new work, finish in-flight work until a deadline, tell clients to reconnect elsewhere, then exit; clients resume from a token.›Publish subscribe event bussystems · low: In-process or on-box topic bus decoupling producers and consumers with bounded queuesTopological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Content-addressed storagestorage · low: Store each blob under the hash of its bytes: immutable, deduplicated by construction, self-verifying on every read, and composable into Merkle trees.›+ 23 more techniques+ 73 more primitives

Similar systems

Share the most building blocks with this one.

hris 34 %incident-management 28 %crm 27 %trade-promotion-management 26 %ingestion 26 %

In-house systems

Named systems of this kind at large companies, with their paper or write-up.

ECOMP (open-sourced as ONAP)AT&T