Distributed network monitoring and multicommodity flows, a primal-dual approach
From MaRDI portal
(Redirected from Publication:5401423)
Recommendations
- Greedy distributed optimization of multi-commodity flows
- Greedy distributed optimization of multi-commodity flows
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
Cited in
(10)- Traffic monitor deployment in IP networks
- Greedy distributed optimization of multi-commodity flows
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
- Minimizing the total cost of network measurements in a distributed manner, a primal-dual approach
- Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
- The distributed network monitoring model with bounded delay constraints
- Stateless distributed gradient descent for positive linear programs
- Near-optimal disjoint-path facility location through set cover by pairs
- Greedy distributed optimization of multi-commodity flows
- Algorithm for the network flow monitoring set based on primal-dual method
This page was built for publication: Distributed network monitoring and multicommodity flows, a primal-dual approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401423)