| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20260302 Slide.14
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
For bandwidth allocation, we use a dynamic Weight Update Algorithm. The principle is simple: If there is available bandwidth, we prioritize draining the cache. If the link is congested, we allocate weights fairly based on the number of flows in each sub-cache. This ensures fairness between different streams sharing the same interface. If backpressure limits, we strictly enforce the output limit. | |
| [Go to Next Slide] |