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

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.22

zbMATH Keywords

Arrow protocolcompetitive analysisdistributed queueingshared objectstree embeddings

Mathematics Subject Classification ID

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

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
• Competitive concurrent distributed queuing
• Dynamic analysis of the arrow distributed protocol

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)