Sébastien Monnet

Learn More
SUMMARY This paper addresses the challenge of transparent data sharing within computing Grids built as cluster federations. On such platforms, the availability of storage resources may change in a dynamic way, often due to hardware failures. We focus on the problem of handling the consistency of replicated data in the presence of failures. We propose a(More)
Cluster federations are attractive to execute applications like large scale code coupling. However, faults may appear frequently in such architectures. Thus, checkpointing long-running applications is desirable to avoid to restart them form the beginning in the event of a node failure. To take into account the constraints of a cluster federation(More)
DHT-based P2P systems provide a fault-tolerant and scalable mean to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection/disconnection frequency is too high, data blocks may be lost. This is true for most current DHT-based system's implementations. To avoid this problem, it is necessary to build really(More)
Massively Multiplayer Online Games (MMOGs) re­ cently emerged as a popular class of applications with mil­ lions of users. To offer acceptable gaming experience, such applications need to render the virtual world surrounding the player with a very low latency. However, current state­ of-the-art MMOGs based on peer-to-peer overlays fail to satisfy these(More)
The interesting properties of P2P systems (high availability despite peer volatility, support for heterogeneous architectures, high scalability, etc.) make them attractive for distributed computing. However, conducting large-scale experiments with these systems arises as a major challenge. Simulation allows only to partially model the behavior of P2P(More)
More and more, users store their data in the cloud. While the content is then retrieved, the retrieval has to respect quality of service (QoS) constraints. In order to reduce transfer latency, data is repli-cated. The idea is make data close to users and to take advantage of providers home storage. However to minimize the cost of their platform, cloud(More)
Grid computing has recently emerged as a response to the growing demand for resources (processing power, storage, etc.) exhibited by scientific applications. We address the challenge of sharing large amounts of data on such infrastruc-tures, typically consisting of a federation of node clusters. We claim that storing, accessing, updating and sharing such(More)
Designing and implementing a quality matchmaking service for Multiplayer Online Games requires an extensive knowledge of the habits, behaviors and expectations of the players. Gathering and analyzing traces of real games offers insight on these matters, but game server providers are very protective of such data in order to deter possible reuse by the(More)
— While peer-to-peer overlays allow distributed applications to scale and tolerate failures, most structured and unstructured overlays in literature today are inflexible from the application viewpoint. The application thus has no first-class control on the overlay structure. This paper proposes the concept of an application-malleable overlay, and the design(More)