Open access
Date
2004Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
Arrow is a prominent distributed protocol which globally orders requests initiated by the nodes in a distributed system. In this paper we present a dynamic analysis of the Arrow protocol. We prove that Arrow is O(logD)- competitive, where D is the diameter of the spanning tree on which Arrow operates. Show more
Permanent link
https://doi.org/10.3929/ethz-a-006714789Publication status
publishedJournal / series
Technical Report / ETH Zurich, Department of Computer ScienceVolume
Publisher
ETH Zurich, Computer Science DepartmentSubject
NETWORK PROTOCOLS + COMMUNICATION PROTOCOLS (COMPUTER SYSTEMS); NETZWERKPROTOKOLLE + KOMMUNIKATIONSPROTOKOLLE (COMPUTERSYSTEME); DISTRIBUTED SYSTEMS (COMPUTER SYSTEMS); VERTEILTE ANWENDUNGEN + CLOUD COMPUTING + GRID COMPUTING (COMPUTERSYSTEME); DISTRIBUTED APPLICATIONS + CLOUD COMPUTING + GRID COMPUTING (COMPUTER SYSTEMS); VERTEILTE SYSTEME (COMPUTERSYSTEME)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Technical Report D-INFK.More
Show all metadata
ETH Bibliography
yes
Altmetrics