A novel constant degree and constant congestion DHT scheme for peer-to-peer networks

zbMATH Open1161.68683MaRDI QIDQ866162FDOQ866162

Authors: Dongsheng Li, Xicheng Lu 

Publication date: 20 February 2007

Published in: Science in China. Series F (Search for Journal in Brave)

Recommendations

• Euro-Par 2004 Parallel Processing
• Degree-optimal routing for P2P systems
• Dual decomposition method for optimal and fair congestion control in ad hoc networks: algorithm, implementation and evaluation

Mathematics Subject Classification ID

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

Cited In (4)

• Using uncertainty DHT to solve non-transitive connectivity problems in overlay network
• Euro-Par 2004 Parallel Processing
• SKY: efficient peer-to-peer networks based on distributed Kautz graphs
• Psu: a novel low-latency constant-degree overlay network

This page was built for publication: A novel constant degree and constant congestion DHT scheme for peer-to-peer networks

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