We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
e from http://ssrn.com/abstract=980726 Acknowledgements: The authors thank Ramayya Krishnan, Marshall Van Alstyne, Senior Editor Sanjeev Dewan, the associate editor and referees fo...
Charles Zhechao Liu, Esther Gal-Or, Chris F. Kemer...
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...