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.
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
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
Postel, J. B. (1981) · doi:10.17487/rfc0791 · Cited by 802
Hedrick, C. L. (1988) · doi:10.17487/rfc1058 · Cited by 765
Management Information Base for Network Management of TCP/IP-based internets:MIB-II
McCloghrie, K., & Rose, M. (1991) · doi:10.17487/rfc1213 · Cited by 629
ANTS: a toolkit for building and dynamically deploying network protocols
Wetherall, D. J., Guttag, J. V., & Tennenhouse, D. L. (2002) · 1998 IEEE Open Architectures and Network Programming · doi:10.1109/opnarc.1998.662048 · Cited by 593
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Internet Protocol Version 6 (IPv6)
(2020) · doi:10.1002/9781119660286.ch17 · Cited by 528
Safe kernel extensions without run-time checking
Necula, G. C., & Lee, P. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238781 · Cited by 505
PostScript Language Reference Manual
Press, A. (1985) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 317
The SwitchWare active network architecture
Alexander, D. S., Arbaugh, W. A., Hicks, M. W., Kakkar, P., Keromytis, A. D., Moore, J. T., Gunter, C. A., Nettles, S. M., & Smith, J. M. (1998) · IEEE Network · doi:10.1109/65.690959 · Cited by 290
Self-citationA dynamic network architecture
O'Malley, S. W., & Peterson, L. L. (1992) · ACM Transactions on Computer Systems · doi:10.1145/128899.128901 · Cited by 273
Smart Packets for active networks
Schwartz, B., Jackson, A. W., Strayer, W. T., Zhou, W., Rockwell, R. D., & Partridge, C. (1999) · 1999 IEEE Second Conference on Open Architectures and Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252) · doi:10.1109/opnarc.1999.758557 · Cited by 199
Building adaptive systems using ensemble
Renesse, R. V., Birman, K., Hayden, M., Vaysburd, A., & Karr, D. (1998) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(19980725)28:9<963::aid-spe179>3.0.co;2-9 · Cited by 195
Active networks: Applications, security, safety, and architectures
Psounis, K. (1999) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.1999.5340509 · Cited by 184
TALx86: A Realistic Typed Assembly Language∗
Morrisett, G., Crary, K., Glew, N., Grossman, D., Samuels, R. J., Frederick Smith, Y., Walker, D., Weirich, S., & Zdancewic, S. (1999) · Cited by 183
Active network vision and reality: lessions from a capsule-based system
Wetherall, D. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319156 · Cited by 173
Implementing multiple protection domains in java
Hawblitzel, C., Chang, C.-C., Czajkowski, G., Hu, D., & von Eicken, T. (1998) · eCommons (Cornell University) · Cited by 150
A secure active network environment architecture: realization in SwitchWare
Alexander, D. S., Arbaugh, W. A., Keromytis, A. D., & Smith, J. M. J. (1998) · IEEE Network · doi:10.1109/65.690960 · Cited by 129
PAN: a high-performance active network node supporting multiple mobile code systems
Nygren, E., Garland, S. J., & Kaashoek, M. F. (1999) · IEEE Conference on Open Architectures and Network Programming (OPENARCH) · doi:10.1109/opnarc.1999.758497 · Cited by 60
Safe and efficient active network programming
Thibault, S., Consel, C., & Muller, G. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1998.740484 · Cited by 52
Hicks, M., & Keromytis, A. D. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48507-0_28 · Cited by 51
Self-citationDesign and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing
Moreau, L., & Queinnec, C. (1997) · ePrints Soton (University of Southampton) · Cited by 28
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
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.