|
A short description of my research activities on dependable and distributed systems is given
below, together with relevant publications (a more complete bibliography is
available here).
Copyright notice: This material is presented to ensure timely dissemination of scholarly
and technical work. Copyright and all rights therein are retained by authors or by other copyright
holders. All persons copying this information are expected to adhere to the terms and constraints
invoked by each author's copyright. In most cases, these works may not be reposted without the explicit
permission of the copyright holder.
Major chip manufacturers are stirring what is perceived by many
specialists as a revolution in modern computing, by changing their focus
from ever higher processor speed to increased parallel processing
capabilities. With multi-core and multi-processor systems becoming
commonplace, applications must rely on multi-threading for performance and the
lack of effective abstractions to manage the complexity of
concurrent programming represents a major hurdle for software
developers.
Software transactional memory (STM) is a recent programming model
in which concurrent threads synchronize optimistically via lightweight
transactions rather than pessimistically using locks. Recent research
indicates that STM is more energy efficient than lock-based
synchronization primitives, has better real-time properties (e.g., there is
no priority inversion problem), improves scalability for certain data access
patterns, and is composable. STM provides atomicity properties and can also
be used to develop robust applications.
- P. Felber, C. Fetzer, P. Marlier, and T. Riegel.
Time-based Software Transactional Memory.
To appear in IEEE Transactions on Parallel and Distributed Systems.
- V. Gramoli, D. Harmanci, and P. Felber.
On the Input Acceptance of Transactional Memory.
To appear in Parallel Processing Letters.
- W. Maldonado, P. Marlier, P. Felber, A. Suissa, D. Hendler, A. Fedorova, J.L. Lawall, G. Muller.
Scheduling Support for Transactional Memory Contention Management.
In Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'10), Bangalore, India, January 2010.
- L. Charles, P. Felber, and C. Gête.
TMBean: Optimistic Concurrency in Application Servers using Transactional Memory.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'09), Algarve, Portugal, November 2009.
- A. Brito, C. Fetzer, and P. Felber.
Multithreading-Enabled Active Replication for Event Stream Processing Operators.
In Proceedings of the 28th IEEE Symposium on Reliable Distributed Systems (SRDS'09), Niagara Falls, NY, September 2009.
- P. Felber, V. Gramoli, and R. Guerraoui.
Elastic Transactions.
In Proceedings of the 23rd International Symposium on Distributed Computing (DISC'09), Elche, Spain, September 2009.
- A. Brito, C. Fetzer, and P. Felber.
Minimizing Latency in Fault-Tolerant Distributed Stream Processing Systems.
In Proceedings of the 29th International Conference on Distributed Computing Systems (ICDCS'09), Montreal, Canada, June 2009.
- D. Harmanci, P. Felber, V. Gramoli, and C. Fetzer.
TMunit: Testing Transactional Memories.
In Fourth ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT'09), Raleugh, NC, February 2009.
- A. Brito, C. Fetzer, H. Sturzrehm, and P. Felber.
Speculative Out-of-order Event Processing with Software Transaction Memory.
In Proceedings of the International Conference on Distributed Event-Based Systems (DEBS'08), Rome, Italy, July 2008.
(preprint)
- T. Riegel, C. Fetzer, and P. Felber.
Automatic Data Partitioning in Software Transactional Memories.
In Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'08), Munich, Germany, June 2008.
(preprint)
- P. Felber, C. Fetzer, R. Guerraoui, and T. Harris.
Transactions are back---but are they the same?.
In SIGACT News, Volume 39, Issue 1, pp. 47-58, March 2008.
(at publisher's)
- P. Felber, C. Fetzer, and T. Riegel.
Dynamic Performance Tuning of Word-Based Software Transactional Memory.
In Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'08), Salt Lake City, UT, February 2008.
(preprint)
- P. Felber, C. Fetzer, U. Müller, T. Riegel, M. Süsskraut, and H. Sturzrehm.
Transactifying Applications using an Open Compiler Framework.
In Second ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT'07), Portland, OR, August 2007.
(preprint)
- T. Riegel, C. Fetzer, H. Sturzrehm, and P. Felber.
Brief Announcement: From Causal to z-Linearizable Transactional Memory.
In Proceedings of the 26th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'07), Portland, OR, August 2007.
(preprint)
- T. Riegel, C. Fetzer, and P. Felber.
Time-based Transactional Memory with Scalable Time Bases.
In Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'07), San Diego, CA, June 2007.
(preprint)
- T. Riegel, P. Felber, and C. Fetzer.
A Lazy Snapshot Algorithm with Eager Validation.
In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06), Stockholm, Sweden, September 2006.
(at publisher's,
preprint)
- T. Riegel, C. Fetzer, and P. Felber.
Snapshot Isolation for Software Transactional Memory.
In First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT'06), Ottawa, Canada, June 2006.
(preprint)
Failure atomicity
The development of robust software is a difficult undertaking, and is becoming increasingly more
important as applications grow larger and more complex. Although modern programming languages such
as C++ and Java provide sophisticated exception handling mechanisms to detect and correct runtime
error conditions, exception handling code must still be programmed with care to preserve application
consistency. In particular, exception handling is only effective if the premature termination of a method
due to an exception does not leave an object in an inconsistent state. We address this issue by introducing
the notion of failure atomicity in the context of exceptions. We propose practical techniques to
automatically detect and mask the non-atomic exception handling situations encountered during program
execution.
- C. Fetzer, P. Felber, and K. Hogstedt.
Automatic Testing of Exception Handling Code.
In S. Beydeda, V. Gruhn (Eds.): Testing Commercial-off-the-Shelf Components and Systems, pp. 89-110, Springer-Verlag, 2005.
(at publisher's)
- C. Fetzer, P. Felber, and K. Hogstedt.
Automatic Detection and Masking of Non-Atomic Exception Handling.
In IEEE Transactions on Software Engineering, Volume 30, Issue 8, pp. 547-560, August 2004.
(at publisher's,
preprint)
A shorter version appeared in Proceedings of the International Conference on Dependable Systems and Networks (DSN'03), San Francisco, CA, June 2003.
(preprint)
Composable error recovery
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 reduce the complexity of writing exception
handling code while, at the same time, making sure it is correct.
Our approach is to use atomic blocks for error handling combined with
optional compensation actions, which can together make error
recovery composable.
- C. Fetzer and P. Felber.
Improving Program Correctness with Atomic Exception Handling.
In JUCS, Special Issue (Atomicity II), Volume 13, Issue 8, pp. 1047-1072, 2007.
(at publisher's)
Large-scale testbeds
SPLAY is a system that simplifies the prototyping and development of large-scale distributed applications and overlay networks. Unlike many existing tools, SPLAY covers the complete chain of distributed system design, development and testing chain: from coding and local testing to deployment, runtime control and monitoring. SPLAY allows developers to specify distributed applications in a concise way using a specialized language based on Lua, a highly-efficient embeddable scripting language. SPLAY applications execute in a safe environment with restricted access to local resources (file system, network, memory) and can be instantiated on a large variety of testbeds composed a large set of nodes with a single command.
- L. Leonini, E. Rivière, and P. Felber.
SPLAY: Distributed Systems Evaluation Made Simple (or How to Turn Ideas into Live Systems in a Breeze).
In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI'09), Boston, MA, April 2009.
(preprint)
- L. Leonini, E. Rivière, and P. Felber.
P2P Experimentations with SPLAY: From Idea to Deployment Results in 30 min (demo).
In Proceedings of the 8th International Conference on Peer-to-Peer Computing (P2P'08), Aachen, Germany, September 2008.
(preprint)
Cooperative content distribution
Peer-to-peer networks have often been touted as the ultimate
solution to scalability. Although cooperative techniques have been
initially used almost exclusively for content lookup and sharing, one of
the most promising application of the peer-to-peer paradigm is to capitalize
the bandwidth of client peers to quickly distribute large content
and withstand flash-crowds (i.e., a sudden increase in popularity of some
online content). Cooperative content distribution is based on the premise
that the capacity of a network is as high as the sum of the resources of
its nodes: the more peers in the network, the higher its aggregate bandwidth,
and the better it can scale and serve new peers. Such networks can
thus spontaneously adapt to the demand by taking advantage of available
resources. In this research, we evaluate the use of peer-to-peer networks
for content distribution under various system assumptions, we propose novel
techniques for organizing peers so as to maximize the usage of upstream bandwidth,
and we design original protocols for large-scale distribution of (streaming) content.
Part of this work is conducted in the context of project CrossFlux:
Cooperative Networks for Content Distribution in the Internet.
- B. Biskupski, M. Schiely, P. Felber, and R. Meier.
Tree-Based Analysis of Mesh Overlays for Peer-to-Peer Streaming.
In Proceedings of the 8th IFIP International Working Conference on Distributed Applications and Interoperable Systems (DAIS'08), Oslo, Norway, June 2008.
(at publisher's)
- E.W. Biersack, D. Carra, R. Lo Cigno, P. Rodriguez and P. Felber.
Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases.
In Computer Networks, Volume 51, Issue 3, pp. 901-917, Elsevier, 2007.
(at publisher's)
- M. Schiely and P. Felber.
CROSSFLUX: An Architecture for Peer-to-Peer Media Streaming.
In R. Baldoni, G. Cortese, F. Davide, A. Melpignano (Eds.): Global Data Management, Volume 8, Emerging Communication: Studies on New Technologies and Practices in Communication, pp. 342-358, IOSPress, 2006.
(at publisher's)
- M. Schiely and P. Felber.
Peer-to-peer Distribution Architectures providing Uniform Download Rates.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'05), Agia Napa, Cyprus, October 2005.
(preprint)
- M. Schiely, L. Renfer, and P. Felber.
Self-organization in Cooperative Content Distribution Networks.
In Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'05), Cambridge, MA, July 2005.
(preprint)
- P. Felber and E.W. Biersack.
Cooperative Content Distribution: Scalability through Self-Organization.
In O. Babaoglu, M. Jelasity, A. Montresor, C. Fetzer, S. Leonardi, A. van Moorsel, M. van Steen (Eds.): Self-Star Properties in Complex Information Systems, pp. 343-357, Springer-Verlag, 2005.
(at publisher's)
- A. Al Hamra and P. Felber.
Design Choices for Content Distribution in P2P Networks.
In ACM SIGCOMM Computer Communication Review, Volume 35, Issue 5, pp. 29-40, 2005.
(at publisher's)
- P. Felber and E.W. Biersack.
Self-scaling Networks for Content Distribution.
In Proceedings of the International Workshop on Self-* Properties in Complex Information Systems (Self-*), Bertinoro, Italy, May-June 2004.
(preprint)
- E.W. Biersack, P. Rodriguez, and P. Felber.
Performance Analysis of Peer-to-Peer Networks for File Distribution.
In Proceedings of the 5th International Workshop on Quality of future Internet Services (QofIS'04), pp. 1-10, Barcelona, Spain, September 2004.
(at publisher's,
preprint)
- M. Izal and G. Urvoy-Keller and E.W. Biersack and P.A. Felber and A. Al Hamra and L. Garces-Erice.
Dissecting BitTorrent: Five Months in a Torrent's Lifetime.
In Proceedings of the 5th Passive and Active Measurement Workshop (PAM'04), Juan-les-Pins, France, April 2004.
(preprint)
Mobile peer-to-peer networks
Various peer-to-peer (P2P) architectures for ad-hoc networks
have been proposed over the last few years. Most of them are unstructured
and use some form of flooding to locate content, because the
physical constraints of the underlying network make the construction of
arbitrary application-layer overlays impractical.
We study the problem of applying distributed hash
tables (DHT) to ad-hoc networks. Our approach to efficiently lookup
content in such networks exploits physical proximity of peers when establishing
and maintaining the DHT based routing tables. We are also studying the problems
of data dissemination using lightweight multicast protocols.
We are also studying the problem of data dissemination using lightweight
multicast protocols. Our approach consists in building and maintaining efficient
multicast trees spanning sets of nodes interested in the same content.
Nodes that are not part of a multicast group may be used for ad-hoc routing but
have no responsability in the construction or maintenance of the multicast trees.
Besides its low overhead, an original aspect of our approach is the ability of the
multicast trees to quickly self-adapt under mobility and churn, based only on
local reorganizations.
Finally, we are working on lightweight mechanisms for enhancing the dependability
and performance of applications on resource-constrained mobile devices and sensors.
Using our techniques, one can program atomic actions that are either local (i.e.,
they ensure that some local computation either succeeds completely or not at all), or
distributed (i.e., devices and sensors can access each other's data concurrenctly
without interference, with the illusion of atomicity and isolation). The underlying
mechanisms are optimized for low resource devices and allow us to develop applications for
which distributed synchronization is necessary but the cost of classical techniques (e.g.,
distributed locks or transactions) is too expensive. Our techniques are based on a
low-footprint distributed software transactional memory (DSTM) infrastructure.
- R. Kummer, P. Kropf, and P. Felber.
Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'06), Montpellier, France, October 2006.
(preprint)
An earlier version is available as research report RR-I-06-05.1: On the Feasibility of DHT Lookup in Ad-Hoc Network.
Load balancing and fault tolerance in peer-to-peer networks
In the past few years, several DHT-based abstractions
for peer-to-peer systems have been proposed. The main
characteristic is to associate nodes (peers) with objects (keys) and
to construct distributed routing structures to support efficient
location. These approaches partially consider the load problem
by balancing storage of objects without, however, considering
lookup traffic. We propose a novel approach for load balancing,
based on dynamic routing table reorganization in order to
balance the routing load and on caching objects to balance
the request load. We can therefore significantly improve the
load balancing of traffic in DHTs, and consequently
their scalability and performance.
- S. Serbu, P. Kropf, and P. Felber.
Improving the Dependability of Prefix-Based Routing in DHTs.
In Proceedings of the 15th International Conference on Cooperative Information Systems (CoopIS'07), Algarve, Portugal, November 2007.
(preprint)
An earlier version appeared in Proceedings of the International Workshop on Dependable Application Support in Self-Organising Networks (DASSON'07), Edinburgh, UK, June 2007: Fault-Tolerant P2P Networks: How Dependable is Greedy Routing?
- S. Serbu, S. Bianchi, P. Kropf, and P. Felber.
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others.
In IEEE Internet Computing, Volume 11, Issue 4, pp. 53-61, 2007.
(at publisher's)
- S. Bianchi, S. Serbu, P. Felber, and P. Kropf.
Adaptive Load Balancing for DHT Lookups.
In Proceedings of the 15th International Conference on Computer Communications and Networks (ICCCN'06), Arlington, VA, October 2006.
(preprint)
- S. Serbu, S. Bianchi, P. Kropf, and P. Felber.
Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others.
In Montreal Conference on eTechnologies (MCETECH'06), Montreal, Canada, May 2006.
(preprint)
Searching and indexing in peer-to-peer networks
The huge popularity of recent peer-to-peer file sharing systems has been mainly driven by the scalability of their
architectures and the flexibility of their search facilities. Such systems are often designed as unstructured P2P networks, because
they impose few constraints on topology and data placement and support highly versatile search mechanisms. A major limitation
of unstructured P2P networks lies, however, in the inefficiency of their search algorithms, which are usually based on simple flooding
schemes. In this research, we propose novel mechanisms for improving search efficiency in unstructured P2P networks by performing
local dynamic topology adaptations, based on the query traffic patterns, in order to spontaneously create communities
of peers that share similar interests. The basic premise of such semantic communities is that file requests have a high probability
of being fulfilled within the community they originate from, therefore increasing the search efficiency.
Unlike unstructured peer-to-peer networks, distributed hash table (DHT) systems make it simple to discover specific data but
require complete identifiers (or keys) to be known in advance. In practice, however, users looking up resources stored in
peer-to-peer systems often have only partial information for identifying these resources. In order to alleviate this limitation,
we propose techniques for indexing the data stored in peer-to peer DHT networks, and discovering the resources that match a
given user query.
- V. Cholvi, P. Felber, and E.W. Biersack.
Efficient Search in Unstructured Peer-to-Peer Networks.
In European Transactions on Telecommunications, Special Issue on P2P Networking and P2P Services, Volume 15, Issue 6, 2004.
(preprint)
A shorter version appeared in Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'04), Barcelona, Spain, June 2004.
- L. Garces-Erice, P. Felber, E.W. Biersack, K.W. Ross, and G. Urvoy-Keller.
Data Indexing in DHT Peer-to-Peer Networks.
In Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS-04), Tokyo, Japan, March 2004.
(preprint)
Topology-aware peer-to-peer networks
Peer-to-peer distributed hash tables (DHTs) are structured networks with decentralized lookup capabilities.
Each node is responsible for a given set of keys (identifiers) and lookup of a key is achieved by routing a request
through the network toward the current peer responsible for the desired key. DHT designs are usually compared in
terms of degree (number of neighbors) and diameter (length of lookup paths). We propose a novel topology-aware DHT that
routes lookup requests to their destination along a path that mimics the router-level shortest-path, thereby providing
a small "stretch." In addition to providing faster lookup, we can take advantage of the topological
properties of the DHT to cache information in the proximity of the requesters and reduce the hop distance.
- P. Felber, K.W. Ross, E.W. Biersack, L. Garces-Erice, and G. Urvoy-Keller.
Structured Peer-to-Peer Networks: Faster, Closer, Smarter.
In IEEE Data Engineering Bulletin, Volume 28, Issue 1, pp. 55-62, 2005.
(online)
- L. Garces-Erice, E.W. Biersack, and P. Felber.
MULTI+: Building Topology-Aware Overlay Multicast Trees.
In Proceedings of the 5th International Workshop on Quality of future Internet Services (QofIS'04), pp. 11-20, Barcelona, Spain, September 2004.
(at publisher's,
preprint)
- L. Garces-Erice, K.W. Ross, E.W. Biersack, P. Felber, and G. Urvoy-Keller.
Topology-Centric Look-Up Service.
In Proceedings of the Fifth International Workshop on Networked Group Communications (NGC'03), Munich, Germany, September 2003.
Best Paper Award.
(preprint)
Hierarchical peer-to-peer networks
Structured peer-to-peer lookup services organize peers into a
flat overlay network and offer distributed hash table (DHT) functionality. Data
is associated with keys and each peer is responsible for a subset of the keys. In
hierarchical DHTs, peers are organized into groups, and each group has its autonomous
intra-group overlay network and lookup service. Groups are organized
in a top-level overlay network. To find a peer that is responsible for a key, the
top-level overlay first determines the group responsible for the key; the responsible
group then uses its intra-group overlay to determine the specific peer that is
responsible for the key. We provide a general framework and a scalable hierarchical
overlay management. Our analysis shows that by using the most reliable peers in the top level,
the hierarchical design significantly reduces the expected number of hops.
- L. Garces-Erice, E.W. Biersack, P. Felber, K.W. Ross, and G. Urvoy-Keller.
Hierarchical Peer-to-Peer Systems.
In Parallel Processing Letters, Volume 13, Issue 4, pp. 643-657, December 2003.
(preprint)
A shorter version appeared in Proceedings of the International Conference on Parallel and Distributed Computing (Euro-Par'03), Klagenfurt, Austria, August 2003.
(preprint)
Flashcrowd avoidance
Flash crowds, which result from the sudden increase in popularity of some online content, are among the most
important problems that plague today’s Internet. Affected servers are overloaded with requests and quickly become
"hot spots." They usually suffer from severe performance failures or stop providing service altogether, as there are
scarcely any effective techniques to scalably deliver content under hot spot conditions to all requesting clients.
In this research, we study the occurence of flashcrowds and we propose and evaluate collaborative techniques to detect
and proactively avoid the occurrence of hot spots.
- P. Felber, T. Kaldewey, and S. Weiss.
Proactive Hot Spot Avoidance for Web Server Dependability.
In Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems (SRDS'04), pp. 309-318, Florianopolis, Brazil, October 2004.
(preprint)
Our research in content routing and publish/subcribe systems has mainly focused on the XNet
project, which aims at developing novel techniques to filter and route XML data based on the very
nature of the data and the interests of the target consumers, so as to take into account
the heterogeneity in their processing power, bandwidth, or connectivity. XNet leverages the
processing power of an overlay network to filter and route data, and minimize the usage of
network bandwidth. Several novel data management algorithms and distributed protocols
have been proposed in the context of this project.
- S. Bianchi, P. Felber, and M. Gradinariu.
Stabilizing Distributed R-trees for Peer-to-Peer Content Routing.
To appear in IEEE Transactions on Parallel and Distributed Systems.
- R. Chand and P. Felber.
Scalable distribution of XML content with XNet.
In IEEE Transactions on Parallel and Distributed Systems, Volume 19, Issue 4, pp. 447-461, April 2008.
(at publisher's)
- S. Bianchi, P. Felber, and M. Gradinariu.
Content-based Publish/Subscribe using Distributed R-trees.
In Proceedings of the International Conference on Parallel and Distributed Computing (Euro-Par'07), Rennes, France, August 2007.
(preprint)
- S. Bianchi, A.K. Datta, P. Felber, and M. Gradinariu.
Stabilizing Peer-to-Peer Spatial Filters.
In Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, June 2007.
(preprint)
- R. Chand, P. Felber, and M. Garofalakis.
Tree-Pattern Similarity Estimation for Scalable Content-based Routing.
In Proceedings of the 23rd International Conference on Data Engineering (ICDE'07), Istanbul, Turkey, April 2007.
(preprint)
- R. Chand and P. Felber.
Semantic Peer-to-Peer Overlays for Publish/Subscribe Networks.
In Proceedings of the International Conference on Parallel and Distributed Computing (Euro-Par'05), Lisboa, Portugal, August 2005.
(at publisher's)
- R. Chand and P. Felber.
XNet: A Reliable Content Routing Network.
In Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems (SRDS'04), pp. 264-273, Florianopolis, Brazil, October 2004.
(preprint)
- R. Chand and P. Felber.
Efficient Subscription Management in Content-based Networks.
In Proceedings of the International Workshop on Distributed Event-Based Systems (DEBS'04), Edinburgh, Scotland, May 2004.
(preprint)
- P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec.
The Many Faces of Publish/Subscribe.
In ACM Computing Surveys, Volume 35, Issue 2, pp. 114-131, June 2003.
(preprint)
- R. Chand and P. Felber.
A Scalable Protocol for Content-Based Routing in Overlay Networks.
In Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'03), Cambridge, MA, April 2003.
(preprint)
- P. Felber, C.Y. Chan, M.N. Garofalakis, and R. Rastogi.
Scalable Filtering of XML Data for Web Services.
In IEEE Internet Computing, Volume 7, Issue 1, pp. 49-57, 2003.
(preprint)
- C.Y. Chan, P. Felber, M.N. Garofalakis, and R. Rastogi.
Efficient Filtering of XML Documents with XPath Expressions.
In VLDB Journal, Special Issue on XML, Volume 11, Issue 4, pp. 354-379, 2002.
(at publisher's,
preprint)
- C.Y. Chan, W. Fan, P. Felber, M.N. Garofalakis, and R. Rastogi.
Tree Pattern Aggregation for Scalable XML Data Dissemination.
In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, August 2002.
(preprint)
- S. Handurukande, P.T. Eugster, P. Felber, and R. Guerraoui.
Event Systems: How to Have Ones Cake and Eat It Too.
In Proceedings of the International Workshop on Distributed Event-Based Systems (DEBS'02), Vienna, Austria, July 2002.
(preprint)
- C.Y. Chan, P. Felber, M.N. Garofalakis, and R. Rastogi.
Efficient Filtering of XML Documents with XPath Expressions.
In Proceedings of the 18th International Conference on Data Engineering (ICDE'02), San Jose, CA, February-March 2002.
(preprint)
Middleware and protocols
Building dependable distributed systems is a challenging task and the protocols traditionally
used to guarantee consistency among distributed entities are usually expensive. To address some of these
limitations, we have explored a number of directions for improving efficiency and scalability,
such as optimistic, probabilistic, or semantically-consistent algorithms, as well as architectural
considerations for building better object-based middleware.
- P. Felber.
Transparent Parallelization of Java Applications.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'03), Catania, Sicily, November 2003.
(preprint)
- P. Felber and F. Pedone.
Probabilistic Atomic Broadcast.
In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), Osaka, Japan, October 2002.
(preprint)
- P. Felber and M.K. Reiter.
Advanced Concurrency Control in Java.
In Concurrency and Computation: Practice & Experience, Volume 14, Issue 4, pp. 261-285, 2002.
(at publisher's,
preprint)
- P. Felber, B. Jai, M. Smith, and R. Rastogi.
Using Semantic Knowledge of Distributed Objects to Increase Reliability and Availability.
In Proceedings of the 6th International Workshop on Object-oriented Real-time Dependable Systems (WORDS'01), pp. 153-160, Rome, Italy, January 2001.
(preprint)
- R. Guerraoui, P. Eugster, P. Felber, B. Garbinato, and K. Mazouni.
Experiences with Object Group Systems.
In Software: Practice & Experience, Volume 30, Issue 12, pp. 1375-1404, 2000.
(at publisher's,
preprint)
- P. Felber and A. Schiper.
Optimistic Active Replication.
In Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS-01), pp. 333-341, Phoenix, AZ, April 2001.
(preprint)
- P. Felber, R. Guerraoui, and M.E. Fayad.
Putting OO Distributed Programming to Work.
In Communications of the ACM, Volume 42, Number 11, pp. 97-101, 1999.
(at publisher's)
- R. Guerraoui, P. Felber, B. Garbinato, and K. Mazouni.
System Support for Object Groups.
In Proceedings of the ACM Conference on Object Oriented Programming Systems, Languages and Applications (OOPSLA'98), pp. 244-258, Vancouver, BC, October 1998.
(preprint)
- B. Garbinato, P. Felber, and R. Guerraoui.
Strategy Pattern for Composing Reliable Distributed Protocol.
In 3rd Conference on the Pattern Languages of Programs (PLoP'96), Monticello, IL, September 1996.
(preprint)
- B. Garbinato, P. Felber, and R. Guerraoui.
Right Abstractions on Adequate Frameworks for Building Adaptable Distributed Applications.
In Special Issues in Object-Oriented Programming, pp. 24-28, dpunkt-Verlag, 1997.
- B. Garbinato, P. Felber, and R. Guerraoui.
Modeling Protocols as Objects for Structuring Reliable Distributed Systems.
In Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS'97), pp. 165-171, Phoenix, AZ, January 1997.
(preprint)
- B. Garbinato, P. Felber, and R. Guerraoui.
Protocol Classes for Designing Reliable Distributed Environments.
In Proceedings of the 10th European Conference on Object-Oriented Programming (ECOOP'96), pp. 316-343, Linz, Austria, Springer-Verlag, July 1996.
(preprint)
- C. Malloth, P. Felber, A. Schiper, and U. Wilhelm.
Phoenix: A Toolkit for Building Fault-Tolerant, Distributed Applications in Large Scale.
In Workshop on Parallel and Distributed Platforms in Industrial Products (IEEE Symposium on Parallel and Distributed Processing, SPDP-7), San Antonio, TX, October, 1995.
(preprint)
- P. Felber and R. Guerraoui.
Programming with Object Groups in Phoenix.
In Proceedings of the 16th Conference on Technology of Object-Oriented Languages and Systems (TOOLS 16), pp. 263-271, Paris, France, Prentice Hall, March 1995.
(preprint)
Fault-tolerant CORBA
We have conducted pioneering research on fault tolerance support for distributed objects.
In particular, we have designed and developed a CORBA Object Group Service (OGS) that provides
CORBA applications with transparent fault tolerance and high availability. Significant portions of
this work were later adopted in the specification of the Fault-Tolerant CORBA standard..
- P. Felber and P. Narasimhan.
Experiences, Approaches and Challenges in Building Fault-tolerant CORBA Systems.
In IEEE Transactions on Computers, Volume 53, Issue 5, pp. 497-511, May 2004.
(at publisher's,
preprint)
- P. Felber and P. Narasimhan.
Reconciling Replication and Transactions for the End-to-End Reliability of CORBA Applications.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'02), Irvine, California, October 2002.
(preprint)
- P. Felber.
Lightweight Fault Tolerance in CORBA.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'01), Rome, Italy, September 2001.
(preprint)
- P. Felber, R. Guerraoui, and A. Schiper.
Replication of CORBA Objects.
In S. Krakowiak, S. Shrivastava (Eds.): Advances in Distributed Systems, LNCS 1752, pp. 254-276, Springer-Verlag, 2000.
(preprint)
- P. Felber and R. Guerraoui.
Programming with Object Groups in CORBA.
In IEEE Concurrency, Volume 8, Number 1, pp. 48-58, 2000.
(at publisher's,
preprint)
- P. Felber, X. Défago, R. Guerraoui, and P. Oser.
Failure Detectors as First Class Objects.
In Proceedings of the International Symposium on Distributed Objects and Applications (DOA'99), pp. 132-141, Edinburgh, Scotland, September 1999.
(preprint)
- P. Felber, X. Défago, P. Eugster, and A. Schiper.
Replicating CORBA Objects: A Marriage Between Active and Passive Replication.
In Proceedings of the 2nd IFIP International Working Conference on Distributed Applications and Interoperable Systems (DAIS'99), pp. 375-387, Helsinki, Finland, June-July 1999.
(preprint)
- X. Défago, P. Felber, and A. Schiper.
Optimization Techniques for Replicating CORBA Objects.
In Proceedings of the 4th International Workshop on Object-oriented Real-time Dependable Systems (WORDS'99), pp. 2-8, Santa Barbara, CA, January 1999.
(preprint)
- P. Felber.
The CORBA Object Group Service: A Service Approach to Object Groups in CORBA.
Ph.D. thesis, number 1867, Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1998.
(preprint)
- P. Felber, R. Guerraoui, and A. Schiper.
Evaluating CORBA Portability: The Case of an Object Group Service.
In Proceedings of the 2nd International Enterprise Distributed Object Computing Workshop (EDOC'98), pp. 164-173, San Diego, CA, November 1998.
(preprint)
- P. Felber, R. Guerraoui, and A. Schiper.
The implementation of a CORBA group communication service.
In Theory and Practice of Object Systems, Volume 4, Number 2, pp. 93-105, 1998.
(preprint)
- P. Felber, B. Garbinato, and R. Guerraoui.
Towards Reliable CORBA: Integration vs. Service Approach.
In Special Issues in Object-Oriented Programming, pp. 199-205, dpunkt-Verlag, 1997.
- P. Felber, R. Guerraoui, and A. Schiper.
Replicating Objects using the CORBA Event Service.
In Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS'97), pp. 14-19, Tunis, October 1997.
(preprint)
- X. Défago, P. Felber, B. Garbinato, and R. Guerraoui.
Reliability with CORBA Event Channels.
In Proceedings of the 3rd Conference on Object-Oriented Technologies and Systems (COOTS'97), pp. 237-240, Portland, OR, June 1997.
(preprint)
- P. Felber, B. Garbinato, and R. Guerraoui.
The Design of a CORBA Group Communication Service.
In Proceedings of the 15th IEEE Symposium on Reliable Distributed Systems (SRDS'96), pp. 150-159, Niagara-on-the-Lake, Canada, October 1996.
(preprint)
|
