 |
For future work, it would be more practical to have a
complex reward function returning multiple values as opposed
to -1 or +1. In doing so, we will be able to theoretically
determine the rate of congestion, and which links have the
worst congestion based on rewards as currently congestion is
binary. Furthermore, this environment specifically focuses on
re-routing one TCP stream, which at the same time can be
scaled which should be explored further. As this algorithm
was engineered with the mindset of the core data center, this
algorithm can run one TCP-CA/RL algorithm per leaf switch,
and look at TCP statistics from all flows which are considered
high priority that are leaving the switch. In doing so, re-routing
will be done locally, whilst allowing for easy scaling.
|
IEEE/ICACT20210131 Slide.15
[Big Slide]