Université de Neuchâtel

Peer-to-peer Distribution Architectures providing Uniform Download Rates

Schiely, Marc ; Felber, Pascal

In: Lecture Notes in Computer Science (LNCS), 2005, vol. 3761, p. 1083-1096

Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the technical means to efficiently distribute data to millions of clients simultaneously with very low infrastructural cost. Previous studies of content distribution architectures have primarily focused on homogeneous systems...

Université de Neuchâtel

A Lazy Snapshot Algorithm with Eager Validation

Riegel, Torvald ; Felber, Pascal ; Fetzer, Christof

In: Lecture Notes in Computer Science (LNCS), 2006, vol. 4167, p. 284-298

Most high-performance software transactional memories (STM) use optimistic invisible reads. Consequently, a transaction might have an inconsistent view of the objects it accesses unless the consistency of the view is validated whenever the view changes. Although all STMs usually detect inconsistencies at commit time, a transaction might never reach this point because an inconsistent view can...

Université de Neuchâtel

Content-based Publish/Subscribe using Distributed R-trees

Bianchi, Silvia ; Felber, Pascal ; Gradinariu, Maria

In: Lecture Notes in Computer Science (LNCS), 2007, vol. 4641, p. 537-548

Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network infrastructure. The challenge of such systems is to organize the peers so as to best match the interests of the consumers, minimizing false positives and avoiding false negatives. In this paper, we propose and...

Université de Neuchâtel

Stabilizing Peer-to-Peer Spatial Filters

Bianchi, Silvia ; Datta, Ajoy ; Felber, Pascal ; Gradinariu, Maria

In: Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07), 2007, p. 27-37

In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information. DR-tree copes with nodes dynamicity (frequent joins and leaves) and memory and counter program corruptions, that is, the processes can connect/disconnect at any time, and their memories and programs can be corrupted....

Université de Neuchâtel

Tree-Pattern Similarity Estimation for Scalable Content-based Routing

Chand, Raphaël ; Felber, Pascal ; Garofalakis, Minos

In: Proceedings of the 23rd International Conference on Data Engineering (ICDE'07), 2007, p. 1016-1025

With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important challenge. Content-based publish/subscribe systems offer a convenient design paradigm, as most of the complexity related to addressing and routing is encapsulated within the network infrastructure. To indicate the type...

Université de Neuchâtel

Speculative Out-of-order Event Processing with Software Transaction Memory

Brito, Andrey ; Fetzer, Christof ; Sturzrehm, Heiko ; Felber, Pascal

In: Proceedings of the International Conference on Distributed Event-Based Systems (DEBS'08), 2008, vol. 332, p. 265-275

In event stream applications, events flow through a network of components that perform various types of operations, e.g., filtering, aggregation, transformation. When the operation only depends on the input events, one can trivially parallelize its processing by replicating the associated components. This is not possible, however, with stateful components or when there exist dependencies between...

Université de Neuchâtel

Self-organization in Cooperative Content Distribution Networks

Schiely, Marc ; Renfer, Lars ; Felber, Pascal

In: Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'05), 2005, p. 109-118

Traditional client-server content distribution techniques usually suffer from scalability problems when dealing with large client population or sizable content. The advent of peer-to-peer (P2P) network offers the technical means to efficiently distribute data to millions of clients simultaneously with very low infrastructural cost. Previous studies of content distribution architectures have...

Université de Neuchâtel

P2P Experimentations with SPLAY: From Idea to Deployment Results in 30 min

Leonini, Lorenzo ; Rivière, Étienne ; Felber, Pascal

In: Proceedings of the 8th International Conference on Peer-to-Peer Computing (P2P'08), 2008, p. 189-190

Splay is an integrated system that facilitates the complete chain of distributed systems evaluation, from design and implementation to deployment and experiments control. Algorithms are expressed in a concise, yet very efficient, language based on Lua. Implementations in Splay are highly similar to the pseudo-code usually found in research papers. Splay eases the use of any kind of testbeds,...

Université de Neuchâtel

Improving Program Correctness with Atomic Exception Handling

Fetzer, Christof ; Felber, Pascal

In: Journal of Universal Computer Science (J.UCS), 2007, vol. 13, no. 8, p. 1047-1072

Exception handling is a powerful mechanisms for dealing with failures at runtime. It simplifies the development of robust programs by allowing the programmer to implement recovery actions and tolerate non-fatal errors. Yet, exception handling is difficult to get right! The complexity of correct exception handling is a major cause for incorrect exception handling. It is therefore important to...

Université de Neuchâtel

Snapshot Isolation for Software Transactional Memory

Riegel, Torvald ; Fetzer, Christof ; Felber, Pascal

In: First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT'06), 2006, p. 1-10

Software transactional memory (STM) has been proposed to simplify the development and to increase the scalability of concurrent programs. One problem of existing STMs is that of having long-running read transactions co-exist with shorter update transactions. This problem is of practical importance and has so far not been addressed by other papers in this domain. We approach this problem by...