Brief announcement: an analysis framework for distributed hierarchical directories

Authors:
Gokarna Sharma;Costas Busch
Affiliations:
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA;School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 4
Cited 0

Concurrent online tracking of mobile users

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
The Arrow Distributed Directory Protocol

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Dynamic Analysis of the Arrow Distributed Protocol

Theory of Computing Systems
Distributed Transactional Memory for General Networks

IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed hierarchical directories are data structures that enable one to access shared objects whenever needed. These directories are used to implement fundamental coordination problems in distributed systems, including distributed transactional memory [4,5], distributed queues [2], and mobile object tracking [1]. These directories support access to the shared objects in a network through three basic operations: (i) publish, allowing a shared object to be inserted in the directory so that other nodes can find it; (ii) lookup, providing a read-only copy of the object to the requesting node; and (iii) move, allowing the requesting node to write the object locally after getting it.