Electronic implementation of optical burst switching techniques
Bibliographic record
Abstract
Extensive research effort is ongoing in energy-efficient Internet-based communications. Optical Flow Switching (OFS) and Optical Burst Switching (OBS) offer potentially efficient alternatives to IP-router-based networks for large data transactions, but significant challenges remain. OFS requires each user to install expensive core network technology, limiting application to highly specialized nodes. OBS can achieve higher scalability but burst assembly/disassembly procedures reduce power efficiency. Finally both OFS and OBS use all-optical switching technologies for which energy efficiency and flexibility remain subject to debate. Our study aims at combining the advantages of both OBS and OFS while avoiding their shortcomings. We consider using a two-way resource reservation protocol for periodic concatenations of large (e.g. 1 Mb) packets or Media Frames (MFs). These chains of MFs (MFCs) are semi-transparent with a periodicity referred to as the “transparency degree”. Each MFC is assembled and stored at an end-user machine during the resource reservation procedure and is then switched and buffered electronically along its path. The periodic configuration of each MFC enables interleaving of several chains using buffering only to align the MFs in each MFC in time, largely reducing the buffer requirements with respect to OBS. This periodicity also enables a simple scheduling algorithm to schedule large transactions with minimal control plane processing, achieving link utilization approaching 99.9%. In summary, results indicate that implementing optical burst switching techniques in the electronic domain is a compelling path forward to high-throughput power-efficient networking.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".