Aho A, Corasick M. Efficient string matching: An aid to bibliographic search. Communications of the ACM. 1975;18(6):333–343.
Ahmadi H, Denzel W. A survey of modern high-performance switching techniques. IEEE Journal on Selected Areas in Communication. 1989;7(9):1091–1103.
Aron M, Druschel P. Soft timers: Efficient microsecond timer support for network processing. In: Proceedings of the 17th Symposium on Operating System Principles (SOSP); 1999.
Adisheshu H. Services for next-generation routers. Washington University Computer Science Department; 1998 Ph.D. dissertation.
Alleyne B. Personal communication. 2002.
Ahuja R, Magnanti T, Orlin J. In: Upper Saddle River, NJ: Prentice-Hall; 1993. Network Flows.
Anderson T, Owicki S, Saxe J, Thacker C. High-speed switch scheduling for local area networks. ACM Transactions on Computer Systems. 1993;11(4):319–352.
Awerbuch B, Patt-Shamir B, Varghese G. Self-stabilization by local checking and correction. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science; Oct. 1991.
Albertengo G, Riccardo S. Parallel CRC generation. IEEE Micro. Oct. 1990.
Infiniband Architecture Specification. Infiniband Specification. Oct. 2000.
Infiniband Trade Assocation. Infiniband architecture. At http://www.infinibandta.org/home.
At Web Polygraph Association. Web polygraph. http://www.webpolygraph.org/.
Barile I. I/O multiplexing and scalable socket servers. Dr. Dobbs Journal. Feb. 2004.
Bhattacharyya S, Diot C, Jetcheva J, Taft N. Pop-level and access-link traffic dynamics in a Tier-1 pop. In: SIGCOMM Internet Measurement Workshop. 2001.
Birell A, et al. Grapevine: An exercise in distributed computing. Comm. of the ACM. 1982;25(4):202–208.
Bell ET. In: New York: Touchstone Books; 1986. Men of Mathematics: reissue ed.
Bentley JL. Writing efficient programs. Upper Saddle River, NY: Prentice Hall; 1982.
Benner A. In: New York: McGraw-Hill; 1995. Fiber Channel: Gigabit Communications and I/O for Computer Networks.
Bux W, Grillo D. Flow control in local-area networks of interconnected token rings. IEEE Transactions on Communications. Oct. 1985;COM-33(10):1058–1066.
Buonadonna P, Geweke A, Culler D. An implementation and analysis of the Virtual Interface Architecture. In: SC98: High-Performance Networking and Computing Conference; 2002 San Jose, CA.
Bailey M, Gopal B, Pagels M, Peterson L, Sarkar P. PATHFINDER: A pattern-based packet classifier. In: Proceedings of the First Symposium on Operating Systems Design and Implementation (OSDI); 1994:115–123.
Bhagwan R, Lin W. Fast and scalable priority queue architecture for high-speed network switches. In: IEEE INFOCOM. 2000:538–547.
Blackwell T. Speeding up protocols for small messages. In: Proceedings of ACM SIGCOMM; 1996.
Boyer RS, Moore JS. A fast string searching algorithm. Communications of the ACM. Oct. 1977;20(10):762–772.
Banga G, Mogul J. Scalable kernel performance for Internet servers under realistic loads. In: USENIX Annual Technical Conference. New Orleans; 1998.
Banga G, Mogul J, Druschel P. A scalable and explicit event delivery mechanism for UNIX. In: USENIX Annual Technical Conference. June 1999:253–265.
Boggs DR, Mogul JC, Kent CA. Measured capacity of an Ethernet: Myths and reality. In: Proceedings ACM SIGCOMM; 1988:222–234 vol. 18.
Brakmo L, Malley SO, Peterson L. TCP Vegas: New techniques for congestion detection and avoidance. In: Proceedings ACM SIGCOMM; 1994.
Boyle J. Internet draft: RSVP extensions for CIDR aggregated data flows. Internic. 1997.
Banks D, Prudence M. A high-performance network architecture for a PA-RISC workstation. IEEE Journal on Selected Areas in Communications. February 1993.
At Braun HW. Characterizing traffic workload. 1998. http://www.caida.org.
Broder A. On the resemblance and containment of documents. Sequences’91. 1998.
Brustoloni J. Interoperation of copy avoidance in network and file I/O. In: Proceedings IEEE Infocom; March 1999 New York.
Brustoloni J, Steenkiste P. Effects of buffering semantics on I/O performance. In: Proceedings of the 2nd USENIX Symposium on Operating Systems Design and Implementation; October 1996.
Boecking S, Seidel V, Vindeby P. Channels — a run-time system for multimedia protocols. In: ICCCN. 1995.
Baboescu F, Singh S, Varghese G. Packet classification for core routers: Is there an alternative to CAMs?. In: Proceedings IEEE INFOCOM; 2003.
Baboescu F, Varghese G. Scalable packet classification. In: Proceedings ACM SIGCOMM; 2001.
Bennett J, Zhang H. Hierarchical packet fair queuing algorithms. In: Proceedings SIGCOMM; 1996.
At Carlton A. An explanation of the SPEC Web96 Benchmark. Standard Performance Evaluation Corporation white paper. 1996. http://www.specbench.org. November 1996.
Cheswick W, Bellovin S. In: Reading, MA: Addison-Wesley; 1995. Firewalls and Internet Security.
Crovella M, Carter R. Dynamic server selection in the internet. In: Proceedings of HPCS ’95; August 1995.
Chankhunthod A, Danzig P, et al. A hierarchical Internet object cache. In: USENIX Annual Technical Conference. 1996:153–164.
Chaney T, Fingerhut A, Flucke M, Turner J. Design of a gigabit ATM switch. In: Proceedings IEEE INFOCOM; 1997:2–11.
Cobb J, Gouda M, El Nahas A. Time-shift scheduling: Fair scheduling of flows in high-speed networks. In: Proceedings of ICNP; 1996.
Cole R, Hopcroft J. On edge-coloring bipartite graphs. SIAM Journal of Computation. 1982;11:540–546.
Choudhury A, Hahne E. Dynamic queue length thresholds for shared-memory packet switches. IEEE/ACM Transactions on Networking. 1998;6(2):130–140y.
Chazelle B. Lower bounds for orthogonal range searching. I: The reporting case. Journal of the ACM. 1990;37.
Chazelle B. Lower bounds for orthogonal range searching. II: The arithmetic model. Journal of the ACM. 1990;37.
At IETFMPLS Charter. Multiprotocol Label Switching. 1997. http://www.ietf.org/html.charters/mpls.
Chesson G. XTP/PE design considerations. In: IFIP Workshop on Protocols for High-Speed Networks. 1989.
Chelf B. Dynamic memory management. Linux Magazine. June 2001. http://www.linuxmag.com/2001.
At Compaq, Intel, and Microsoft Corporations. Virtual Interface Architecture Specification. 1997. http://www.viaarch.org.
At Cisco express forwarding commands. http://www.cisco.com.
Clark DD, Jacobson V, Romkey J, Salwen H. An analysis of TCP processing overhead. IEEE Communications. 1989;27(6):23–29.
Chandy KM, Lamport L. Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems. Febuary 1985;3(1):63–75.
Clark DD. Structuring of systems using upcalls. In: Proceedings of the 10th ACM Symposium on Operating Systems Principles (SOSP); December 1985:171–180.
Clark DD. The design philosophy of the DARPA Internet protocols. In: Proceedings ACM SIGCOMM; August 1988:106–114.
Cormen T, Leiserson C, Rivest R. In: Cambridge, MA: MIT Press/McGraw-Hill; 1990. Introduction to Algorithms.
At RDMA Consortium. Architectural specifications for RDMA over TCP/IP. http://www.rdmaconsortium.org/home.
At SPEC Consortium. Specweb99 benchmark. http://www.specbench.org/osg/web99.
At Cox A. Kernel Korner: Network buffers and memory management. Linux journal. Oct. 1996. http://www.linuxjournal.com.
Chiueh T, Pradhan P. High-performance IP routing table lookup using CPU caching. In: IEEE INFOCOM. 1998.
Chiueh T, Pradhan P. High-performance IP routing table lookup using CPU caching. In: Proceedings IEEE INFOCOM; 1999:1421–1428.
Culler D, Singh J, Gupta A. In: San Francisco: Morgan Kaufmann; 1999. Parallel Computer Architecture: A Hardware/Software Approach.
Coit C, Staniford S, McAlerney J. Towards faster pattern matching for intrusion detection or exceeding the speed of snort. In: Proceedings of the 2nd DARPA Information Survivability Conference and Exposition (DISCEX II); June 2001.
Clark D, Tennenhouse D. Architectural considerations for a new generation of protocols. In: Proceedings of ACM SIGCOMM; 1990.
Chandranmenon G, Varghese G. Trading packet headers for packet processing. ACM/IEEE Transactions Networking. April 1996;17(1).
Chandranmenon G, Varghese G. Reconsidering fragmentation and reassembly. In: Symposium on Principles of Distributed Computing; 1998:21–29.
Costello A, Varghese G. Redesigning the BSD callout and timeout facilities. Software Practice and Exprience. 1998 July.
Chandranmenon G, Varghese G. Reducing Web latencies using precomputed hints. In: Proceedings IEEE INFOCOM; 2001.
Commentz-Walter B. A string matching algorithm fast on the average. In: Proceedings of the 6th International Colloquium on Automata, Languages and Programming; New York: Springer; July 1979 vol. 71.
Clark D, Wroclawski J, Sollins K, Braden R. Tussle in cyberspace: Defining tomorrow’s Internet. In: Proceedings of ACM SIGCOMM; 2002.
At Dally W. Scalable switching fabrics for Internet routers. Avici Networks White Paper. 2002. http://www.avici.com/technology/whitepapers.
Davison G. Calendar p’s and q’s. Communications of the ACM. Oct. 1989;32(10):1241–1242.
Druschel P, Banga G. Lazy receiver processing: A network subsystem architecture for server systems. In: Proceedings of the UNIX 2nd OSDI Conference; 1996.
Degermark M, Brodnik A, Carlsson S, Pink S. Small forwarding tables for fast routing lookups. In: Proceedings ACM SIGCOMM; 1997:3–14.
Dally W, Chao L, et al. Architecture of a message-driven processor. In: Proceedings of the International Symposium on Computer Architecture (ISCA); June 1987.
Druschel P, Davie B, Peterson L. Experiences with a high-speed network adapter: A software perspective. In: Proceedings ACM SIGCOMM; Sept. 1994.
Decasper D, Dittia Z, Parulkar G, Plattner B. Router plugins: A software architecture for next-generation routers. In: Proceedings ACM SIGCOMM; Sept. 1998.
Denning D. An intrusion-detection model. IEEE Transactions on Software Engineering. Feb. 1987;13(2):222–232.
Duffield N, Grossglauser M. Trajectory sampling for direct traffic observation. In: Proceedings ACM SIGCOMM; Aug. 2000:271–282.
Dietzfelbinger M, Karlin A, et al. Dynamic perfect hashing: Upper and lower bounds. In: 29th IEEE Symposium on the Foundations of Computer Science (FOCS); 1988.
4 Demers A, Keshav S, Shenker S. Analysis and simulation of a fair queueing algorithm. Part of ACM Sigcomm Computer Communication Review In: Proceedings of the Sigcomm ’89 Symposium on Communications Architectures and Protocols; Sept. 1989:1–12 19.
Draves R, King C, Venkatachary S, Zill B. Constructing optimal IP routing tables. In: Proceedings IEEE INFOCOM; 1999.
Duffield N, Lund C, Thorup M. Charging from sampled network usage. In: SIGCOMM Internet Measurement Workshop. November 2001.
Druschel P, Peterson L. Fbufs: A high-bandwidth cross-domain transfer facility. In: Proceedings of the Fourteenth ACM Symposium on Operating System Principles; December 1993:189–202.
Dittia ZD, Parulkar GM, Cox Jr. JR. The APIC approach to high-performance network interface design: Protected DMA and other techniques. In: Proceedings of IEEE INFOCOM; 1997.
Eatherton W. Hardware-based Internet protocol prefix lookups. University of Washington Electrical Engineering Department, MS thesis. 1995.
At Eatherton W, Dittia Z, Varghese G. Tree bitmap: Hardware software IP lookups with incremental updates. http://www.cse.ucsd.edu/users/varghese/PAPERS/willpaper.pdf.
Engler D, Kaashoek MF. DPF: Fast, flexible message demultiplexing using dynamic code generation. In: Proceedings ACM SIGCOMM; 1996:53–59.
Engler D, Kaashoek F, O’Toole J. Exokernel: An operating system architecture for application-level resource management. In: Symposium on Operating Systems Principles; 1995:251–266.
Engler D. VCODE: A retargetable, extensible, very fast dynamic code generation system. In: SIGPLAN Conference on Programming Language Design and Implementation; 1996:160–170.
Estan C, Savage S, Varghese G. Automatically inferring patterns of resource consumption in network traffic. In: Proceedings ACM SIGCOMM; 2003.
Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of ACM SIGCOMM; August 2002.
Estan C, Varghese G, Fisk M. In: CSE Department, UCSD; May 2002. Counting the Number of Active Flows on a High-speed Link. Technical Report 0705.
Feldmann A, Greenberg A, et al. Deriving traffic demands for operational IP networks: Methodology and experience. In: Proceedings of ACM SIGCOMM; Aug. 2000:257–270.
Floyd S, Jacobson V. Random early detection gateways for congestion avoidance. In: ACM/IEEE Transactions Networking. 1993.
Floyd S, Jacobson V. Link-sharing and resource management models for packet networks. In: ACM/IEEE Transactions Networking. 1995.
Floyd S, Jacobson V, McCanne S, Liu C, Zhang L. A reliable multicast framework for light-weight sessions and application-level framing. In: Proceedings ACM SIGCOMM; 1995.
Flajolet P, Martin G. Probabilistic counting algorithms for database applications. Journal of Computer and System Sciences. Oct. 1985;31(2):182–209.
Floyd S, Mahdavi J, Mathis M, Podolsky M, Romanow A. An extension to the selective acknowledgment (SACK) option for TCP. 1999.
Fall K, Pasquale J. Exploiting in-kernel data paths to improve I/O throughput and CPU availability. In: USENIX Winter. 1993:327–334.
Figueira N, Pasquale J. Leave-in-time: A new service discipline for real-time communications in a packet-switching network. In: Proceedings ACM SIGCOMM; Sept. 1995.
Fang W, Peterson L. Inter-AS traffic patterns and their implications. In: Proceedings of IEEE GLOBECOM; Dec. 1999.
Fromm R, Perissakis S, Cardwell N, et al. The energy efficiency of IRAM architectures. In: International Symposium on Computer Architecture (ISCA ’97); June 1997.
Fisk M, Varghese G. Fast Content-Based Packet Handling for Intrusion Detection. UCSD Technical Report CS2001-0670. April 2001.
Giacopelli J, et al. Sunshine: A high-performance self-routing packet switch architecture. IEEE Journal on Selected Areas in Communication. Oct. 1991;9(8).
Germanow A. In: International Data Corporation; 1999. Plugging the Holes in Ecommerce: The market for Intrusion Detection and Vulnerability Assessment Software, 1999–2003. Technical Report B19538.
Gupta P, Lin S, McKeown N. Routing lookups in hardware at memory access speeds. In: IEEE INFOCOM. April 1998.
Gupta P, McKeown N. Designing and implementing a fast crossbar scheduler. IEEE Micro. 1999 Feb.
Gupta P, McKeown N. Packet classification on multiple fields. In: Proceedings ACM SIGCOMM; 1999:147–160.
Gupta P, McKeown N. Algorithms for packet classification. IEEE Network. 2001;15(2).
Gokhale A, Schmidt D. Principles for optimizing CORBA Internet inter-ORB protocol performance. In: Hawaiian International Conference on System Sciences; 1998.
Griffin T, Wilfong G. On the correctness of IBGP configuration. In: Proceedings ACM SIGCOMM; 2002:17–30.
Hopcroft J, Karp R. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computation. 1973;2:225–231.
Hutchinson NC, Peterson LL. The x-kernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering. 1991;17(1):64–76.
Hennessey J, Patterson D. In: 2nd ed. San Francisco, CA: Morgan Kaufmann; 1996. Computer Architecture: A Quantitative Approach.
Horowitz E, Sahni S. In: Rockville, MD: Computer Science Press; 1978. Fundamentals of Computer Algorithms.
At IEEE. Media access control (MAC) bridging of Ethernet v2.0 in local area networks. 1997. http://standards.ieee.org/reading/ieee/std/lanman/802.1H1997.pdf.
Indyk P, Motwani R, et al. Locality-preserving hashing in multidimensional spaces. In: Proceedings of the 29th ACM Symposium on Theory of Computing; 1997:618–625.
Jacobson V. Congestion avoidance and control. In: Proceedings ACM SIGCOMM; 1988.
Jacobson V. TCP in 30 instructions. Message sent to comp.protocols.tcp newsgroup. 1993 Sept.
Kanakia H. Datapath switch. ATT Bell Labs Internal Memorandum. 1999.
Kung HT, Chapman A, Blackwell T. The FCVC credit-based flow control protocol. In: Proceedings ACM SIGCOMM; Sept. 1994.
Keshav S. On the efficient implementation of fair queueing. 157–173. Internetworking: Research and Experience. Sept. 1991;vol. 2.
Keshav S. In: Reading, MA: Addison-Wesley; 1997. Computer Networks: An Engineering Approach.
Karol M, Hluchyj M, Morgan S. Input versus output queuing on a space division switch. IEEE Transactions on Communications. Dec. 1987;1347–1356.
Kronenberg N, Levy H, Strecker W. Vaxclusters: A closely coupled distributed system. ACM Transactions on Computer Systems. 1986;4(2).
Kent CA, Mogul JC. Fragmentation considered harmful. In: Proceedings ACM SIGCOMM; Aug. 1987.
Kohler E, Morris R, et al. The Click modular router. ACM Transactions on Computer Systems. Aug. 2000.
Knuth D. In: Reading, MA: Addison-Wesley; 1973. Fundamental Algorithms. Vol 3: Sorting and searching.
Kay J, Pasquale J. The importance of non-data touching processing overheads in TCP/IP. In: Proceedings ACM SIGCOMM; Sept. 1993.
At Kurzweil R. What’s creativity and who’s creative?. http://www.closertotruth.com/topics/creativitythinking/103/103transcript.html.
Lampson B. Hints for computer system design. In: Proceedings of the 9thACM Symposium on Operating Systems Principles (SOSP) 1989; 1989.
Lai K, Baker M. A performance comparison of UNIX operating systems on the Pentium. In: Proceedings of the 1996 USENIX Conference, San Diego, CA; Jan. 1996.
L’Ecuyer P. Maximally equidistributed combined Tausworth generators. Mathematics of Computation. 1996;65:203–213.
Labovitz C, Malan G, Jahanian F. Internet routing instability. In: Proceedings ACM SIGCOMM; Oct. 1997.
Lakshman TV, Stidialis D. High-speed policy-based packet forwarding using efficient multidimensional range matching. In: Proceedings ACM SIGCOMM; Sept. 1998.
Lampson B, Srinivasan V, Varghese G. IP lookups using multiway and multicolumn search. In: Proceedings of IEEE INFOCOM; April 1998.
At Marsaglia G. Diehard Web page. 2002. http://stat.fsu.edu/geo/diehard.html.
Maeda C, Bershad B. Protocol service decomposition for high-performance networking. In: Proceedings of the 14th ACM Symposium on Operating Systems Principles (SOSP); 1993.
Mead C, Conway L. In: Reading, MA: Addison-Wesley; 1980. Introductions to VLSI Systems.
McCanne S. A distributed whiteboard for network conferencing. UC Berkeley CS 268 Computer Networks Term Project. 1992.
McKenney P. Stochastic fairness queueing. Internetworking: Research and Experience. Jan. 1991;vol. 2:113–131.
McKenney P, Dove K. Efficient demultiplexing of incomming TCP packets. In: Proceedings ACM SIGCOMM; 1992.
McKeown N. A fast switched backplane for a gigabit switched router. Business Communications Review. Dec. 1997;27(12).
McQuillan J. Layer 4 switching. Data Communications. 1997 Oct.
McKeown N, et al. The tiny tera: A packet switch core. IEEE Micro. 1997 Jan.
At Merit. Routing table snapshot at the Mae-East NAP. ftp://ftp.merit.edu/statistics/ipma.
Mao Z, Govindan R, Varghese G, Katz R. Route flap damping can exacerbate BGP convergence. In: Proceedings ACM SIGCOMM; 2002:221–234.
McCanne S, Jacobson V. The BSD packet filter: A new architecture for user-level packet capture. In: USENIX Winter Conference. 1993:259–270.
Malan G, Jahanian F. An extensible probe architecture for network protocol measurement. In: Proceedings ACM SIGCOMM; 1998.
Molinero-Fernandez P, McKeown N. TCP switching: Exposing circuits to IP. IEEE Micro Magazine. Jan./Feb. 2002;22(1):82–89.
Mogul J. The cases for persistent-connection http. In: Proceedings ACM SIGCOMM; 1995.
Personal conversation. Also see Moore D. At CAIDA Analysis of Code Red. 2001. http://www.caida.org/analysis/security/codered/.
Mosberger D, Peterson L. Making paths explicit in the Scout operating system. In: Proceedings of the USENIX Symposium on Operating Systems Design and Implementation; 1996:153–167.
Mosberger D, Peterson L, Bridges P, O’Malley S. Analysis of techniques to improve protocol latency. In: Proceedings of ACM SIGCOMM; 1996.
Mogul J, Ramakrishnan KK. Eliminating receive livelock in an interrupt-driven kernel. In: ACM Transactions on Computer Systems. Aug. 1997:303–313.
Mogul J, Rashid R, Accetta M. The packet filter: An efficient mechanism for user-level network code. In: Proceedings of the 11th ACM Symposium on Operating Systems Principles (SOSP); 1987:39–51 vol. 21.
Maltzahn C, Richardson K, Grunwald D. Performance issues of enterprise-level Web proxies. In: Measurement and Modeling of Computer Systems. 1997:13–23.
Medina A, Taft N, et al. Traffic matrix estimation: Existing techniques and new directions. In: Proceedings ACM SIGCOMM; 2002.
D. Moore, G. Voelker, and S. Savage. Inferring denial-of-service activity. In Proceedings of the 2001 USENIX Security Symposium.
B. Myhrhaug. Sequencing set efficiency. In Pub. A9, Norwegian Computing, Center.
At NEBS. Network Equipment Building System (NEBS) requirements. 2002. http://www.telecordia.com.
At Cisco netflow. http://www.cisco.com/warp/public/732/Tech/netflow.
Nilsson S, Karlsson G. Fast address lookup for Internet routers. In: Proceedings of IEEE Broadband Communications ’98; April 1998.
Newman P, Minshall G, Huston L. IP switching and gigabit routers. IEEE Communications Magazine. Jan. 1997.
Ozveren C, Simcoe R, Varghese G. Reliable and efficient hop-by-hop flow control. In: Proceedings ACM SIGCOMM; Sept. 1994.
Partridge C. In: Reading, MA: Addision-Wesley; 1993. Gigabit Networking.
Partridge C. Locality and route caches. In: NSF Workshop on Internet Statistics Measurement. San Diego; Feb. 1996.
C. Partridge, S. Blumenthal, and D. Walden. Datt networking at BBN. In IEEE Annals of Computing, to appear.
Peterson L, Davy B. In: 2 ed. San Francisco: Morgan-Kaufmann; 2000. Computer Networking: A System Approach.
Pai V, Druschel P, Zwaenepoel W. Flash: An efficient and portable Web server. In: USENIX 1999 Annual Technical Conference. 1999.
Pai V, Druschel P, Zwaenepoel W. I/O-Lite: A unified I/O buffering and caching system. In: Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation; Feb. 1999.
Patterson H, et al. Informed prefetching and caching. In: Proceedings of the 15th ACM Symposium of Operating Systems Principles (SOSP); Dec. 1995.
Perlman R. In: Reading, MA: Addison-Wesley; 1992. Interconnections: Bridges and Routers.
Padhye J, Floyd S. On inferring TCP behavior. In: Proceedings ACM SIGCOMM; Aug. 2001:271–282.
Pakin S, Karamcheti V, Chien AA. Fast messages: Efficient, portable communication for workstation clusters and MPPs. IEEE Concurrency. April 1997.
Polya G. How to Solve it. In: 2nd ed. Princeton, NJ: Princeton University Press; 1957.
Partridge C, Pink S. A faster UDP. IEEE/ACM Transactions on Networking. Aug. 1993;1(4).
Preparata F, Shamos M. In: New York: Springer-Verlag; 1985. Computational Geometry: An Introduction.
Parulkar G, Turner J, Schmidt D. IP over ATM: A new strategy for integrating IP and ATM. In: Proceedings ACM SIGCOMM; Aug. 1995.
Qiu L, Varghese G, Suri S. Fast firewall implementations for software- and hardware-based routers. In: Proceedings of the 9th International conference on Network Protocols (ICNP); Nov. 2001.
Rau B. Pseudo-randomly interleaved memory. In: Proceedings of the International Symposium on Computer Architecture (ISCA); 1991.
At Rekhter Y, et al. Tag switching architecture overview Internet draft. 1996. http://www.kr.cisco.com/warp/public/732/tag/switarc_draft.html.
Riccardi F. Posted note. Linux Kernel Archive. April 2001.
Rijsinghani A. Computation of the Internet checksum via incremental update. RFC 1624. May 1994. http://www.ietf.org/rfc/rfc1624.txt.
Ramakrishnan KK, Jain R. A binary feedback scheme for congestion avoidance in computer networks. ACM Transactions on computer Systems. 1990.
Rekhter Y, Li T. An architecture for IP address allocation with CIDR. RFC 1518. 1996.
Robson JM. Bounds for some functions concerning dynamic storage allocation. Journal of the Association for Computing Machinery. July 1974.
Roesch M. Snort — Lightweight intrusion detection for networks. In: Proceedings of the 13th Systems Administration Conference; USENIX; 1999.
Ramabhadran S, Pasquale J. A low-complexity packet scheduler with bandwidth fairness and delay bounds. In: Proceedings ACM SIGCOMM; Aug. 2003.
Ramabhadran S, Varghese G. Efficient implementation of a statistics counter architecture. In: Proceedings ACM SIGMETRICS; 2003.
U.S. Patent 5905725 Sindhu P, Anand R, Ferguson D, Liencres B. High-Speed Switching Device. 1999.
Sarwate D. Computation of cyclic redundancy checks by table lookup. Communications of the ACM. 1988;31(8).
Savage S. Sting: A TCP-based network measurement tool. In: USENIX Symposium on Intenet Technologies and Systems; 1999.
Singh S, Baboescu F, Varghese G. Packet classification using multidimensional cutting. In: Proceedings ACM SIGCCOMM; 2004.
Semeria C. T-series routing platforms: System and forwarding architecture. Juniper Networks White Paper, Part Number 200027-001. 2002.
Shah D, Gupta P. Fast updates on ternary CAMs for packet lookups and classification. IEEE Micro. Jan. 2001;21(1).
Shah D, Iyer S, Prabhakar B, McKeown N. Maintaining statistics counters in router line cards. IEEE Micro. Jan. 2002.
Souza R, Krishnakumar P, Ozveren C, Simcoe R, Spinney B, Thomas R, Walsh R. GIGAswitch: A high-performance packet switching platform. Digital Technical Journal. Winter 1994;6(1):9–22.
Spalink T, Karlin S, Peterson L. In: Princeton University; Nov. 2000. Evaluating Network Processors in IP Forwarding, Computer Science Technical Report TR-626-00.
Shannon C, Moore D, Claffy K. Characteristics of fragmented IP traffic on Internet links. In: ACM SIGCOMM Internet Measurement Workshop. Nov. 2001.
Sanchez L, Milliken W, et al. Hardware support for hash-based IP traceback. In: Proceedings of the 2nd DARPA Information Survivability Conference and Exposition; DISCEX; 2001.
Spring N, Mahajan R, Wetherall D. Measuring ISP topologies using RocketFuel. In: Proceedings ACM SIGCOMM; 2002.
Sabnani K, Netravali A. A high-speed transport protocol for datagram/virtual circuit networks. In: Proceedings ACM SIGCOMM; Sept. 1989.
Snort The Open Source Network Intrusion Detection System. At http://www.snort.org/.
Simcoe R, Pei T. Perspectives on ATM switch architecture and the influence of traffic pattern assumptions on switch design. ACM Computer Communication Review. 1994.
Stone J, Partridge C. When the CRC and TCP checksum disagree. In: Proceedings ACM SIGCOMM; 2000:309–319.
Snoeren A, Partridge C, et al. Hash-based IP traceback. In: Proceedings ACM SIGCOMM; 2001:295–306.
Sutherland I, Sproull R, Harris D. In: San Diego: Morgan Kaufmann; 1999. Logical Effort, Designing Fast CMOS Circuits.
At Satran J, Smith D, Meth K, et al. iSCSI. July 2001 Internet Draft draftietf.
Srinivasan V, Suri S, Varghese G. Packet classification using tuple space search. In: Proceedings ACM SIGCOMM; 1999:135–146.
Stoica I, Shenker S, Zhang H. Core-stateless fair queuing: Achieving approximately fair bandwidth allocations in high-speed networks. In: Proceedings ACM SIGCOMM; 1998.
J. Smith and B. Traw. Operating systems support for end-to-end Gbps networking. Technical report, Distributed Systems Laboratory, University of Pennsylvania.
Stevens WR. In: Reading, MA: Addison-Wesley; . TCP/IP Illustrated. 1994;Vol. 1.
Stevens WR. In: Upper Saddle River, NJ: Prentice Hall; 1998. UNIX Network Programming.
Stewart JW. In: Reading, MA: Addison-Wesley; 1999. BGP-4: Interdomain routing in the Internet.
Staliadis D, Varma A. Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks. In: Proceedings ACM SIGMETRICS; 1996.
Srinivasan V, Varghese G. Faster IP lookups using controlled prefix expansion. In: ACM Transactions on Computer Systems. Feb. 1999.
Sikka S, Varghese G. Memory-efficient state lookups. In: Proceedings ACM SIGCOMM; Aug. 2000.
Suri S, Varghese G, Chandranmenon G. Leap forward virtual clock: A new fair queuing scheme with guaranteed delays and throughput fairness. In: Proceedings of Infocom ’97; 1997.
Sherwood T, Varghese G, Calder B. A pipelined memory architecture for high-throughput network processors. In: International Symposium on Computer Architecture; 2003.
Srinivasan V, Varghese G, Suri S, Waldvogel M. Fast scalable level-four switching. In: Proceedings of SIGCOMM ’98; Sept. 1998.
Differentiated Services Working Group. Differentiated Services (diffserv) Charter. At http://www.ietf.org/html.charters/diffserv-charter.html
Savage S, Wetherall D, Karlin A, Anderson T. Practical network support for IP traceback. In: Proceedings ACM SIGCOMM; 2000:295–306.
Cisco Systems. Cisco 12000 Series Internet Routers. At http://www.cisco.com/warp/public/cc/pd/rt/12000/tech/index/shtml
Tanenbaum AS. In: Englewood Cliffs, NJ: Prentice Hall; 1981. computer Networks.
Tanenbaum A. In: Upper Saddle River, NJ: Prentice Hall; 1992. Modern Operating systems.
abridged version Toynbee A, Caplan J. In: New York: Oxford University Press; 1972. A Study of History.
Thadani MN, Khalidi YA. In: Sun Microsystems Laboratories; May 1995. An Efficient Zero-Copy I/O Framework for UNIX, Technical Report SMLI TR-95-39.
Thompson K, Miller G, Wilder R. Wide-area traffic patterns and characterizations. IEEE Network. Dec. 1997.
Thekkath C, Nguyen T, Moy E, Lazowska E. Implementing network protocols at user level. In: Proceedings ACM SIGCOMM; 1993.
Touch J, Parham B. Implementing the Internet checksum in hardware. RFC 1936. April 1996. http://www.ietf.org/rfc/rfc1936.txt.
P. Tsuchiya. A search algorithm for table entries with noncontiguous wildcarding. In Unpublished report, Bellcore.
Turner JS. New directions in communications (or Which way to the information age?). IEEE Communications. 1986.
Turner J. Design of a gigabit ATM switch. In: Proceedings IEEE INFOCOM; Oct. 1997.
Turner J. Personal communication. 2002.
U.S. Patent 5,086,428 Thomas R, Varghese G, Harvey G, Souza R. Method for keeping track of sequence numbers in a large space. Sept. 1992.
Turner J, Yamanaka N. Architectural choices in large scale ATM switches. IEICE Transactions. 1998.
UNH Interoperability Lab. FDDI tutorials. At http://www.iol.unh.edu/training/fddi.html. 2001.
Valiant L. A bridging model for parallel computation. Communications of the ACM. 1990;33(8).
von Eicken T, Culler D, Goldstein S, Schauser K. Active messages: A mechanism for integrated communication and computation. In: Proceedings of the 19th International Symposium on Computer Architecture (ISCA); 1992:256–266.
Vaucher JG, Duval P. A comparison of simulation event list algorithms. In: CACM 18. 1975.
von Eicken T, Basu A, et al. U-Net: A user-level network interface for parallel and distributed computing. In: Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP); 1995.
von Eicken T, Culler D, et al. Active messages: A mechanism for integrated communication and computation. In: 19th International Symposium on Computer Architecture; 1992:256–266.
Varadhan K, Govindan R, Estrin D. Persistent route oscillations in interdomain routing. Computer Networks. 2000;32(1):1–16.
At Max Vision. Advanced reference archive of current heuristics for network intrusion detection systems (arachNIDS). http://www.whitehats.com/ids/.
Varghese G, Lauck A. Hashed and hierarchical timing wheels: Data structures for the efficient implementation of a timer facility. In: Proceedings of the 11th ACM Symposium on Operating Systems Principles (SOSP); 1987.
Welsh M, Culler DE, Brewer EA. SEDA: An architecture for well-conditioned, scalable Internet services. In: Proceedings of the 22nd Symposium on Operating Systems Principles (SOSP); 2001:230–243.
Wang J, Huang C. A high-speed single-phase-clocked CMOS priority encoder. In: IEEE International Symposium on Circuits and Systems; May 2000.
Wilson P. Uniprocessor garbage collection techniques. Springer-Verlag Lecture Notes in Computer Science, number 637. Sept. 1992.
Wilson P, Johnstone M, et al. Dynamic storage allocation: A survey and critical review. In: Proceedings of the International Workshop on Memory Management, Kinross, Scotland; 1995.
Woo T. A modular approach to packet classification: Algorithms and results. In: Proceedings IEEE INFOCOM; 2000.
Wright GR, Stevens WR. In: Reading, MA: Addison-Wesley; . TCP/IP Illustrated. 1995;vol. 2.
Warkhede P, Suri S, Varghese G. Fast packet classification for two-dimensional conflict-free filters. In: Proceedings IEEE INFOCOM; 2001:1434–1443.
Warkhede P, Suri S, Varghese G. Multiway range trees: Scalable IP lookups with fast updates. In: IEEE Globecom 2001 Internet Symposium; Nov. 2001.
Waldvogel M, Varghese G, Turner J, Plattner B. Scalable high-speed IP routing lookups. In: ACM Transactions on Computer Systems. Nov. 2001.
Xu J, Singhal M, Degroat J. A novel cache architecture to support layer-four packet classification at memory access speeds. In: Proceedings IEEE INFOCOM; 2000:1445–1454.
Yeh Y, Hluchyj M, Acampora A. The Knockout Switch: A simple modular architecture for high-performance packet switching. IEEE Journal on Selected Areas in Communication. Oct. 1987;1426–1435.
Zhang L. Virtual clock: A new traffic control algorithm for packet-switched networks. In: ACM Transactions on Computer Systems. 1991.
Zhang Y, Roughan M, Duffield N, Greenberg A. Fast, accurate computation of large-scale IP matrices from link loads. In: Proceedings ACM SIGMETRICS; 2003.
