The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An architecture for a secure service discovery service
Open accessAbstract
The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an interesting problem for end users: how to locate a particular network service or device out of hundreds of thousands of accessible services and devices.This paper presents the architecture and implementation of a secure Service Discovery Service (SDS).Service providers use the SDS to advertise complex descriptions of available or already running services, while clients use the SDS to compose complex queries for locating these services.Service descriptions and queries use the extensible Markup Language (XML) to encode such factors as cost, performance, location, and device-or service-specific capabilities.The SDS provides a highlyavailable, fault-tolerant, incrementally scalable service for locating services in the wide-area.Security is a core component of the SDS and, where necessary, communications are both encrypted and authenticated.Furthermore, the SDS uses an hybrid access control list and capability system to control access to service information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Computer for the 21st Century
Weiser, M. (1991) · Scientific American · doi:10.1038/scientificamerican0991-94 · Cited by 10,017
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
RTP: A Transport Protocol for Real-Time Applications
Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (2003) · doi:10.17487/rfc3550 · Cited by 5,776
A Extensible Markup Language XML
(2009) · Foundations of Semantic Web Technologies · doi:10.1201/9781420090512-18 · Cited by 4,824
Host extensions for IP multicasting
Deering, S. (1986) · doi:10.17487/rfc1112 · Cited by 1,344
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
Description of a new variable-length key, 64-bit block cipher (Blowfish)
Schneier, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58108-1_24 · Cited by 791
Matchmaking: distributed resource management for high throughput computing
Raman, R., Livny, M., & Solomon, M. (2002) · Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244) · doi:10.1109/hpdc.1998.709966 · Cited by 747
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
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285287 · Cited by 422
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
Development of the domain name system
Mockapetris, P., & Dunlap, K. J. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52338 · Cited by 161
Cited by
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
The Cricket location-support system
Priyantha, N. B., Chakraborty, A., & Balakrishnan, H. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345917 · Cited by 3,716
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Metadata
- Authors
- Czerwinski, S. E., Zhao, B. Y., Hodes, T. D., Joseph, A. D., & Katz, R. H.
- Venue
- Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 24-35
- OpenAlex
- W1989163006
- Cited by
- 610
- References
- 12
- FWCI
- 196.71
- 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.