D2B: A de Bruijn based content-addressable network

DOI10.1016/j.tcs.2005.12.006zbMath1088.68016OpenAlexW2110188594MaRDI QIDQ2368967

Pierre Fraigniaud, Philippe Gauron

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.006

zbMATH Keywords

de Bruijn graphDHTP2POverlay network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Degree-optimal routing for P2P systems ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Optimal strategies in the average consensus problem ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ Psu: a novel low-latency constant-degree overlay network ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Probabilistic quorums for dynamic systems ⋮ SKY: efficient peer-to-peer networks based on distributed Kautz graphs ⋮ A note on models for graph representations ⋮ Estimating network size from local information

Uses Software

• Chord
• Pastry

Cites Work

• Accessing nearby copies of replicated objects in a distributed environment
• The small-world phenomenon
• Know thy neighbor's neighbor
• Balanced Allocations
• Broadcasting and Gossiping in de Bruijn Networks
• Viceroy
• Active and Concurrent Topology Maintenance
• Eclecticism shrinks even small worlds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: D2B: A de Bruijn based content-addressable network