An analysis framework for distributed hierarchical directories

Gokarna Sharma, Costas Busch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We provide a novel analysis framework for distributed hierarchical directories for an arbitrary set of dynamic (online) requests. We prove a general O (η · φ · σ3 · h) competitive ratio for any distributed hierarchical directory, where η is a write set size related parameter, φ and σ are stretch and growth related parameters, and h is the number of levels in the hierarchy. Through this framework, we give bounds for several known distributed directory protocols. In general network topologies, we obtain O (log2 n · log D) competitive ratio, where n and D are the number of nodes and the diameter, respectively, of the network. Moreover, we obtain O (log D) competitive ratio in constant-doubling metric topologies. To the best of our knowledge, this is the first (competitive) dynamic analysis for distributed hierarchical directories.

Original languageEnglish (US)
Title of host publicationDistributed Computing and Networking - 14th International Conference, ICDCN 2013, Proceedings
Pages378-392
Number of pages15
DOIs
StatePublished - 2013
Externally publishedYes
Event14th International Conference on Distributed Computing and Networking, ICDCN 2013 - Mumbai, India
Duration: Jan 3 2013Jan 6 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7730 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Distributed Computing and Networking, ICDCN 2013
Country/TerritoryIndia
CityMumbai
Period1/3/131/6/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'An analysis framework for distributed hierarchical directories'. Together they form a unique fingerprint.

Cite this