D2B: A de Bruijn based content-addressable network

DOI10.1016/J.TCS.2005.12.006MaRDI QIDQ2368967zbMATH OpenOpenAlexFDO

Authors 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 graphDHTOverlay networkP2P

Mathematics Subject Classification ID

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

Recommendations

• A self-stabilizing general de Bruijn graph
• \(D^{2}\)-tree: a new overlay with deterministic bounds
• scientific article; zbMATH DE number 1931813
• Novel architectures for P2P applications: the continuous-discrete approach
• SKY: efficient peer-to-peer networks based on distributed Kautz graphs

Cites work

• Accessing nearby copies of replicated objects in a distributed environment
• Active and Concurrent Topology Maintenance
• Balanced Allocations
• Broadcasting and Gossiping in de Bruijn Networks
• Eclecticism shrinks even small worlds
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• scientific article; zbMATH DE number 1947402 (Why is no real title available?)
• scientific article; zbMATH DE number 2006658 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1931792 (Why is no real title available?)
• scientific article; zbMATH DE number 1931815 (Why is no real title available?)
• scientific article; zbMATH DE number 2119648 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
• The small-world phenomenon: an algorithmic perspective
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(13)

• A note on models for graph representations
• Estimating network size from local information
• Probabilistic quorums for dynamic systems
• SKY: efficient peer-to-peer networks based on distributed Kautz graphs
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• \(D^{2}\)-tree: a new overlay with deterministic bounds
• Survey of DHT topology construction techniques in virtual computing environments
• Psu: a novel low-latency constant-degree overlay network
• A self-stabilizing general de Bruijn graph
• Resource Burning for Permissionless Systems (Invited Paper)
• A review of decision diagrams in system reliability modeling and analysis
• Degree-optimal routing for P2P systems
• Optimal strategies in the average consensus problem

Describes a project that uses

Uses Software

• Chord
• Pastry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368967)