The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
The click modular router
Open accessAbstract
Clicks is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queuing, scheduling, and interfacing with network devices. A router configurable is a directed graph with elements at the vertices; packets flow along the edges of the graph. Several features make individual elements more powerful and complex configurations easier to write, including pull connections,which model packet flow drivn by transmitting hardware devices, and flow-based router context,which helps an element locate other interesting elements. Click configurations are modular and easy to extend. A standards-compliant Click IP router has 16 elements on its forwarding path; some of its elements are also useful in Ethernet switches and IP tunnelling configurations. Extending the IP router to support dropping policies, fairness among flows, or Differentiated Services simply requires adding a couple of element at the right place. On conventional PC hardware, the Click IP router achieves a maximum loss-free forwarding rate of 333,000 64-byte packets per second, demonstrating that Click's modular and flexible architecture is compatible with good performance.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
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
An Architecture for Differentiated Service
Blake, S. L., Black, D. L., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998) · Cited by 5,487
An Architecture for Differentiated Services
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998) · doi:10.17487/rfc2475 · Cited by 3,965
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
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
The BSD packet filter: a new architecture for user-level packet capture
McCanne, S., & Jacobson, V. L. (1993) · Cited by 885
Internet Control Message Protocol
Postel, J. (1981) · doi:10.17487/rfc0777 · Cited by 866
Requirements for IP Version 4 Routers
(1995) · doi:10.17487/rfc1812 · Cited by 462
Eliminating receive livelock in an interrupt-driven kernel
Mogul, J. C., & Ramakrishnan, K. K. (1997) · ACM Transactions on Computer Systems · doi:10.1145/263326.263335 · Cited by 452
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
Self-citationChapman, D. B., Zwicky, E. D., & Russell, D. (1995) · CERN Document Server (European Organization for Nuclear Research) · Cited by 345
Making paths explicit in the Scout operating system
Mosberger, D., & Peterson, L. L. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238771 · Cited by 282
McKenney, P. E. (2002) · Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration · doi:10.1109/infcom.1990.91316 · Cited by 273
Lottery and stride scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 241
Stride Scheduling: Deterministic Proportional- Share Resource Management
Waldspurger, C. A. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 208
Experiences with a high-speed network adaptor: a software perspective
Druschel, P., Peterson, L. L., & Davie, B. S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190315 · Cited by 175
Newman, P., Minshall, G., & Lyon, T. L. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.664261 · Cited by 160
PATHFINDER: A Pattern-Based Packet Classifier
Bailey, M. L., Gopal, B., Pagels, M. A., Peterson, L., & Sarkar, P. (1994) · Cited by 144
A framework for alternate queueing: towards traffic management by PC-UNIX based routers
Cho, K. (1998) · USENIX Annual Technical Conference · Cited by 123
BPF+: exploiting global data-flow optimization in a generalized packet filter architecture
Begel, A., McCanne, S., & Graham, S. L. (1999) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/316188.316214 · Cited by 123
Analysis of techniques to improve protocol processing latency
Mosberger, D., Peterson, L., Bridges, P. G., & O'Malley, S. W. (1996) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/248156.248164 · Cited by 70
Load Sharing using IP Network Address Translation (LSNAT)
Srisuresh, P., & Gan, D.-H. (1998) · doi:10.17487/rfc2391 · Cited by 38
Cited by
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513
A high-throughput path metric for multi-hop wireless routing
De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939000 · Cited by 3,356
Self-citationA scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
P4: programming protocol-independent packet processors
Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Talayco, D., Vahdat, A., Varghese, G., et al. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656890 · Cited by 2,867
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
Metadata
- Authors
- Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2000-08
- Volume
- 18
- Issue
- 3
- Pages
- 263-297
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2010365467
- Cited by
- 2,413
- References
- 25
- FWCI
- 76.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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.