Achieving Soft Real-time Guarantees for Interactive Applications in Wireless Mesh Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The use of 802.11-based multi-hop wireless mesh networks for Internet access is extensive and growing. The primary advantages of this approach are ease of deployment and lower cost. However, these networks are designed for web and e-mail applications. Highly interactive applications, such as multiplayer online games and VoIP, with their requirements for low delay, present significant challenges to these networks. In particular, the interaction between real-time traffic and TCP traffic tends to result in either a failure of the real-time traffic getting its needed QoS or the TCP traffic unnecessarily experiencing very poor throughput. To solve this problem we place real-time and TCP traffic into separate queues. We then rate-limit TCP traffic based on the average queue size of the local or remote real-time queues. Thus, TCP traffic is permitted to use excess bandwidth as long as it does not interfere with real-time traffic guarantees. We therefore call our scheme Real-time Queue-based Rate and Admission Control, RtQ-RAC. Extensive simulations using the network simulator, ns-2, demonstrate that our approach is effective in providing soft real-time support, while allowing efficient use of the remaining bandwidth for TCP traffic.
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.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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 it