Low-Step Multi-commodity Flow Emulators
Abstract
References
Index Terms
- Low-Step Multi-commodity Flow Emulators
Recommendations
Greedy distributed optimization of multi-commodity flows
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computingThe multi-commodity flow problem is a classical combinatorial optimization problem that addresses a number of practically important issues of congestion and bandwidth management in connection-oriented network architectures.
We consider solutions for ...
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multi-commodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical background for the problem of MMF and recall its relations with ...
Greedy distributed optimization of multi-commodity flows
The multi-commodity flow problem is a classical combinatorial optimization problem that addresses a number of practically important issues of congestion and bandwidth management in connection-oriented network architectures. We consider solutions for ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- European Research Council
- NSF (National Science Foundation)
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 91Total Downloads
- Downloads (Last 12 months)91
- Downloads (Last 6 weeks)13
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in