Publications de Wojciech Galuba

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.

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

Microblogging sites are a unique and dynamic Web 2.0 communication medium. Understanding the information flow in these systems can not only provide better insights into the underlying sociology, but is also crucial for applications such as content ranking, ...

Unstructured overlay networks are driven by simple protocols that are easy to analyze and implement. The lack of structure, however, leads to weak message delivery guarantees and poor scaling. Structured overlays impose a global overlay topology that is th ...

In peer-to-peer content delivery systems, such as BitTorrent, there may exist nodes that are non-cooperative and do not contribute their upload bandwidth to the system while still downloading content from others. The current widely used countermeasures aga ...

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

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

Trust and reputation systems have proven to be essential to enforcing cooperative behavior in peer-to-peer networks. We briefly describe the current approaches to building reputation systems: social networks formation, probabilistic estimation and game the ...

The correct functioning of a peer-to-peer network relies on cooperative behavior of peers as service providers. Current approaches to detection and deterrence of non-cooperative behavior, such as reputation systems, rely on (1) global sharing of observatio ...

We present ProtoPeer, a peer-to-peer systems prototyping toolkit that allows for switching between the event driven simulation and live network deployment without changing any of the application code. ProtoPeer exports a set of APIs for message passing, me ...

Wojciech Galuba

Chattez avec Graph Search

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Outtweeting the Twitterers - Predicting Information Cascades in Microblogs

Generic emergent overlays in arbitrary peer identifier spaces

Leveraging Social Networks for Increased BitTorrent Robustness

Castor: Scalable Secure Routing for Ad Hoc Networks

Self-organized fault-tolerant routing in peer-to-peer overlays

Fuzzynet: Ringless Routing in a Ring-like Structured Overlay

The Complex Facets of Reputation and Trust

Authentication-free fault-tolerant peer-to-peer service provisioning

ProtoPeer: from Simulation to Live Deployment in One Step

ProtoPeer: A P2P Toolkit Bridging the Gap Between Simulation and Live Deployment

Bandwidth-efficient delay- and loss-tolerant overlay routing