SIGN IN
SIGN UP
Quorum placement in networks: minimizing network congestion
Full Text:
Pdf
Buy this Article
Authors:
Daniel Golovin
Carnegie Mellon University, Pittsburgh, PA
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Bruce M. Maggs
Carnegie Mellon University, Pittsburgh, PA and Akamai Technologies, Cambridge, MA
Florian Oprea
Carnegie Mellon University, Pittsburgh, PA
Michael K. Reiter
Carnegie Mellon University, Pittsburgh, PA
2006 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Downloads (cumulative): 258
· Citation Count: 4
Published in:
· Proceeding
PODC '06
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Pages 16 - 25
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-384-0
doi>
10.1145/1146381.1146388
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
approximation algorithms
congestion problems
distributed applications
lp rounding
performance
quorum systems
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder