Science Explorer Back to mapMap

Most cited papers in Network Packet Processing and Optimization

Network Packet Processing and Optimization

What are the most cited papers in Network Packet Processing and Optimization?

The most cited paper in Network Packet Processing and Optimization is "Fast Parallel Algorithms for Short-Range Molecular Dynamics" (Steven J. Plimpton, 1995), with 45,350 citations. Next come "Fibonacci heaps and their uses in improved network optimization algorithms" (2,695) and "A guided tour to approximate string matching" (2,595).

Showing 50 of 98 papers. Every paper with more than 372 citations is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Fast Parallel Algorithms for Short-Range Molecular Dynamics Steven J. Plimpton · Journal of Computational Physics Mar 1995 45,350
2 Fibonacci heaps and their uses in improved network optimization algorithms Michael L. Fredman, Robert Endre Tarjan · Journal of the ACM Open access Jul 1987 2,695
3 A guided tour to approximate string matching Gonzalo Navarro · ACM Computing Surveys Open access Mar 2001 2,595
4 Network Applications of Bloom Filters: A Survey Andrei Broder, Michael Mitzenmacher · Internet Mathematics Open access 2004 2,003
5 Linear pattern matching algorithms Peter D. Weiner Conference paper Oct 1973 1,836
6 Summary cache: a scalable wide-area Web cache sharing protocol Li Fan, Pei Cao, Jussara Marques Almeida et al. · IEEE/ACM Transactions on Networking Jun 2000 1,827
7 A survey of techniques for internet traffic classification using machine learning Thuy Nguyen Thi Thu, Grenville J. Armitage · IEEE Communications Surveys & Tutorials Open access 2008 1,670
8 On-line construction of suffix trees Esko Ukkonen · Algorithmica Sep 1995 1,485
9 Efficient randomized pattern-matching algorithms Richard M. Karp, Michael O. Rabin · IBM Journal of Research and Development Mar 1987 1,301
10 Parallel Prefix Computation Richard E. Ladner, Michael J. Fischer · Journal of the ACM Open access Oct 1980 1,289
11 A Deep Learning Approach for Network Intrusion Detection System Ahmad Y. Javaid, Quamar Niyaz, Weiqing Sun et al. Conference paperOpen access 2016 1,286
12 Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey K. Pagiamtzis, Ali Sheikholeslami · IEEE Journal of Solid-State Circuits Mar 2006 1,240
13 A linear space algorithm for computing maximal common subsequences D. S. Hirschberg · Communications of the ACM Open access Jun 1975 1,116
14 The evaluation of Network Anomaly Detection Systems: Statistical analysis of the UNSW-NB15 data set and the comparison with the KDD99 data set Nour Moustafa, Jill Slay · Information Security Journal A Global Perspective 11 Jan 2016 1,107
15 Determinant based configuration interaction algorithms for complete and restricted configuration interaction spaces Jeppe Olsen, Björn Olof Roos, Poul Jo rgensen et al. · The Journal of Chemical Physics 15 Aug 1988 1,106
16 DN-DETR: Accelerate DETR Training by Introducing Query DeNoising Feng Li, Hao Zhang, Shilong Liu et al. · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Conference paper Jun 2022 1,030
17 A Normalized Levenshtein Distance Metric Yujian Li, Bo Liu · IEEE Transactions on Pattern Analysis and Machine Intelligence 25 Apr 2007 985
18 The BSD packet filter: a new architecture for user-level packet capture Steven McCanne, Van L. Jacobson 25 Jan 1993 868
19 Toward the Accurate Identification of Network Applications Andrew William Moore, Konstantina Papagiannaki · Lecture notes in computer science Conference paper 2005 796
20 Forwarding metamorphosis Pat Bosshart, Glen Gibb, Hun-Seok Kim et al. Conference paperOpen access 13 Aug 2013 782
21 A reconfigurable fabric for accelerating large-scale datacenter services Andrew R. Putnam et al. · ACM SIGARCH Computer Architecture News 14 Jun 2014 709
22 A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classification Nigel Williams, Sebastian Zander, Grenville J. Armitage · ACM SIGCOMM Computer Communication Review 10 Oct 2006 699
23 Network support for IP traceback Stefan Savage, David J. Wetherall, Anna R. Karlin et al. · IEEE/ACM Transactions on Networking Jun 2001 681
24 The design and implementation of open vSwitch Ben Pfaff, Justin Pettit, Teemu Koponen et al. · Networked Systems Design and Implementation 2015 669
25 Scalable high speed IP routing lookups Marcel Waldvogel, George Varghese, Jon S. Turner et al. Conference paperOpen access Oct 1997 666
26 A survey of longest common subsequence algorithms Lasse Bergroth, Harri Hakonen, Timo Raita Conference paper 7 Nov 2002 656
27 Algorithms for packet classification Pravir Singh Gupta, Nick McKeown · IEEE Network 2001 655
28 Firewalls and Internet Security: Repelling the Wily Hacker William Cheswick, Steven M. Bellovin, Aviel D. Rubin · CERN Document Server (European Organization for Nuclear Research) 6 Mar 2003 649
29 Header space analysis: static checking for networks Peyman Kazemian, George Varghese, Nick McKeown 25 Apr 2012 625
30 Evaluating associativity in CPU caches M.D. Hill, Alan Jay Smith · IEEE Transactions on Computers 1989 610
31 ESE Song Han, Junlong Kang, Huizi Mao et al. Conference paper 2 Feb 2017 603
32 Packet classification on multiple fields Pankaj Gupta, Nick McKeown Conference paperOpen access 30 Aug 1999 597
33 Intrusion detection systems and multisensor data fusion T. Bass · Communications of the ACM Open access Apr 2000 594
34 Core based trees (CBT) Tony Ballardie, Paul Francis, Jon Crowcroft Conference paperOpen access Oct 1993 593
35 Approximate String Matching Patrick A. V. Hall, Geoff R. Dowling · ACM Computing Surveys Open access Dec 1980 592
36 Small forwarding tables for fast routing lookups Mikael Degermark, Andrej Brodnik, Svante Carlsson et al. Conference paperOpen access Oct 1997 591
37 Frenetic Nate Foster, Rob Harrison, Michael J. Freedman et al. · ACM SIGPLAN Notices 18 Sep 2011 587
38 An improved error model for noisy channel spelling correction Eric Brill, Robert C. Moore Conference paperOpen access 2000 543
39 CorrAUC: A Malicious Bot-IoT Traffic Detection Method in IoT Network Using Machine-Learning Techniques Muhammad Faisal Shafiq, Zhihong Tian, Ali Kashif Bashir et al. · IEEE Internet of Things Journal Open access 15 Jun 2020 541
40 Packet classification using multidimensional cutting Sumeet R. Singh, Florin Baboescu, George Varghese et al. Conference paperOpen access 25 Aug 2003 540
41 Understanding BGP misconfiguration Ratul Mahajan, David J. Wetherall, Tom Anderson Conference paperOpen access 19 Aug 2002 533
42 Fast Regular Expression Matching Using FPGAs Reetinder P. S. Sidhu, Viktor K. Prasanna 29 Apr 2001 533
43 Scalable flow-based networking with DIFANE Minlan Yu, Jennifer Rexford, Michael J. Freedman et al. Conference paperOpen access 30 Aug 2010 527
44 Honeycomb Christian Kreibich, Jon Crowcroft · ACM SIGCOMM Computer Communication Review 2004 526
45 Survey and taxonomy of packet classification techniques David E. Taylor · ACM Computing Surveys Open access Sep 2005 525
46 The stable paths problem and interdomain routing Timothy G. Griffin, F. Bruce Shepherd, Gordon Wilfong · IEEE/ACM Transactions on Networking Apr 2002 518
47 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs Harold N. Gabow, Zvi Galil, Thomas H. Spencer et al. · COMBINATORICA Jun 1986 517
48 Automated traffic classification and application identification using machine learning Sebastian Zander, T. Nguyen, G. Armitage Conference paperOpen access 2005 514
49 Algorithms to accelerate multiple regular expressions matching for deep packet inspection Sailesh Kumar, Sarang Dharmapurikar, Yu Fang et al. · ACM SIGCOMM Computer Communication Review 11 Aug 2006 511
50 Software defined traffic measurement with OpenSketch Minlan Yu, Lavanya Jose, Rui Miao 2 Apr 2013 511

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.