Personne

Anwitaman Datta

Cette personne n’est plus à l’EPFL

Publications associées (33)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

SoS: self-organizing substrates

Anwitaman Datta

Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...

EPFL2006

Internet-scale storage systems under churn - A study of the steady state using Markov models

Karl Aberer, Anwitaman Datta

Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment, where peers continuously leave and rejoin the network, various lazy strategi ...

IEEE Computer Society2006

Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network partitioning or (more likely) because different groups of peers build such o ...

Springer2006

, ,

The research on P2P systems which support skewed key distributions has rapidly advanced in the recent years. Yet, the assumptions on the skews we are dealing with remained pretty simple: most of the existing literature assumes simple monotonous key distrib ...

2006

, , ,

We address the problem of how a data-oriented, structured overlay networks can be constructed efficiently from scratch in a self-organized way, a problem that has so far not been addressed in the literature. This problem occurs when using overlay networks ...

2005

Range queries in trie-structured overlays

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt, Renault John Lecoultre

Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This ...

2005

Content storage in a distributed collaborative environment uses redundancy for better resilience. This redundancy is either achieved by pure replication or using erasure codes for more efficient utilization of available storage. Increasingly such schemes a ...

2005

, ,

In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world model [6] we extend the model of building “routing-efficient” small-world graph ...

2005

Das P-Grid-Overlay-Netzwerk: Von einem einfachen Prinzip zu einem komplexen System

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt

The P-Grid overlay network: From a simple idea to a complex system. ...

2005

, ,

This paper focuses on replication in DHT based structured overlay networks, and presents a theoretical framework for optimal replication in such networks with respect to query frequency. In particular, we determine the optimal replication factor for query- ...

2004