The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
PLAN: a packet language for active networks
Abstract
PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudimentary programs) used in current networks. As such, PLAN programs are lightweight and of restricted functionality. These limitations are mitigated by allowing PLAN code to call node-resident service routines written in other, more powerful languages. This two-level architecture, in which PLAN serves as a scripting or 'glue' language for more general services, is the primary contribution of this paper. We have successfully applied the PLAN programming environment to implement an IP-free internetwork.PLAN is based on the simply typed lambda calculus and provides a restricted set of primitives and datatypes. PLAN defines a special construct called a chunk used to describe the remote execution of PLAN programs on other nodes. Primitive operations on chunks are used to provide basic data transport in the network and to support layering of protocols. Remote execution can make debugging difficult, so PLAN provides strong static guarantees to the programmer, such as type safety. A more novel property aimed at protecting network availability is a guarantee that PLAN programs use a bounded amount of network resources.
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
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
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Postel, J. (1980) · doi:10.17487/rfc0768 · Cited by 2,223
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Internet Protocol, Version 6 (IPv6) Specification
Deering, S., & Hinden, R. (2017) · doi:10.17487/rfc8200 · Cited by 1,520
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
Postel, J. B. (1981) · Cited by 1,130
Internet Control Message Protocol
Postel, J. (1981) · doi:10.17487/rfc0777 · Cited by 866
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
Cited by
The Role of Trust Management in Distributed Systems Security
Blaze, M., Feigenbaum, J., Ioannidis, J., & Keromytis, A. D. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48749-2_8 · Cited by 489
Design and implementation of a framework for efficient and programmable sensor networks
Boulis, A., Han, C.-C., & Srivastava, M. B. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1066121 · Cited by 287
Metadata
- Authors
- Hicks, M., Kakkar, P., Moore, J. T., Gunter, C. A., & Nettles, S.
- Venue
- Proceedings of the third ACM SIGPLAN international conference on Functional programming
- Publisher
- ACM
- Published
- 1998-09-29
- Pages
- 86-93
- OpenAlex
- W2155814128
- Cited by
- 266
- References
- 31
- FWCI
- 21.92
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PLAN: a packet language for active networks. https://app.cochat.ai/papers/10.1145/289423.289431
- The paper
- Hicks, M., Kakkar, P., Moore, J. T., Gunter, C. A., & Nettles, S. (1998). PLAN: a packet language for active networks. Proceedings of the third ACM SIGPLAN international conference on Functional programming. https://doi.org/10.1145/289423.289431
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.