2022
DOI: 10.1109/tnsm.2022.3197130
|View full text |Cite
|
Sign up to set email alerts
|

Aquarius—Enable Fast, Scalable, Data-Driven Service Management in the Cloud

Abstract: In order to dynamically manage and update networking policies in cloud data centers, Virtual Network Functions (VNFs) use, and therefore actively collect, networking state information -and in the process, incur additional control signaling and management overhead, especially in larger data centers. In the meantime, VNFs in production prefer distributed and straightforward heuristics over advanced learning algorithms to avoid intractable additional processing latency under highperformance and low-latency networ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 71 publications
0
1
0
Order By: Relevance
“…Each LB agent contains a replay buffer and can learn using 1 of the 3 different RL algorithms-independent SAC (I-SAC), QMix, or single-agent SAC (S-SAC). The 3 RL algorithms consume the network features (on-going flows and flow duration statistics on each server collected based on the framework proposed in [28]) as well as the actions from last time step, and they generate server load state estimations as the next time-step action for making fair per-flow-level decision based on the shortest expected delay algorithm. initial observed instant queue length on server k by the i-th LB: for LB agent i do 13:…”
Section: Marl For Multi-agent Load Balancingmentioning
confidence: 99%
“…Each LB agent contains a replay buffer and can learn using 1 of the 3 different RL algorithms-independent SAC (I-SAC), QMix, or single-agent SAC (S-SAC). The 3 RL algorithms consume the network features (on-going flows and flow duration statistics on each server collected based on the framework proposed in [28]) as well as the actions from last time step, and they generate server load state estimations as the next time-step action for making fair per-flow-level decision based on the shortest expected delay algorithm. initial observed instant queue length on server k by the i-th LB: for LB agent i do 13:…”
Section: Marl For Multi-agent Load Balancingmentioning
confidence: 99%