All Stories

  1. Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation
  2. Don’t go MAD with Anomalies! Design-time Microservice Anomaly Detection in Migration to Microservices
  3. Self-adapting Machine Learning-based Systems via a Probabilistic Model Checking Framework
  4. PoTR: Accurate and Efficient Proof of Timely-Retrievability for Storage Systems
  5. A System for Authenticating Users While Ensuring Anonymity During and After Their Interactions
  6. Performance Trade-offs in Transactional Systems
  7. Deduplication vs Privacy Tradeoffs in Cloud Storage
  8. Practical Limitations of Ethereum’s Layer-2
  9. Omega: A Secure Event Ordering Service for the Edge
  10. FaaSTCC
  11. Poking a Hole in the Wall: Efficient Censorship-Resistant Internet Communications by Parasitizing on WebRTC
  12. Fireplug: Efficient and Robust Geo-Replication of Graph Databases
  13. EdgeScaler
  14. Forensic analysis of communication records of messaging applications from physical memory
  15. Localized Reliable Causal Multicast
  16. Adaptive information dissemination in the Bitcoin network
  17. Planning workflow executions when using spot instances in the cloud
  18. Measurements As First-class Artifacts
  19. Hourglass
  20. Policy-Based Adaptation of a Byzantine Fault Tolerant Distributed Graph Database
  21. FastRank: Practical lightweight tolerance to rational behavior in edge assisted streaming
  22. Learning non-deterministic impact models for adaptation
  23. Online Tuning of Parallelism Degree in Parallel Nesting Transactional Memory
  24. Towards affordable externally consistent guarantees for geo-replicated systems
  25. Dynamic adaptation of byzantine consensus protocols
  26. Fireplug: Flexible and robust N-version geo-replication of graph databases
  27. Augure: Proactive reconfiguration of cloud applications using heterogeneous resources
  28. CoopREP: Cooperative record and replay of concurrency bugs
  29. Saturn
  30. Automated generation of policies to support elastic scaling in cloud environments
  31. FastRank
  32. Accountability in Dynamic Networks
  33. DeltaShaper: Enabling Unobservable Censorship-resistant TCP Tunneling over Videoconferencing Streams
  34. GMU: Genuine Multiversion Update-Serializable Partial Data Replication
  35. MACHETE: Multi-path communication for security
  36. BioALeg - Enabling Biometric Authentication in Legacy Web Sites
  37. Message from the WMCSP 2016 Workshop Co-Chairs
  38. The Future(s) of Transactional Memory
  39. A Distributed Auctioneer for Resource Allocation in Decentralized Systems
  40. Efficient Free-Rider Detection Using Symmetric Overlays
  41. Concurrency Debugging with Differential Schedule Projections
  42. Dynamic adaptation of geo-replicated CRDTs
  43. Production-guided concurrency debugging
  44. Towards Incentive-Compatible Pricing for Bandwidth Reservation in Community Network Clouds
  45. Towards a Scalable, Distributed Metadata Service for Causal Consistency under Partial Geo-replication
  46. Q-OPT
  47. SmartFetch: Efficient Support for Selective Queries
  48. Chasing the Optimum in Replicated In-Memory Transactional Platforms via Protocol Adaptation
  49. Current trends and future directions in community edge clouds
  50. Efficient Free-Rider Detection Using Symmetric Overlays
  51. Concurrency debugging with differential schedule projections
  52. Reducing the vulnerability window in distributed transactional protocols
  53. On Data Placement in Distributed Systems
  54. On the Range of Equilibria Utilities of a Repeated Epidemic Dissemination Game with a Mediator
  55. A uto P lacer
  56. Overnesia: A Resilient Overlay Network for Virtual Super-Peers
  57. Balls-into-leaves
  58. On the energy and performance of commodity hardware transactional memory
  59. On the energy and performance of commodity hardware transactional memory
  60. Autonomic configuration of HyperDex via analytical modelling
  61. On speculative replication of transactional systems
  62. Virtues and limitations of commodity hardware transactional memory
  63. Policies for Efficient Data Replication in P2P Systems
  64. Towards effective and efficient search-based deterministic replay
  65. Rollerchain: A DHT for Efficient Replication
  66. Byzantine renaming in synchronous systems with t < N
  67. Order-Preserving Renaming in Synchronous Systems with Byzantine Faults
  68. Chasing the optimum in replicated in-memory transactional platforms via protocol adaptation
  69. ChainReaction
  70. Bounded gossip
  71. Self-Management of Adaptable Component-Based Applications
  72. On the Effectiveness of Punishments in a Repeated Epidemic Dissemination Game
  73. Self-management of Distributed Systems Using High-Level Goal Policies
  74. X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks
  75. SPECULA: Speculative Replication of Software Transactional Memory
  76. Brief announcement
  77. Lightweight cooperative logging for fault replication in concurrent programs
  78. When Scalability Meets Consistency: Genuine Multiversion Update-Serializable Partial Data Replication
  79. Summary of the 5th workshop on large-scale distributed systems and middleware (LADIS 2011)
  80. Asynchrony and Collusion in the N-party BAR Transfer Problem
  81. Rollerchain
  82. Exploiting Total Order Multicast in Weakly Consistent Transactional Caches
  83. Goal-oriented Self-management of In-memory Distributed Data Grid Platforms
  84. Topology Stability-Aware Multicast Protocol for MANETs
  85. N-party BAR Transfer
  86. A Generic Framework for Replicated Software Transactional Memories
  87. HPCS 2011 tutorials: Tutorial I: Distributed software transactional memories: Foundations, algorithms and tools
  88. Low-Coupling Cluster-Based Multipath Routing for Wireless Mesh Networks
  89. SCert
  90. N-party BAR Transfer
  91. PolyCert: Polymorphic Self-optimizing Replication for In-Memory Transactional Grids
  92. Introduction to Reliable and Secure Distributed Programming
  93. Feature-based probability blending
  94. Introduction
  95. Reliable Broadcast
  96. Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay
  97. A Machine Learning Approach to Performance Prediction of Total Order Broadcast Protocols
  98. An Optimal Speculative Transactional Replication Protocol
  99. Flexible and efficient resource location in large-scale systems
  100. Accessing probabilistic quorums in dynamic networks
  101. Communication and coordination support in ad hoc networks for emergency management scenarios
  102. Brief announcement
  103. Observable non-Sybil quorums construction in one-hop wireless ad hoc networks
  104. Cloud-TM
  105. RASM: A Reliable Algorithm for Scalable Multicast
  106. Practical Database Replication
  107. @Flood: Auto-Tunable Flooding for Wireless Ad Hoc Networks
  108. A-OSGi: A Framework to Support the Construction of Autonomic OSGi-Based Applications
  109. Asynchronous Lease-Based Replication of Software Transactional Memory
  110. Reputation in anonymous vehicular networks
  111. D2STM: Dependable Distributed Software Transactional Memory
  112. On Adding Structure to Unstructured Overlay Networks
  113. Gossip-Based Broadcast
  114. X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays
  115. An Efficient Weak Mutual Exclusion Algorithm
  116. Verme: Worm containment in overlay networks
  117. An algorithm for dissemination and retrieval of information in wirelessad hocnetworks
  118. The Weak Mutual Exclusion problem
  119. FT-OSGi: Fault Tolerant Extensions to the OSGi Service Platform
  120. From Local Impact Functions to Global Adaptation of Service Compositions
  121. Towards the Integration of Distributed Transactional Memories in Application Servers’ Clusters
  122. Middleware for Network Eccentric and Mobile Applications
  123. Gossip-Based Dissemination
  124. Geographical distribution of subscriptions for content-based publish/subscribe in MANETs
  125. Large-Scale Peer-to-Peer Autonomic Monitoring
  126. Towards distributed software transactional memory systems
  127. Supporting Linearizable Semantics in Replicated Databases
  128. Versioned transactional shared memory for the FénixEDU web application
  129. Modelling adaptive services for distributed systems
  130. On Replication of Software Transactional Memories
  131. Single-step creation of localized Delaunay triangulations
  132. Epidemic Broadcast Trees
  133. Gossiping on MANETs
  134. Epidemic Broadcast Trees
  135. Implementation and analysis of real-time communication protocol compositions
  136. GORDA: An Open Architecture for Database Replication
  137. Emergent Structure in Unstructured Epidemic Multicast
  138. HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
  139. DSN 2007 Tutorials
  140. A Framework to Support Multiple Reconfiguration Strategies
  141. A Power-Aware Broadcasting Algorithm
  142. A Framework to Provide Anonymity in Reputation Systems
  143. A Framework to Provide Anonymity in Reputation Systems
  144. SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks
  145. SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks
  146. Context adaptation of the communication stack
  147. On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols
  148. Program Co-chair's Message
  149. Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
  150. Introduction to Reliable Distributed Programming
  151. The atomic manifesto
  152. The atomic manifesto
  153. Scalable QoS-Based Event Routing in Publish-Subscribe Systems
  154. Low latency probabilistic broadcast in wide area networks
  155. Atomic broadcast in asynchronous crash-recovery distributed systems and its use in quorum-based replication
  156. Semantically reliable multicast: definition, implementation, and performance evaluation
  157. Configuring the Communication Middleware to Support Multi-user Object-Oriented Environments
  158. The GlobData Fault-Tolerant Replicated Distributed Object Database
  159. Semantically Reliable Broadcast
  160. A neural network for shortest path computation
  161. Distributed Systems for System Architects
  162. Secure Systems and Platforms
  163. Supporting Views in Network Management Systems
  164. A Dynamic Light-Weight Group Service
  165. Balancing configurability and efficiency in network support tools
  166. Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems
  167. Topology-Aware Algorithms for Large-Scale Communication
  168. Multi-user Object-Oriented Environments
  169. A Fault-Tolerant Secure CORBA Store using Fragmentation-Redundancy-Scattering
  170. CesiumSpray: a Precise and Accurate Global Time Service for Large-scale Systems
  171. Group orientation
  172. Requirements for high performance group support in distributed systems
  173. Reliable Multicasting in High-speed LANs
  174. Adaptive gossip-based broadcast
  175. NEEM: network-friendly epidemic multicast
  176. Reducing the cost of group communication with semantic view synchrony
  177. Probabilistic semantically reliable multicast
  178. Policy-Driven Adaptation of Protocol Stacks
  179. A genetic algorithm for multicast mapping in publish-subscribe systems
  180. Friends and foes:preventing sel .shness in open mobile ad hoc networks
  181. The road to a more configurable and adaptive communication and coordination support
  182. An indulgent uniform total order algorithm with optimistic delivery
  183. On QoS-aware publish-subscribe
  184. Schedulability analysis of an event-based real-time protocol framework
  185. Response time analysis of composable micro-protocols
  186. Separating replication from distributed communication: problems and solutions
  187. Deadline-constrained causal order
  188. Flexible communication support for CSCW applications
  189. Fault-tolerant broadcasts in CAN
  190. Scalable atomic multicast
  191. A posteriori agreement for fault-tolerant clock synchronization on broadcast networks