Sciweavers

231 search results - page 42 / 47
» A Byzantine Fault Tolerant Distributed Commit Protocol
Sort
View
PDPTA
2003
14 years 11 months ago
Subway: Peer-to-Peer Clustering Of Clients for Web Proxy
Many cooperated web cache systems and protocols have been proposed. But, these systems need the expensive resources, such as core-link bandwidth and proxy cpu or storage, and need...
Kyungbaek Kim, Daeyeon Park
SPAA
2003
ACM
15 years 2 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ICPADS
2002
IEEE
15 years 2 months ago
Self-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...
SIES
2008
IEEE
15 years 3 months ago
An investigation of the clique problem in FlexRay
—Distributed, time-triggered communication based on FlexRay is likely to become an enabler for future safety related applications in the automotive domain. Prior to series deploy...
Paul Milbredt, Martin Horauer, Andreas Steininger
DSN
2002
IEEE
15 years 2 months ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...