<title>Novel approach to all-optical packet routing</title>
Bibliographic record
Abstract
A novel approach is proposed to all-optically route packets/datagrams in a core optical network. An encapsulation scheme is designed in which network destination addresses are converted into Cartesian-like addresses specifying a device by its physical location. The scheme is termed Cartesian Optical Routing Environment (CORE) routing. CORE allows the all-optical routing of packets along a serial point-to-point path in a network. Routing decisions are made by bitwise comparing an incoming packet's CORE destination address to the physical address of the local router using simple optical logic that is currently achievable. The comparison has three possible results: destination greater than, less than or equal to the local address. Based on the results of the comparison, the packet is either all-optically switched along the serial point-to-point path, or passed to the electronic component of the local router for further processing. This novel protocol solution is based on earlier work that proposed Cartesian routing as an alternative to IP routing. The optical logic and circuitry required to perform the routing functions are also considered based on the work in reference 2. The proposed scheme is evaluated using network traffic information from the Candian high-speed optical research and education network, CA*net3.
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.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".