Network Algorithmics

Network Algorithmics

An Interdisciplinary Approach to Designing Fast Networked Devices

2nd Edition - November 1, 2022

Write a review

  • Authors: George Varghese, Jun Xu
  • Paperback ISBN: 9780128099278

Purchase options

Purchase options
Available for Pre-Order
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order


Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices, Second Edition takes an interdisciplinary approach to applying principles for efficient implementation of network devices, offering solutions to the problem of network implementation bottlenecks. In designing a network device, there are dozens of decisions that affect the speed with which it will perform – sometimes for better, but sometimes for worse. The book provides a complete and coherent methodology for maximizing speed while meeting network design goals. The book is uniquely focused on the seamless integration of data structures, algorithms, operating systems and hardware/software co-designs for high-performance routers/switches and network end systems. Thoroughly updated based on courses taught by the authors over the past decade, the book lays out the bottlenecks most often encountered at four disparate levels of implementation: protocol, OS, hardware and architecture. It then develops fifteen principles key to breaking these bottlenecks, systematically applying them to bottlenecks found in end-nodes, interconnect devices and specialty functions located along the network. Later sections discuss the inherent challenges of modern cloud computing and data center networking.

Key Features

  • Offers techniques that address common bottlenecks of interconnected devices, including routers, bridges, gateways, end-nodes and Web servers
  • Presents many concepts in pseudo-code that students and readers can immediately work with as they learn algorithmic concepts
  • Revised and updated throughout to discuss the latest developments from authors’ courses, including measurement algorithmics, randomization, regular expression matching and software-defined networking
  • Includes a new, rich set of homework exercises and exam questions to facilitate classroom use


Networking engineers and designers, particularly those in emerging areas now using algorithimics; also advanced undergrad or graduate students studying networking in CS or CE departments

Table of Contents

  • Part I: Rules of the Game
    1. Introducing Network Algorithmics
    2. Network Implementation Models
    3. Fifteen Implementation Principles
    4. Principles in Action

    Part II: Playing with Endnodes
    5. Copying Data
    6. Transferring Control
    7. Maintaining Timers
    8. Demultiplexing
    9. Protocol Processing

    Part III: Playing with Routers
    10. Exact-Match Lookups
    11. Prefix-Match Lookups
    12. Packet Classification
    13. Switching
    14. Scheduling Packets
    15. Routers as Distributed Systems

    Part IV: Endgame
    16. Measuring Network Traffic
    17. Network Security
    18. Conclusions

    Appendix: Detailed Models

Product details

  • No. of pages: 496
  • Language: English
  • Copyright: © Morgan Kaufmann 2022
  • Published: November 1, 2022
  • Imprint: Morgan Kaufmann
  • Paperback ISBN: 9780128099278

About the Authors

George Varghese

George Varghese is a widely recognized authority on the art of network protocol implementation. Currently a Principal Researcher and Partner at Microsoft Research, he has served as a professor in the Department of Computer Science at UC-San Diego, he has previously taught at Washington University and Stanford University. Elected a Fellow of the ACM in 2002, he holds (with colleagues) 22 patents in the general field of network algorithmics. Several algorithms that he helped develop have found their way into commercial systems, including Linux (timing wheels), the Cisco GSR (DRR), and MS Windows (IP lookups). Varghese has written more than 100 papers on networking, computer architecture, genomics, and databases.

Affiliations and Expertise

Principal Researcher and Partner, Microsoft Research, Santa Clara, CA, USA

Jun Xu

Jun Xu is a Professor in the School of Computer Science at Georgia Tech. His research focuses on the design and analysis of network algorithmics. He was instrumental in introducing randomization to the design of network algorithmics, which led to a paradigm shift in the field. His current research interests include data streaming algorithms for the measurement and monitoring of computer networks, and algorithms and data structures for high-speed routers. He received the NSF CAREER award in 2003, and IBM faculty awards in 2006 and 2008. He was named an ACM Distinguished Scientist in 2010.

Affiliations and Expertise

Professor, School of Computer Science, Georgia Tech. University, Atlanta, GA, USA

Ratings and Reviews

Write a review

There are currently no reviews for "Network Algorithmics"