skip to main content
research-article

Resource-Competitive Algorithms

Published: 01 September 2015 Publication History

Abstract

The point of adversarial analysis is to model the worst-case performance of an algorithm. Unfortunately, this analysis may not always reect performance in practice because the adversarial assumption can be overly pessimistic. In such cases, several techniques have been developed to provide a more refined understanding of how an algorithm performs e.g., competitive analysis, parameterized analysis, and the theory of approximation algorithms.
Here, we describe an analogous technique called resource competitiveness, tailored for distributed systems. Often there is an operational cost for adversarial behavior arising from bandwidth usage, computational power, energy limitations, etc. Modeling this cost provides some notion of how much disruption the adversary can inict on the system. In parameterizing by this cost, we can design an algorithm with the following guarantee: if the adversary pays T, then the additional cost of the algorithm is some function of T.
Resource competitiveness yields results pertaining to secure, fault tolerant, and efficient distributed computation. We summarize these results and highlight future challenges where we expect this algorithmic tool to provide new insights.

References

[1]
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. Goodson, Michael K. Reiter, and Jay J. Wylie. Fault-Scalable Byzantine Fault-Tolerant Services. In Proceedings of the 20th ACM Symposium on Operating Systems Principles (SOSP), pages 59--74, 2005.
[2]
Ittai Abraham, Lorenzo Alvisi, and Joseph Y. Halpern. Distributed Computing Meets Game Theory: Combining Insights from Two Fields. SIGACT News, 42(2):69--76, June 2011.
[3]
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement, Mike Dahlin, Jean-Philippe Martin, and Carl Porth. BAR Fault Tolerance for Cooperative Services. In Proceedings of the 20th ACM Symposium on Operating systems Principles, pages 45--58, 2005.
[4]
Damal Kandadai Arvind, Khaled Elgaid, Thomas Krauss, Allan Paterson, Robert Stewart, and Iain Thayne. Towards an Integrated Design Approach to Specknets. In Proceedings of the IEEE International Conference on Communications (ICC), pages 3319--3324, 2007.
[5]
Baruch Awerbuch, Andrea Richa, and Christian Scheideler. A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pages 45--54, 2008.
[6]
Michael Bender, Jeremy Fineman, Seth Gilbert, and Maxwell Young. How to Scale Exponential Backoff. http://arxiv.org/abs/1402.5207, 2014.
[7]
Michael A. Bender and Chandra Chekuri. Performance Guarantees for the TSP with a Parameterized Triangle Inequality. In Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS), pages 80--85, 1999.
[8]
Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, and Charles E. Leiserson. Adversarial contention resolution for simple channels. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325--332, 2005.
[9]
Hans-Joachim Böckenhauer, Juraj Hromković, Ralf Klasing, Sebastian Seibert, and Walter Unger. Approximation Algorithms for the TSP with Sharpened Triangle Inequality. Information Processing Letters, 75(3):133--138, August 2000.
[10]
Hans L. Bodlaender and Arie M. C. A. Koster. Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal, 51(3):255--269, May 2008.
[11]
Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, and Falk Unger. Noisy Interactive Quantum Communication. In 55th IEEE Annual Symposium onFoundations of Computer Science (FOCS), pages 296--305, 2014.
[12]
Mark Braverman and Klim Efremenko. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pages 236--245, 2014.
[13]
Mark Braverman and Anup Rao. Towards Coding for Maximum Errors in Interactive Communication. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC), pages 159--166, 2011.
[14]
Srdjan Capkun, Mario Cagalj, Ramkumar Rengaswamy, Ilias Tsigkogiannis, Jean-Pierre Hubaux, and Mani Srivastava. Integrity Codes: Message Integrity Protection and Authentication over Insecure Channels. IEEE Transactions On Dependable and Secure Computing, 5:208--223, 2008.
[15]
Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, and Dan S. Wallach. Secure Routing for Structured Peer-to-Peer Overlay Networks. In Proceedings of the 5th Usenix Symposium on Operating Systems Design and Implementation (OSDI), pages 299--314, 2002.
[16]
Miguel Castro and Barbara Liskov. Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems, 20(4):398--461, 2002.
[17]
Sravanthi Chalasani and James M. Conrad. A Survey of Energy Harvesting Sources for Embedded Systems. In Proceedings of IEEE Southeastcon, pages 442--447, 2008.
[18]
Bogdan S. Chlebus, Dariusz R. Kowalski, and Mariusz A. Rokicki. Adversarial Queuing on the Multiple Access Channel. ACM Transactions on Algorithms, 8(1):5, 2012.
[19]
Allen Clement, Jeff Napper, Harry Li, Jean-Philipe Martin, Lorenzo Alvisi, and Michael Dahlin. Theory of BAR Games. In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pages 358--359, 2007.
[20]
Jed Crandall, Jared Saia, and Mahdi Zamani. Spread the Word: Reliable Tor Bridge Distribution. Available at: http://cs.unm.edu/~zamani/papers/tor-bridges, 2015.
[21]
Johannes Dams, Martin Hoefer, and Thomas Kesselheim. Jamming-Resistant Learning in Wireless Networks. http://arxiv.org/abs/1307.5290, 2013.
[22]
Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, and Maxwell Young. Interactive Communication with Unknown Noise Rate. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 575--587, 2015.
[23]
Whitfield Dié and Martin E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6):644--654, 1976.
[24]
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, and Calvin Newport. Gossiping in a Multichannel Radio Network: An Oblivious Approach to Coping with Malicious Interference. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 208--222, 2007.
[25]
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, and Calvin Newport. Secure Communication over Radio Channels. In Proceedings of the Symposium on Principles of Distributed Computing (PODC), pages 105--114, 2008.
[26]
Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz. Parameterized Analysis of Paging and List Update Algorithms. In Proceedings of the 7th International Conference on Approximation and Online Algorithms, WAOA'09, pages 104--115, 2010.
[27]
Cynthia Dwork and Moni Naor. Pricing via Processing or Combatting Junk Mail. In Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, pages 139--147, 1993.
[28]
Yuval Emek and Roger Wattenhofer. Frequency Hopping against a Powerful Adversary. In Proceedings of the 27th International Symposium Distributed Computing (DISC), pages 329--343, 2013.
[29]
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374--382, 1985.
[30]
Jason Franklin, Vern Paxson, Adrian Perrig, and Stefan Savage. An Inquiry into the Nature and Causes of the Wealth of Internet Miscreants. In Proceedings of the 14th ACM Conference on Computer and Communications Security, pages 375--388, 2007.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 46, Issue 3
September 2015
67 pages
ISSN:0163-5700
DOI:10.1145/2818936
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2015
Published in SIGACT Volume 46, Issue 3

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)1
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Distributed MIS in O(log log n) Awake ComplexityProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594574(135-145)Online publication date: 19-Jun-2023
  • (2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135:C(89-124)Online publication date: 1-May-2023
  • (2022)Efficient and competitive broadcast in multi-channel radio networksInformation and Computation10.1016/j.ic.2022.104960289:PAOnline publication date: 1-Nov-2022
  • (2021)Bankrupting Sybil Despite Churn2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS51616.2021.00048(425-437)Online publication date: Jul-2021
  • (2021)Spartan: Sparse Robust Addressable NetworksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2020.12.013Online publication date: Jan-2021
  • (2021)Windowed backoff algorithms for WiFi: theory and performance under batched arrivalsDistributed Computing10.1007/s00446-021-00403-934:5(367-393)Online publication date: 1-Oct-2021
  • (2020)Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio NetworksProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405697(286-288)Online publication date: 31-Jul-2020
  • (2019)Exponential Separations in the Energy Complexity of Leader ElectionACM Transactions on Algorithms10.1145/334111115:4(1-31)Online publication date: 4-Oct-2019
  • (2019)Fast and Resource Competitive Broadcast in Multi-channel Radio NetworksThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323186(179-189)Online publication date: 17-Jun-2019
  • (2019)The Communication Cost of Information Spreading in Dynamic Networks2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00044(368-378)Online publication date: Jul-2019
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media