The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Cluster-based scalable network services
Open accessAbstract
We identifit three fundamental requirements for scalable network services: incremental scalability and oveflow growth provisioning, 24x7 availability through fault masking, and costeffectiveness.We argue that clusters of commodity workstations interconnected by a high-speed SAN are exceptionally well-suited to meeting these challenges for Internet-server workloads, provided the software infrastructure for managing partial failures and administering a large cluster does not have to be reinvented for each new service.To this end, we propose a general, layered architecture for building cluster-based scalable network services that encapsulates the above requirements for reuse, and a service-programming model based on composable workers thatpe$onn transformation, aggregation, caching, i and customization (TACC) of Internet content.For both performance and implementation simplicity, the architecture and TACC programming model exploit BASE, a weaker-than-ACID data semantics that results from trading consistency for availability and relying on sof state for robustness in failure management., Our ,qychitecture can be used as an "off the shelf * irtfrastructural platfonn for creating new network services, allowing authors to focus on the "content" of the service {by composing TACC building blocks) rather than its implementation.We discuss two real implemeritations of services based on this architecture: TranSend, a Web distillation proxy deployed to the UC Berkeley dialup IP population, and HotBot, the commercial implementation of the Inktomi search engine.We present detailed measurements of TranSend's performance based on substantial client traces, as well as anecdotal evidence from the TranSend and HotBot experience, to support the claims made for the architecture.
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
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Hypertext Transfer Protocol (HTTP)
(2003) · The Hacker's Handbook · doi:10.1201/9780203490044-20 · Cited by 2,824
Ousterhout, J. K. (1994) · Cited by 1,627
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
A case for NOW (Networks of Workstations)
Anderson, T. E., Culler, D. E., & Patterson, D. (1995) · IEEE Micro · doi:10.1109/40.342018 · Cited by 798
Improving TCI/IP performance over wireless networks
Balakrishnan, H., Seshan, S., Amir, E., & Katz, R. H. (1995) · Proceedings of the 1st annual international conference on Mobile computing and networking - MobiCom '95 · doi:10.1145/215530.215544 · Cited by 757
A Hierarchical Internet Object Cache
Chankhunthod, A., Danzig, P. B., Neerdaels, C., Schwartz, M. F., & Worrell, K. J. (1995) · doi:10.21236/ada446612 · Cited by 689
The New Routing Algorithm for the ARPANET
McQuillan, J., Richer, I., & Rosen, E. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094721 · Cited by 686
The PIM architecture for wide-area multicast routing
Deering, S., Estrin, D. L., Farinacci, D., Jacobson, V., Liu, C.-G., & Wei, L. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.490743 · Cited by 655
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
TreadMarks: distributed shared memory on standard workstations and operating systems
Keleher, P. J., Cox, A. L., Dwarkadas, S., et al. (1994) · Cited by 635
The transaction concept: virtues and limitations
Gray, J. (1988) · Cited by 608
An empirical model of HTTP network traffic
Mah, B. A. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1997.644510 · Cited by 478
Birrell, A. D., Levin, R., Schroeder, M. D., & Needham, R. M. (1982) · Communications of the ACM · doi:10.1145/358468.358487 · Cited by 440
Development of the Domain Name System
Mockapetris, P. V., & Dunlap, K. J. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205459 · Cited by 350
Introduction and overview of the multics system
Corbató, F. J., & Vyssotsky, V. A. (1965) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1463891.1463912 · Cited by 342
Adapting to network and client variability via on-demand dynamic distillation
Fox, A., Gribble, S. D., Brewer, E. A., & Amir, E. (1996) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/237090.237177 · Cited by 339
Self-citationThe “worm” programs—early experience with a distributed computation
Shoch, J. F., & Hupp, J. A. (1999) · International Conference on Mobile Technology, Applications, and Systems · Cited by 284
Digestor: device-independent access to the World Wide Web
Bickmore, T. W., & Schilit, B. N. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00026-3 · Cited by 235
Privacy-enhancing technologies for the Internet
Goldberg, I., Wagner, D., & Brewer, E. (2002) · Proceedings IEEE COMPCON 97. Digest of Papers · doi:10.1109/cmpcon.1997.584680 · Cited by 180
Self-citationExplaining World Wide Web Traffic Self-Similarity
Crovella, M. E., & Azer Bestavros, C. (1995) · Cited by 176
Barrett, R., Maglio, P. P., & Kellem, D. C. (1997) · Proceedings of the ACM SIGCHI Conference on Human factors in computing systems · doi:10.1145/258549.258595 · Cited by 163
Development of the domain name system
Mockapetris, P. V., & Dunlap, K. J. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52338 · Cited by 115
The New Hacker's Dictionary, 2nd Ed.
Raymond, E. S., & Steele, G. L. (1993) · The MIT Press eBooks · Cited by 73
Kaashoek, M. F., Engler, D., Ganger, G. R., & Wallach, D. A. (1996) · ACM SIGOPS European Workshop · doi:10.1145/504450.504478 · Cited by 71
Meeker, M. (1996) · Cited by 58
Cited by
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
“This has been widely acknowledged by both the industry and academia [5].”
BackgroundMapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Metadata
- Authors
- Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P.
- Venue
- Proceedings of the sixteenth ACM symposium on Operating systems principles
- Publisher
- ACM
- Published
- 1997-10
- Pages
- 78-91
- OpenAlex
- W2044534358
- Cited by
- 522
- References
- 27
- FWCI
- 28.03
- Type
- conference paper
- Language
- en
- Open access
- gold
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.