An adaptive and predictive approach for autonomic multirate multicast networks
Bibliographic record
Abstract
Autonomic communications aim at easing the burden of managing complex and dynamic networks, and designing adaptive, self-turning and self-stabilizing networks to provide much needed flexibility and functional scalability. With the ever-increasing number of multicast applications made recently, considerable efforts have been focused on the design of adaptive flow control schemes for autonomic multicast services. The main difficulties in designing an adaptive flow controller for autonomic multicast service are caused by heterogeneous multicast receivers, especially those with large propagation delays, since the feedback arriving at the source is somewhat outdated and can be harmful to the control operations. To tackle the preceding problem, this article describes a novel, adaptive, and autonomic multicast scheme, the so-called Proportional, Integrative, Derivative plus Neural Network (PIDNN) predictive technique, which consists of two components: the Proportional Integrative plus Derivative (PID) controller and the Back Propagation BP Neural Network (BPNN). In this integrated scheme, the PID controllers are located at the next upstream main branch nodes of the multicast receivers, and have explicit rate algorithms to regulate the receiving rates of the receivers; while the BPNN is located at the multicast source, and predicts the available bandwidth of those longer delay receivers to compute the expected rates of the longer delay receivers. The ultimate sending rate of the multicast source is the maximum of the aforesaid receiving rates that can be accommodated by its participating branches. This network-assisted property is different from the existing control schemes, in that the PIDNN controller can release the irresponsiveness of a multicast flow caused by those long propagation delays from the receivers. By using BPNN, this active scheme makes the control more responsive to the receivers with longer propagation delay. Thus the rate adaptation can be performed in a timely manner, for the sender to respond to network congestion quickly. We analyze the theoretical aspects of the proposed algorithm, show how the control mechanism can be used to design a controller to support multirate multicast transmission based on feedback of explicit rates, and verify this matching using simulations. Simulation results demonstrate that the proposed PIDNN controller avoids overflow of multicast traffic, and performs better than the existing scheme PNN [Tan et al. 2005] and the multicast schemes based on control theory. Moreover, it also performs well in the sense that it achieves high link utilization, quick response, good scalability, high unitary throughput, intra-session fairness and inter-session fairness.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".