Dynamic Analysis of the Arrow Distributed Protocol

@article{Herlihy2006DynamicAO,
  title={Dynamic Analysis of the Arrow Distributed Protocol},
  author={Maurice Herlihy and F. Kuhn and Srikanta Tirthapura and Roger Wattenhofer},
  journal={Theory of Computing Systems},
  year={2006},
  volume={39},
  pages={875-901}
}
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… Expand
56 Citations
Self-stabilizing distributed queuing
  • 46
  • PDF
Self-stabilizing distributed queuing
  • 12
  • PDF
An Analysis Framework for Distributed Hierarchical Directories
  • 6
  • Highly Influenced
  • PDF
Distributed Queuing in Dynamic Networks
Concurrent counting is harder than queuing
  • PDF
Concurrent counting is harder than queuing
  • 3
  • PDF
Distributed Queuing in Dynamic Networks
  • 4
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Self-stabilizing distributed queuing
  • 46
  • PDF
Self-stabilizing distributed queuing
  • 12
  • PDF
Dynamic analysis of the arrow distributed protocol
  • 11
  • PDF
Competitive concurrent distributed queuing
  • 68
  • PDF
A Variant of the Arrow Distributed Directory with Low Average Complexity
  • 35
A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal
  • 180
Ordered Multicast and Distributed Swap
  • 34
A tree-based algorithm for distributed mutual exclusion
  • 514
  • PDF
The Arrow Distributed Directory Protocol
  • 150
  • PDF
Optimum Communication Spanning Trees
  • T. Hu
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1974
  • 261
  • PDF
...
1
2
3
...