Publications by Anwitaman Datta

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

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 ...

We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc net ...

We study a new application of threshold-based secret sharing in a distributed online social network (DOSN), where users need a means to back up and recover their private keys in a network of untrusted servers. Using a simple threshold-based secret sharing ...

To address privacy concerns in Online Social Networks (OSNs), we propose to use a distributed, peer-to-peer approach coupled with encryption. To verify the feasibility of such an approach, we designed a two-tiered architecture and protocols that recreate t ...

Models of computational trust support users in taking decisions. They are commonly used to guide users' judgements in online auction sites; or to determine quality of contributions in Web 2.0 sites. However, most existing systems require historical informa ...

The limitations of client/server systems become evident in an Internet-scale distributed environment. Peer-topeer (P2P) systems offer an interesting alternative to traditional client/server systems: Every node acts both as a client and a server and “ ...

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 ...

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guaran ...

In many large-scale distributed systems and on the Web, agents need to interact with other unknown agents to carry out some tasks or transactions. The ability to reason about and assess the potential risks in carrying out such transactions is essential for ...

Recent years have seen advances in building large internet-scale index structures, generally known as structured overlays. Early structured overlays realized distributed hash tables (DHTs) which are ill suited for anything but exact queries. The need to su ...

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 ...

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself suffic ...

In Web-based information commerce it is diffcult to disentangle presentation from process logic, and sometimes even data is not separate from the presentation. Consequently, it becomes crucial to define an abstract model for business processes and their ma ...

Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique an ...

Quite a few data-oriented overlay networks have been designed in recent years. These designs often (implicitly) assume various homogeneity which seriously limit their usability in real world. In this paper we present some performance results of the Oscar o ...

Anwitaman Datta

Chat with Graph Search

SoS: self-organizing substrates

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

Autonomous Gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks

Enabling Secure Secret Sharing in Distributed Online Social Networks

Implementing a P2P Social Network - Early Experiences and Insights from PeerSoN

Trust beyond reputation: A computational trust model based on stereotypes

Advanced Peer-to-Peer Networking: The P-Grid System and its Applications

The challenges of merging two similar structured overlays: A tale of two networks

Fuzzynet: Ringless Routing in a Ring-like Structured Overlay

A Generic Trust Framework For Large-Scale Open Systems Using Machine Learning

Structured Overlay For Heterogeneous Environments: Design and Evaluation of Oscar

Oscar: Small-world overlay for realistic key distributions

Query-load balancing in structured overlays

Separating Business Process from User Interaction in Web-Based Information Commerce

Efficient, self-contained handling of identity in Peer-to-Peer systems

Oscar: A Data-Oriented Overlay For Heterogeneous Environments

A decentralized public key infrastructure for customer-to-customer e-commerce

Optimal caching for first-order query load-balancing in decentralized index structures

Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks

A Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems