Peterson / Davie Computer Networks

A Systems Approach
4. Auflage 2007
ISBN: 978-0-08-047667-4
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 848 Seiten, Web PDF

Reihe: ISSN

Computer Networks, 4E is the only introductory computer networking book written by authors who have had first-hand experience with many of the protocols discussed in the book, who have actually designed some of them as well, and who are still actively designing the computer networks today.
This newly revised edition continues to provide an enduring, practical understanding of networks and their building blocks through rich, example-based instruction. The authors' focus is on the why of network design, not just the specifications comprising today's systems but how key technologies and protocols actually work in the real world to solve specific problems. The new edition makes less use of computer code to explain protocols than earlier editions. Moreover, this new edition shifts the focus somewhat higher in the protocol stack where there is generally more innovative and exciting work going on at the application and session layers than at the link and physical layers.
* Completely updated with new sidebar discussions that cover the deployment status of protocols described in the book.
* Addition of sizeable number of new exercises and solutions.
* Downloadable Opnet network simulation software and lab experiments manual.
* New and revised instructor support material, including Powerpoint slides, eps version of figures appearing in the text; sample exams; lecture notes; UNIX sockets programming assignments.


Larry L. Peterson is the Robert E. Kahn Professor of Computer Science at Princeton University, as well as Vice President and Chief Scientist at Verivue, Inc. He serves as Director of the PlanetLab Consortium, which focuses on the design of scalable network services and next-generation network architectures. He is a Fellow of the ACM and the IEEE, recipient of the IEEE Kobayashi Computers and Communications Award, and a member of the National Academy of Engineering. Professor Peterson recently served as Editor-in-Chief of the ACM Transactions on Computer Systems, he has been on the Editorial Board for the IEEE/ACM Transactions on Networking and the IEEE Journal on Select Areas in Communication, and he has served as program chair for SOSP, NSDI, and HotNets. Peterson is a member of the National Academy of Engineering, a Fellow of the ACM and the IEEE, and the 2010 recipient of the IEEE Kobayahi Computer and Communication Award. He received his Ph.D. degree from Purdue University in 1985.

Autoren/Hrsg.

Peterson, Larry L.

Davie, Bruce S.

Inhaltsverzeichnis

1;Front cover;1
2;Title page;4
3;Copyright page;5
4;Foreword;8
5;Foreword to the First Edition;10
6;Preface;12
6.1;Audience;12
6.2;Changes in the Fourth Edition;13
6.3;Approach;14
6.4;Pedagogy and Features;15
6.5;Road Map and Course Use;16
6.6;Exercises;18
6.7;Supplemental Materials and Online Resources;19
6.8;Acknowledgments;19
7;Table of Contents;22
8;1 Foundation;31
8.1;Problem: Building a Network;31
8.2;1.1 Applications;33
8.3;1.2 Requirements;35
8.3.1;1.2.1 Connectivity;36
8.3.2;1.2.2 Cost-Effective Resource Sharing;40
8.3.3;1.2.3 Support for Common Services;43
8.4;1.3 Network Architecture;48
8.4.1;1.3.1 Layering and Protocols;49
8.4.2;1.3.2 OSI Architecture;55
8.4.3;1.3.3 Internet Architecture;57
8.5;1.4 Implementing Network Software;59
8.5.1;1.4.1 Application Programming Interface (Sockets);60
8.5.2;1.4.2 Example Application;62
8.5.3;1.4.3 Protocol Implementation Issues;66
8.6;1.5 Performance;69
8.6.1;1.5.1 Bandwidth and Latency;69
8.6.2;1.5.2 Delay × Bandwidth Product;73
8.6.3;1.5.3 High-Speed Networks;75
8.6.4;1.5.4 Application Performance Needs;77
8.7;1.6 Summary;79
8.8;Open Issue: Ubiquitous Networking;80
8.9;Further Reading;81
8.10;Exercises;84
9;2 Direct Link Networks;93
9.1;Problem: Physically Connecting Hosts;93
9.2;2.1 Hardware Building Blocks;95
9.2.1;2.1.1 Nodes;95
9.2.2;2.1.2 Links;100
9.3;2.2 Encoding (NRZ, NRZI, Manchester, 4B/5B);108
9.4;2.3 Framing;113
9.4.1;2.3.1 Byte-Oriented Protocols (PPP);113
9.4.2;2.3.2 Bit-Oriented Protocols (HDLC);116
9.4.3;2.3.3 Clock-Based Framing (SONET);118
9.5;2.4 Error Detection;121
9.5.1;2.4.1 Two-Dimensional Parity;122
9.5.2;2.4.2 Internet Checksum Algorithm;123
9.5.3;2.4.3 Cyclic Redundancy Check;125
9.6;2.5 Reliable Transmission;130
9.6.1;2.5.1 Stop-and-Wait;131
9.6.2;2.5.2 Sliding Window;134
9.6.3;2.5.3 Concurrent Logical Channels;144
9.7;2.6 Ethernet (802.3);145
9.7.1;2.6.1 Physical Properties;145
9.7.2;2.6.2 Access Protocol;148
9.7.3;2.6.3 Experience with Ethernet;152
9.8;2.7 Rings (802.5, FDDI, RPR);153
9.8.1;2.7.1 Token Ring Media Access Control;156
9.8.2;2.7.2 Token Ring Maintenance;158
9.8.3;2.7.3 FDDI;159
9.8.4;2.7.4 Resilient Packet Ring (802.17);160
9.9;2.8 Wireless;162
9.9.1;2.8.1 Bluetooth (802.15.1);165
9.9.2;2.8.2 Wi-Fi (802.11);166
9.9.3;2.8.3 WiMAX (802.16);172
9.9.4;2.8.4 Cell Phone Technologies;174
9.10;2.9 Summary;176
9.11;Open Issue: Sensor Networks;177
9.12;Further Reading;178
9.13;Exercises;180
10;3 Packet Switching;195
10.1;Problem: Not All Networks Are Directly Connected;195
10.2;3.1 Switching and Forwarding;197
10.2.1;3.1.1 Datagrams;199
10.2.2;3.1.2 Virtual Circuit Switching;201
10.2.3;3.1.3 Source Routing;208
10.3;3.2 Bridges and LAN Switches;212
10.3.1;3.2.1 Learning Bridges;213
10.3.2;3.2.2 Spanning Tree Algorithm;216
10.3.3;3.2.3 Broadcast and Multicast;221
10.3.4;3.2.4 Limitations of Bridges;222
10.4;3.3 Cell Switching (ATM);224
10.4.1;3.3.1 Cells;224
10.4.2;3.3.2 Segmentation and Reassembly;229
10.4.3;3.3.3 Virtual Paths;234
10.4.4;3.3.4 Physical Layers for ATM;235
10.5;3.4 Implementation and Performance;237
10.5.1;3.4.1 Ports;239
10.5.2;3.4.2 Fabrics;243
10.6;3.5 Summary;247
10.7;Open Issue: The Future of Switching;248
10.8;Further Reading;248
10.9;Exercises;250
11;4 Internetworking;261
11.1;Problem: There Is More Than One Network;261
11.2;4.1 Simple Internetworking (IP);263
11.2.1;4.1.1 What Is an Internetwork?;263
11.2.2;4.1.2 Service Model;265
11.2.3;4.1.3 Global Addresses;277
11.2.4;4.1.4 Datagram Forwarding in IP;279
11.2.5;4.1.5 Address Translation (ARP);283
11.2.6;4.1.6 Host Configuration (DHCP);288
11.2.7;4.1.7 Error Reporting (ICMP);291
11.2.8;4.1.8 Virtual Networks and Tunnels;291
11.3;4.2 Routing;295
11.3.1;4.2.1 Network as a Graph;297
11.3.2;4.2.2 Distance Vector (RIP);298
11.3.3;4.2.3 Link State (OSPF);306
11.3.4;4.2.4 Metrics;315
11.3.5;4.2.5 Routing for Mobile Hosts;318
11.3.6;4.2.6 Router Implementation;323
11.4;4.3 Global Internet;326
11.4.1;4.3.1 Subnetting;328
11.4.2;4.3.2 Classless Routing (CIDR);332
11.4.3;4.3.3 Interdomain Routing (BGP);335
11.4.4;4.3.4 Routing Areas;345
11.4.5;4.3.5 IP Version 6 (IPv6);347
11.5;4.4 Multicast;358
11.5.1;4.4.1 Multicast Addresses;360
11.5.2;4.4.2 Multicast Routing (DVMRP, PIM, MSDP);361
11.6;4.5 Multiprotocol Label Switching;372
11.6.1;4.5.1 Destination-Based Forwarding;373
11.6.2;4.5.2 Explicit Routing;379
11.6.3;4.5.3 Virtual Private Networks and Tunnels;381
11.7;4.6 Summary;385
11.8;Open Issue: Deployment of IPv6;387
11.9;Further Reading;388
11.10;Exercises;389
12;5 End-to-End Protocols;409
12.1;Problem: Getting Processes to Communicate;409
12.2;5.1 Simple Demultiplexer (UDP);411
12.3;5.2 Reliable Byte Stream (TCP);413
12.3.1;5.2.1 End-to-End Issues;414
12.3.2;5.2.2 Segment Format;416
12.3.3;5.2.3 Connection Establishment and Termination;419
12.3.4;5.2.4 Sliding Window Revisited;423
12.3.5;5.2.5 Triggering Transmission;429
12.3.6;5.2.6 Adaptive Retransmission;432
12.3.7;5.2.7 Record Boundaries;436
12.3.8;5.2.8 TCP Extensions;437
12.3.9;5.2.9 Alternative Design Choices;439
12.4;5.3 Remote Procedure Call;440
12.4.1;5.3.1 RPC Fundamentals;441
12.4.2;5.3.2 RPC Implementations (SunRPC, DCE);448
12.5;5.4 Transport for Real-Time Applications (RTP);455
12.5.1;5.4.1 Requirements;457
12.5.2;5.4.2 RTP Details;458
12.5.3;5.4.3 Control Protocol;462
12.6;5.5 Performance;466
12.7;5.6 Summary;469
12.8;Open Issue: Application-Specific Protocols;470
12.9;Further Reading;471
12.10;Exercises;472
13;6 Congestion Control and Resource Allocation;485
13.1;Problem: Allocating Resources;485
13.2;6.1 Issues in Resource Allocation;487
13.2.1;6.1.1 Network Model;487
13.2.2;6.1.2 Taxonomy;491
13.2.3;6.1.3 Evaluation Criteria;493
13.3;6.2 Queuing Disciplines;496
13.3.1;6.2.1 FIFO;497
13.3.2;6.2.2 Fair Queuing;498
13.4;6.3 TCP Congestion Control;503
13.4.1;6.3.1 Additive Increase/Multiplicative Decrease;503
13.4.2;6.3.2 Slow Start;506
13.4.3;6.3.3 Fast Retransmit and Fast Recovery;512
13.5;6.4 Congestion-Avoidance Mechanisms;515
13.5.1;6.4.1 DECbit;515
13.5.2;6.4.2 Random Early Detection (RED);516
13.5.3;6.4.3 Source-Based Congestion Avoidance;522
13.6;6.5 Quality of Service;528
13.6.1;6.5.1 Application Requirements;529
13.6.2;6.5.2 Integrated Services (RSVP);535
13.6.3;6.5.3 Differentiated Services (EF, AF);545
13.6.4;6.5.4 Equation-Based Congestion Control;551
13.7;6.6 Summary;553
13.8;Open Issue: Inside versus Outside the Network;554
13.9;Further Reading;555
13.10;Exercises;556
14;7 End-to-End Data;571
14.1;Problem: What Do We Do with the Data?;571
14.2;7.1 Presentation Formatting;573
14.2.1;7.1.1 Taxonomy;574
14.2.2;7.1.2 Examples (XDR, ASN.1, NDR);578
14.2.3;7.1.3 Markup Languages (XML);582
14.3;7.2 Data Compression;586
14.3.1;7.2.1 Lossless Compression Algorithms;588
14.3.2;7.2.2 Image Compression (JPEG);590
14.3.3;7.2.3 Video Compression (MPEG);595
14.3.4;7.2.4 Transmitting MPEG over a Network;600
14.3.5;7.2.5 Audio Compression (MP3);604
14.4;7.3 Summary;605
14.5;Open Issue: Computer Networks Meet Consumer Electronics;606
14.6;Further Reading;607
14.7;Exercises;608
15;8 Network Security;615
15.1;Problem: Security Attacks;615
15.2;8.1 Cryptographic Tools;618
15.2.1;8.1.1 Principles of Ciphers;618
15.2.2;8.1.2 Symmetric-Key Ciphers;620
15.2.3;8.1.3 Public-Key Ciphers;622
15.2.4;8.1.4 Authenticators;624
15.3;8.2 Key Predistribution;628
15.3.1;8.2.1 Predistribution of Public Keys;628
15.3.2;8.2.2 Predistribution of Symmetric Keys;633
15.4;8.3 Authentication Protocols;633
15.4.1;8.3.1 Originality and Timeliness Techniques;634
15.4.2;8.3.2 Public-Key Authentication Protocols;635
15.4.3;8.3.3 Symmetric-Key Authentication Protocols;636
15.4.4;8.3.4 Diffie-Hellman Key Agreement;640
15.5;8.4 Secure Systems;642
15.5.1;8.4.1 Pretty Good Privacy (PGP);642
15.5.2;8.4.2 Secure Shell (SSH);644
15.5.3;8.4.3 Transport Layer Security (TLS, SSL, HTTPS);647
15.5.4;8.4.4 IP Security (IPsec);651
15.5.5;8.4.5 Wireless Security (802.11i);654
15.6;8.5 Firewalls;655
15.6.1;8.5.1 Strengths and Weaknesses of Firewalls;658
15.7;8.6 Summary;660
15.8;Open Issue: Denial-of-Service Attacks;661
15.9;Further Reading;662
15.10;Exercises;663
16;9 Applications;669
16.1;Problem: Applications Need Their Own Protocols;669
16.2;9.1 Traditional Applications;671
16.2.1;9.1.1 Electronic Mail (SMTP, MIME, IMAP);672
16.2.2;9.1.2 World Wide Web (HTTP);679
16.2.3;9.1.3 Name Service (DNS);686
16.2.4;9.1.4 Network Management (SNMP);695
16.3;9.2 Web Services;697
16.3.1;9.2.1 Custom Application Protocols (WSDL, SOAP);699
16.3.2;9.2.2 A Generic Application Protocol (REST);705
16.4;9.3 Multimedia Applications;707
16.4.1;9.3.1 Session Control and Call Control (SDP, SIP, H.323);708
16.4.2;9.3.2 Resource Allocation for Multimedia Applications;717
16.5;9.4 Overlay Networks;722
16.5.1;9.4.1 Routing Overlays;724
16.5.2;9.4.2 Peer-to-Peer Networks (Gnutella, BitTorrent);731
16.5.3;9.4.3 Content Distribution Networks;743
16.6;9.5 Summary;748
16.7;Open Issue: New Network Architecture;749
16.8;Further Reading;750
16.9;Exercises;751
17;Solutions to Select Excercises;758
17.1;Chapter 1;758
17.2;Chapter 2;759
17.3;Chapter 3;761
17.4;Chapter 4;762
17.5;Chapter 5;764
17.6;Chapter 6;765
17.7;Chapter 7;771
18;Glossary;772
19;Bibliography;798
20;Index;814