ROFL: routing on flat labels
It is accepted wisdom that the current Internet architecture conflates network locations and
host identities, but there is no agreement on how a future architecture should distinguish the …
host identities, but there is no agreement on how a future architecture should distinguish the …
[BOOK][B] P2P networking and applications
Peer-to-Peer (P2P) networks enable users to directly share digital content (such as audio,
video, and text files) as well as real-time data (such as telephony traffic) with other users …
video, and text files) as well as real-time data (such as telephony traffic) with other users …
Peer-to-peer networking and applications: synopsis and research directions
JF Buford, H Yu - Handbook of peer-to-peer networking, 2009 - Springer
Peer-to-peer computing and networking are important developments for large-scale
distributed systems design and the evolution of Internet architecture. Widely used …
distributed systems design and the evolution of Internet architecture. Widely used …
Gaussian belief propagation: Theory and aplication
D Bickson - arxiv preprint arxiv:0811.2518, 2008 - arxiv.org
The canonical problem of solving a system of linear equations arises in numerous contexts
in information theory, communication theory, and related fields. In this contribution, we …
in information theory, communication theory, and related fields. In this contribution, we …
Distributed k-ary system: Algorithms for distributed hash tables
A Ghodsi - 2006 - diva-portal.org
This dissertation presents algorithms for data structures called distributed hash tables (DHT)
or structured overlay networks, which are used to build scalable self-managing distributed …
or structured overlay networks, which are used to build scalable self-managing distributed …
On the topologies formed by selfish peers
Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not
contributing any resources to the network. Various mechanisms have been designed to …
contributing any resources to the network. Various mechanisms have been designed to …
Scalable routing on flat names
We introduce a protocol which routes on flat, location-independent identifiers with
guaranteed scalability and low stretch. Our design builds on theoretical advances in the …
guaranteed scalability and low stretch. Our design builds on theoretical advances in the …
equus: A provably robust and locality-aware peer-to-peer system
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of
peers joining only for a limited period of time, resulting in hundreds of join and leave events …
peers joining only for a limited period of time, resulting in hundreds of join and leave events …
Network-aware overlays with network coordinates
Network coordinates, which embed network distance measurements in a coordinate system,
were introduced as a method for determining the proximity of nodes for routing table updates …
were introduced as a method for determining the proximity of nodes for routing table updates …
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-
state routing in full-mesh networks. Prior techniques for this setting scale poorly, as each …
state routing in full-mesh networks. Prior techniques for this setting scale poorly, as each …