Network Algorithmics

An Interdisciplinary Approach to Designing Fast Networked Devices
Erscheinungsjahr 2004
ISBN: 978-0-12-088477-3
Verlag: William Andrew Publishing

Buch, Englisch, 496 Seiten, Format (B × H): 191 mm x 235 mm, Gewicht: 1134 g

In designing a network device, you make dozens of decisions that affect the speed with which it will perform-sometimes for better, but sometimes for worse. Network Algorithmics provides a complete, coherent methodology for maximizing speed while meeting your other design goals.

Author George Varghese begins by laying out the implementation bottlenecks that are most often encountered at four disparate levels of implementation: protocol, OS, hardware, and architecture. He then derives 15 solid principles-ranging from the commonly recognized to the groundbreaking-that are key to breaking these bottlenecks.

The rest of the book is devoted to a systematic application of these principles to bottlenecks found specifically in endnodes, interconnect devices, and specialty functions such as security and measurement that can be located anywhere along the network. This immensely practical, clearly presented information will benefit anyone involved with network implementation, as well as students who have made this work their goal.

FOR INSTRUCTORS: To obtain access to the solutions manual for this title simply register on our textbook website (textbooks.elsevier.com)and request access to the Computer Science subject area. Once approved (usually within one business day) you will be able to access all of the instructor-only materials through the "Instructor Manual" link on this book's academic web page at textbooks.elsevier.com.

Zielgruppe

Network protocol implementers, from server vendors (i.e., Sun, IBM, Microsoft) to router vendors (i.e., Cisco, Juniper, PMC Sierra, Redback, Alcatel, Intel Networks). Also appeals to designers of efficient Intrusion Detection Systems (IDS) and firewalls which includes implementers at companies such as Cisco, ISS, Raptor, Symantec, Checkpoint, Network Associates, as well as companies and startups in security, storage and networking.

Autoren/Hrsg.

Varghese, George

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung

Inhaltsverzeichnis

1 Introducing Network Algorithmics
2 Network Implementation Models
3 Fifteen Implementation Principles
4 Principles in Action
5 Copying Data
6 Transfering Control
7 Maintaining Timers
8 Demultiplexing
9 Protocol Processing
10 Exact Match Lookups
11 Prefix Match Lookups
12 Packet Classification
13 Switching
14 Scheduling Packets
15 Routers as Distributed Systems
16 Measuring Network Traffic
17 Network Security
18 Conclusions
Appendix A Detailed Models

Über Autor(innen)

Varghese, George
George Varghese is a widely recognized authority on the art of network protocol implementation. Currently he holds the Jonathan B. Postel Chair of Networking at the University of California, Los Angeles. Earlier he was a Partner at Microsoft Research, and served as a professor in the departments of Computer Science at UC-San Diego and Washington University. He was elected to American Academy of Arts and Sciences in 2022, to the Internet Hall of Fame in 2021, to the National Academy of Inventors in 2020, to the National Academy of Engineering in 2017, and as a Fellow of the ACM in 2002. He co-founded a startup called NetSift in 2004 that was acquired by Cisco in 2005. With colleagues, he holds 26 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.

George Varghese is a widely recognized authority on the art of network protocol implementation. Currently a professor in the Department of Computer Science at UC-San Diego, he has previously worked for DEC and taught at Washington University. Elected a Fellow of the ACM in 2002, he holds (with colleagues) 14 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).