Application Layer Routing Options for efficient data transport over the Internet
Bibliographic record
Abstract
Most file transfer architectures are based on the conventional client server paradigm with the Internet providing the interconnect infrastructure. In order to avoid/control traffic congestion, the most common scenario is that the server effectively throttles back its transmission when congestion is inferred. In this paper, we propose an alternative mechanism, Application Layer Routing Options (ALRO), to improve the transport of large-size files over the Internet. In our approach, the server will not throttle back its transmission when congestion is inferred, instead, it will reroute the flow of packets along an alternative route. This alternative route is constructed through a "relay router or server", which is a prototype function implemented at a known host dedicated to redirecting the data stream. The proposed mechanism is implemented through a UDP-based application level file transfer protocol and the performance is tested on the Internet through experiments using only one relay server. The underlying file transfer protocol denoted by UFTP already improves latency on the Internet with improvements often on the order of 10 to 20 times over the traditional file transfer protocol FTP. The experimental results presented here show that ALRO combined with UFTP attempts to balance the network load when congestion is inferred while still obtaining high-speed file transferring. The objective of this paper is to investigate ways in which the network and its topology itself can be more efficiently utilized.
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".