F-Chord: Improved uniform routing on Chord

DOI10.1002/NET.20253MaRDI QIDQ3548733zbMATHOpenAlexFDO

Authors Gennaro Cordasco, Alberto Negro, Vittorio Scarano, Mikael Hammar, Luisa Gargano

Publication date 17 December 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20253

zbMATH Keywords

Fibonacci numbersgreedy routingpeer-to-peeroverlay networkuniform routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 2013835
• scientific article; zbMATH DE number 6469145
• Fault-tolerant routings in chordal ring networks
• Compact Routing In Chordal Grids And Other Networks
• scientific article; zbMATH DE number 1953090
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Distributed computing of efficient routing schemes in generalized chordal graphs
• FIR: an efficient routing strategy for tori and meshes

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 6469145 (Why is no real title available?)
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Optimum lopsided binary trees
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(4)

• Structural Information and Communication Complexity
• A peer-to-peer expressway over Chord
• \(Chord^{2}\): A two-layer Chord for reducing maintenance overhead via heterogeneity
• Random Subsets of the Interval and P2P Protocols

This page was built for publication: F-Chord: Improved uniform routing on Chord

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