An Analysis of Hierarchical Software-Defined Network Control Plane: A Reliability Approach
Bibliographic record
Abstract
Present-day computer systems have drastically transformed from the ones in days of basic file sharing, peripheral sharing or the hosting of companywide applications on a server to much more sophisticated, small and faster systems. These systems have further expanded to include cloud-based networks, virtualized desktops, servers, etc. The capabilities of evolving heterogeneous computer systems require advanced control plane. Software-defined networking (SDN) proposes to control the network from a centralized controller instead of a distributed configuration. SDN makes it easier for network operators to evolve network capabilities. Even though SDN proposes a logically centralized system, the controllers may not represent a single, centralized device, instead the control plane may consist of logically centralized but physically distributed controllers wherein each controller manages different administrative domains of the network or different parts of the flow space. There are mainly two types of control plane architecture: flat control plane and hierarchical control plane. In this paper, we have analyzed the reliability and availability of the hierarchical SDN control plane. We take into consideration work-load capacities of the controllers, link failures, node failures and controller-end failures to determine the reliability of the system.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".