The DOI matches its Crossref record.
Internet Control Message Protocol
Abstract
The Internet Protocol (IP) [1] is used for host-to-host datagram service in a system of interconnected networks called the Catenet [2]. The network connecting devices are called Gateways. These gateways communicate between themselves for control purposes
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
Cited by
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
Inferring Internet Denial-of-Service Activity
Moore, D., Voelker, G. M., & Savage, S. (2001) · doi:10.21236/ada400003 · Cited by 863
Inferring Internet denial-of-service activity
Moore, D., Shannon, C., Brown, D. J., Voelker, G. M., & Savage, S. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1132026.1132027 · Cited by 781
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
A survey of covert channels and countermeasures in computer network protocols
Zander, S., Armitage, G., & Branch, P. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317620 · Cited by 561
Security problems in the TCP/IP protocol suite
Bellovin, S. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/378444.378449 · Cited by 550
Remote Physical Device Fingerprinting
Kohno, T., Broido, A., & Claffy, K. C. (2005) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2005.26 · Cited by 521
Cryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
An analysis of using reflectors for distributed denial-of-service attacks
Paxson, V. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505659.505664 · Cited by 402
Morris, R., Kohler, E., Jannotti, J., & Kaashoek, M. F. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319166 · Cited by 363
Towards an accurate AS-level traceroute tool
Mao, Z. M., Rexford, J., Wang, J., & Katz, R. H. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863996 · Cited by 351
GreenCloud: A Packet-Level Simulator of Energy-Aware Cloud Computing Data Centers
Kliazovich, D., Bouvry, P., Audzevich, Y., & Khan, S. U. (2010) · 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 · doi:10.1109/glocom.2010.5683561 · Cited by 299
Collaborative Detection of DDoS Attacks over Multiple Network Domains
Chen, Y., Hwang, K., & Ku, W.-S. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1111 · Cited by 278
PLAN: a packet language for active networks
Hicks, M., Kakkar, P., Moore, J. T., Gunter, C. A., & Nettles, S. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289431 · Cited by 266
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
A survey and critical analysis on energy generation from datacenter
Mandal, R., Mondal, M. K., Banerjee, S., Chakraborty, C., & Biswas, U. (2021) · Data Deduplication Approaches · doi:10.1016/b978-0-12-823395-5.00005-7 · Cited by 11
Metadata
- Authors
- Postel, J.
- Publisher
- RFC Editor
- Published
- 1981-04
- OpenAlex
- W1920802909
- Cited by
- 866
- References
- 0
- Type
- report
- 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.