Dynamic analysis of the Arrow distributed directory protocol in general networks

DOI10.4230/LIPICS.DISC.2017.22MaRDI QIDQ6487494zbMATH OpenFDO

Authors Abdolhamid Ghodselahi, Fabian Kuhn

Publication date 3 February 2023

zbMATH Keywords

competitive analysisshared objectstree embeddingsArrow protocoldistributed queueing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Dynamic analysis of the arrow distributed protocol
• Low complexity variants of the arrow distributed directory
• Competitive concurrent distributed queuing
• scientific article; zbMATH DE number 2006654
• Dynamic tree algorithms

Cited in

(4)

• Load balanced distributed directories
• An analysis framework for distributed hierarchical directories
• Dynamic analysis of the arrow distributed protocol
• Competitive concurrent distributed queuing

This page was built for publication: Dynamic analysis of the Arrow distributed directory protocol in general networks

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