Abstract
Distributed queuing is a fundamental coordination problem that arises in a variety of applications, including distributed directories, totally ordered multicast, and distributed mutual exclusion. The arrow protocol is a solution to distributed queuing that is based on path reversal on a pre-selected spanning tree of the network. We present a novel and comprehensive competitive analysis of the arrow protocol. We consider the total cost of handling a finite number of queuing requests, which may or may not be issued concurrently, and show that the arrow protocol is \(O(s\cdot \log D)\)-competitive to the optimal queuing protocol, where s and D are the stretch and the diameter, respectively, of the spanning tree. In addition, we show that our analysis is almost tight by proving that for every spanning tree chosen for execution, the arrow protocol is \(\Omega(s \cdot \log(D/s)/{\log}\log(D/s))\)-competitive to the optimal queuing protocol. Our analysis reveals an intriguing connection between the arrow protocol and the nearest neighbor traveling salesperson tour on an appropriately defined graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Herlihy, M., Kuhn, F., Tirthapura, S. et al. Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput Syst 39, 875–901 (2006). https://doi.org/10.1007/s00224-006-1251-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-006-1251-9