The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining
Abstract
Scalable management and self-organizational capabilities are emerging as central requirements for a generation of large-scale, highly dynamic, distributed applications. We have developed an entirely new distributed information management system called Astrolabe. Astrolabe collects large-scale system state, permitting rapid updates and providing on-the-fly attribute aggregation. This latter capability permits an application to locate a resource, and also offers a scalable way to track system state as it evolves over time. The combination of features makes it possible to solve a wide variety of management and self-configuration problems. This paper describes the design of the system with a focus upon its scalability. After describing the Astrolabe service, we present examples of the use of Astrolabe for locating resources, publish-subscribe, and distributed synchronization in large systems. Astrolabe is implemented using a peer-to-peer protocol, and uses a restricted form of mobile code based on the SQL query language for aggregation. This protocol gives rise to a novel consistency model. Astrolabe addresses several security considerations using a built-in PKI. The scalability of the system is evaluated using both simulation and experiments; these confirm that Astrolabe could scale to thousands and perhaps millions of nodes, with information propagation delays in the tens of seconds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Design and evaluation of a wide-area event notification service
Carzaniga, A., Rosenblum, D. S., & Wolf, A. L. (2001) · ACM Transactions on Computer Systems · doi:10.1145/380749.380767 · Cited by 1,425
A survey of active network research
Tennenhouse, D. L., Smith, J. M., Sincoskie, W. D., Wetherall, D. J., & Minden, G. J. (1997) · IEEE Communications Magazine · doi:10.1109/35.568214 · Cited by 1,358
An integrated experimental environment for distributed systems and networks
White, B., Lepreau, J., Stoller, L. B., Ricci, R., Guruprasad, S., Newbold, M., Hibler, M., Barb, C., & Joglekar, A. A. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844152 · Cited by 1,302
Towards Sensor Database Systems
Bonnet, P., Gehrke, J., & Seshadri, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44498-x_1 · Cited by 791
The design and implementation of an intentional naming system
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., & Lilley, J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319164 · Cited by 673
Birman, K. P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., & Minsky, Y. (1999) · ACM Transactions on Computer Systems · doi:10.1145/312203.312207 · Cited by 654
Self-citationMatching events in a content-based subscription system
Aguilera, M. K., Strom, R. E., Sturman, D. C., Astley, M., & Chandra, T. D. (1999) · Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing · doi:10.1145/301308.301326 · Cited by 638
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
Self-citationBuilding efficient wireless sensor networks with low-level naming
Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., & Ganesan, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502049 · Cited by 598
A Gossip-Style Failure Detection Service
van Renesse, R., Minsky, Y., & Hayden, M. (1998) · Middleware’98 · doi:10.1007/978-1-4471-1283-9_4 · Cited by 496
Self-citationFlexible update propagation for weakly consistent replication
Petersen, K., Spreitzer, M. J., Terry, D. B., Theimer, M. M., & Demers, A. J. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266711 · Cited by 475
Birrell, A. D., Levin, R., Schroeder, M. D., & Needham, R. M. (1982) · Communications of the ACM · doi:10.1145/358468.358487 · Cited by 440
The Information Bus: an architecture for extensible distributed systems
Oki, B., Pfluegl, M., Siegel, A., & Skeen, D. (1993) · Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93 · doi:10.1145/168619.168624 · Cited by 401
Mesh-based content routing using XML
Snoeren, A. C., Conley, K., & Gifford, D. K. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502050 · Cited by 186
Designing a global name service
Lampson, B. W. (1986) · Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86 · doi:10.1145/10590.10591 · Cited by 167
Proceedings of the 28th ACM symposium on Principles of distributed computing
(2009) · doi:10.1145/1582716 · Cited by 118
A WEAK-CONSISTENCY ARCHITECTURE FOR DISTRIBUTED INFORMATION SERVICES
Golding, R. A. (1992) · Cited by 62
Collaborative networking in an uncooperative Internet
van Renesse, R., & Dumitriu, D. (2003) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.2002.1180173 · Cited by 2
Cited by
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Processing flows of information: From data stream to complex event processing
Cugola, G., & Margara, A. (2012) · ACM Computing Surveys · doi:10.1145/2187671.2187677 · Cited by 833
Rodrigues, R., & Druschel, P. (2010) · Communications of the ACM · doi:10.1145/1831407.1831427 · Cited by 562
Epidemic information dissemination in distributed systems
Eugster, P. T., Guerraoui, R., Kermarrec, A.-M., & Massoulie, L. (2004) · Computer · doi:10.1109/mc.2004.1297243 · Cited by 500
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., & van Steen, M. (2007) · ACM Transactions on Computer Systems · doi:10.1145/1275517.1275520 · Cited by 494
Metadata
- Authors
- Van Renesse, R., Birman, K. P., & Vogels, W.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2003-05
- Volume
- 21
- Issue
- 2
- Pages
- 164-206
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W1997369208
- Cited by
- 645
- References
- 24
- FWCI
- 82.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.