Network Algorithmics

An Interdisciplinarity Approach to Designing Fast Networked Devices

George Varghese

465 pages, parution le 18/01/2005

Ajouter à une liste

Indisponible

Résumé

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.

Features

Addresses the bottlenecks found in all kinds of network devices, (data copying, control transfer, demultiplexing, timers, and more) and offers ways to break them.
Presents techniques suitable specifically for endnodes, including Web servers.
Presents techniques suitable specifically for interconnect devices, including routers, bridges, and gateways.
Written as a practical guide for implementers but full of valuable insights for students, teachers, and researchers.
Includes end-of-chapter summaries and exercises (with solutions and lecture slides available online).

L'auteur - George Varghese

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).

Sommaire

Introducing Network Algorithmics
Network Implementation Models
Fifteen Implementation Principles
Principles in Action
Copying Data
Transfering Control
Maintaining Timers
Demultiplexing
Protocol Processing
Exact Match Lookups
Prefix Match Lookups
Packet Classification
Switching
Scheduling Packets
Routers as Distributed Systems
Measuring Network Traffic
Network Security
Conclusions
Appendix A: Detailed Models

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Morgan Kaufmann
Auteur(s)	George Varghese
Parution	18/01/2005
Nb. de pages	465
Format	19,5 x 24
Couverture	Relié
Poids	1185g
Intérieur	Noir et Blanc
EAN13	9780120884773
ISBN13	978-0-12-088477-3