Toward a Distributed Control Plane Architecture for Next Generation Routers
Bibliographic record
Abstract
As networks become more and more pervasive and broadband access technologies evolve to provide affordable broadband solutions for both homes and offices, one needs to rethink the architecture design for next generation routers in order to be able to deliver multiple services over high-speed interfaces and perform fast switching capabilities (e.g., multi-petabit). The size and complexity of next generation networks requires a protocol transition from its classical centralized approach to a fully distributed and scalable paradigm. In this paper, we propose a new control plane architecture that is resilient and scalable where we distribute the OSPF/IS-IS, MPLS and BGP protocols using IETF-approved inter-protocol interfaces. In such architecture, forwarding tables will be updated by OSPF, IS-IS, RTM, BGP and MPLS routing protocols distributed onto multiple processors, in the interface cards themselves. We therefore revisit each of these protocols and redraw their implementation within an efficient, scalable, distributed, resilient, and fault tolerant scheme. As a proof of concept, we present the Hyperchip router (PBR1280) that has been built on these grounds and discuss the performance of the proposed distributed architecture. Although some features (e.g., resiliency) still need further development, it is shown that the proposed distributed routing protocol scheme already offers a new generation of routers with significant higher switching capacity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".