• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A Scalable Distributed Information Management System

Cached

  • Download as a PDF

Download Links

  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [cs.baylor.edu]
  • [www.cs.utexas.edu]
  • [www.ssrc.ucsc.edu]
  • [www.sigcomm.org]
  • [www.acm.org]
  • [acm.org]
  • [www.cs.berkeley.edu]
  • [www.cs.utexas.edu]
  • [now.cs.berkeley.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [conferences.sigcomm.org]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [cs.ecs.baylor.edu]
  • [www.cs.utexas.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.utexas.edu]
  • [cs.ecs.baylor.edu]
  • [www.cs.utexas.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Praveen Yalagandula , Mike Dahlin
Citations:190 - 17 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Yalagandula_ascalable,
    author = {Praveen Yalagandula and Mike Dahlin},
    title = { A Scalable Distributed Information Management System },
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building block for a broad range of large-scale distributed applications by providing detailed views of nearby information and summary views of global information. To serve as a basic building block, a SDIMS should have four properties: scalability to many nodes and attributes, flexibility to accommodate a broad range of applications, administrative isolation for security and availability, and robustness to node and network failures. We design, implement and evaluate a SDIMS that (1) leverages Distributed Hash Tables (DHT) to create scalable aggregation trees, (2) provides flexibility through a simple API that lets applications control propagation of reads and writes, (3) provides administrative isolation through simple extensions to current DHT algorithms, and (4) achieves robustness to node and network reconfigurations through lazy reaggregation, on-demand reaggregation, and tunable spatial replication. Through extensive simulations and micro-benchmark experiments, we observe that our system is an order of magnitude more scalable than existing approaches, achieves isolation properties at the cost of modestly increased read latency in comparison to flat DHTs, and gracefully handles failures.

Keyphrases

information management    information management system    broad range    administrative isolation    basic building block    isolation property    summary view    many node    on-demand reaggregation    micro-benchmark experiment    detailed view    network reconfigurations    global information    scalable aggregation tree    large-scale networked system    current dht algorithm    extensive simulation    simple extension    simple api    hash table    read latency    lazy reaggregation    tunable spatial replication    nearby information    network failure    flat dhts   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University