Blockchain Function Virtualization: A New Approach for Mobile Networks Beyond 5G
Bibliographic record
Abstract
Many of the key enabling technologies of the fifth-generation (5G), such as network slicing, spectrum sharing, and federated learning, rely on a centralized authority. This may lead to pitfalls in terms of security or single point of failure. Distributed ledger technology, specifically blockchain, is currently employed by different applications related to the Internet of Things (IoT) and 5G to address the drawbacks of centralized systems. For this reason, mobile blockchain networks (MBNs) have recently attracted a great deal of attention. To add a transaction to the blockchain in MBNs, mobile or IoT users must perform various tasks like encryption, decryption, and mining. These tasks require energy and processing power, which impose limitations on mobile and IoT users' performance because they are usually battery powered and have a low processing power. One possible solution is to perform the tasks virtually on commodity servers provided by mobile edge computing (MEC) or cloud computing. To do so, all tasks needed to add a transaction to the blockchain can be treated as virtual blockchain functions that can be executed on commodity servers. We introduce a blockchain virtualization framework called blockchain function virtualization (BFV), through which all blockchain functions can be performed virtually by MEC or cloud computing. Furthermore, we describe applications of the BFV framework and resource allocation challenges brought by the BFV framework in mobile networks. In addition, to illustrate the advantages of BFV, we define an optimization problem to simultaneously minimize the energy consumption cost and maximize miners' rewards. Finally, simulation results show the performance of the proposed framework in terms of total energy consumption, transaction confirmation rate, and miners' average profit.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".