did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9781558605145

Computer Networks : A Systems Approach

by ;
  • ISBN13:

    9781558605145

  • ISBN10:

    1558605142

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 1999-10-01
  • Publisher: Elsevier Science Ltd
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $96.95

Summary

NEW EDITION NOW AVAILABLE! ISBN 1-55860-832-X Networking technologies and practices are constantly evolving. Equip your students with an understanding that helps them keep pace with Internet time. In this carefully focused revision of the best-selling first edition, authors Peterson and Davie reiterate their commitment to a systems-oriented approach to networking instruction. Focusing on the why of network designnot just the specifications comprising today's systems but how key technologies and protocols actually work in the real world to solve specific problemsthey promote an enduring, practical understanding of networks and their building blocks. The second edition incorporates coverage of Quality of Service issues, mobile and wireless networks, VPNs, and much more. Over 100 new exercises help users consolidate and expand their knowledge. No other textbook offers a more solid grounding for aspiring network professionals. Computer Networks: A Systems Approach gives your students the knowledge and perspective they need and gives you the tools you need to maximize their learning experience: * Unparalleled instruction from an expert team of authors. The authors bring over 30 years of experience in networking research, development and teaching to the task of describing the principles and practical implementation of computer networks. Both have played key roles in defining and implementing many of the protocols discussed inside. * Cutting-edge coverage. The second edition has been thoroughly updated to cover the most recent advances in networking, including: * a new chapter on security techniques - PGP, IPSEC, secure sockets and firewalls * a new chapter on application layer protocols - SMTP, HTTP, SNMP, DNS and RTP * new material on wireless and mobile technology- spread spectrum techniques and 802.11 * new section on building VPN's on top of the public Internet * Expanded treatment of key issues. Topics such as Internet routing, Quality of Service, congestion control, ATM, compression and multimedia communications now delve deeper to reflect changes that have taken place over the past four years. * Effective pedagogical components. Alongside the authors' clear explanations and insights, you'll find pedagogical components that significantly enhance students' understanding: * Problem statementsthe practical design challenges met by the techniques covered in each chapter * Shaded sidebars explorations of advanced topics * Highlighted summary paragraphs distillations of key network design principles * Open Issuesguided discussions of controversial networking issues * Further readingpointers to definitive papers related to each chapter's coverage * Completely revamped end-of-chapter exercises The second edition offers over 100 new end-of-chapter exercises, the result of a substantial editing and development effort by a seasoned networking instructor, Peter Dordal of Loyola University. * The optimal pedagogical approach. Encyclopedic and "layered" approaches cover required material but leave critical questions unanswered. Peterson and Davie focus on systemshow they interweave technology and technique to meet practical needs. Adding layer-focused considerations where necessary, the authors teach students why networks are designed as they are and cultivate the skills needed to build the networks of the future. * Real-world implementation examples. New to this edition, operating system-independent C code is used with pseudocode to illustrate protocol implementation throughout. The first edition's x-kernel examples continue to be available online.

Author Biography

Larry L. Peterson is a Professor of Computer Science at Princeton University.

Table of Contents

Foreword vii(2)
Foreword to the First Edition ix(10)
Preface xix
1 Foundation
2(66)
Problem: Building a Network 2(2)
1.1 Requirements
4(25)
1.1.1 Connectivity
4(4)
1.1.2 Cost-Effective Resource Sharing
8(4)
1.1.3 Support for Common Services
12(8)
1.1.4 Performance
20(9)
1.2 Network Architecture
29(12)
1.2.1 Layering and Protocols
30(6)
1.2.2 OSI Architecture
36(2)
1.2.3 Internet Architecture
38(3)
1.3 Implementing Network Software
41(15)
1.3.1 Application Programming Interface (Sockets)
42(3)
1.3.2 Example Application
45(3)
1.3.3 Protocol Implementation Issues
48(8)
1.4 Summary
56(1)
Open Issue: Ubiquitous Networking
57(1)
Further Reading
58(2)
Exercises
60(8)
2 Direct Link Networks
68(102)
Problem: Physically Connecting Hosts 68(2)
2.1 Hardware Building Blocks
70(10)
2.1.1 Nodes
70(1)
2.1.2 Links
71(9)
2.2 Encoding (NRZ, NRZI, Manchester, 4B/5B)
80(4)
2.3 Framing
84(8)
2.3.1 Byte-Oriented Protocols (BISYNC, PPP, DDCMP)
84(3)
2.3.2 Bit-Oriented Protocols (HDLC)
87(2)
2.3.3 Clock-Based Framing (SONET)
89(3)
2.4 Error Detection
92(9)
2.4.1 Two-Dimensional Parity
94(1)
2.4.2 Internet Checksum Algorithm
94(2)
2.4.3 Cyclic Redundancy Check
96(5)
2.5 Reliable Transmission
101(15)
2.5.1 Stop-and-Wait
103(2)
2.5.2 Sliding Window
105(10)
2.5.3 Concurrent Logical Channels
115(1)
2.6 Ethernet (802.3)
116(9)
2.6.1 Physical Properties
117(2)
2.6.2 Access Protocol
119(5)
2.6.3 Experience with Ethernet
124(1)
2.7 Token Rings (802.5, FDDI)
125(11)
2.7.1 Physical Properties
126(1)
2.7.2 Token Ring Media Access Control
127(2)
2.7.3 Token Ring Maintenance
129(2)
2.7.4 Frame Format
131(1)
2.7.5 FDDI
132(4)
2.8 Wireless (802.11)
136(6)
2.8.1 Physical Properties
136(1)
2.8.2 Collision Avoidance
137(2)
2.8.3 Distribution System
139(2)
2.8.4 Frame Format
141(1)
2.9 Network Adaptors
142(11)
2.9.1 Components
142(1)
2.9.2 View from the Host
143(5)
2.9.3 Device Drivers
148(3)
2.9.4 Memory Bottleneck
151(2)
2.10 Summary
153(1)
Open Issue: Does It Belong in Hardware?
154(1)
Further Reading
155(1)
Exercises
156(14)
3 Packet Switching
170(76)
Problem: Not All Networks Are Directly Connected 170(76)
3.1 Switching and Forwarding
172(14)
3.1.1 Datagrams
174(2)
3.1.2 Virtual Circuit Switching
176(7)
3.1.3 Source Routing
183(2)
3.1.4 Implementation and Performance
185(1)
3.2 Bridges and LAN Switches
186(12)
3.2.1 Learning Bridges
187(3)
3.2.2 Spanning Tree Algorithm
190(5)
3.2.3 Broadcast and Multicast
195(1)
3.2.4 Limitations of Bridges
196(2)
3.3 Cell Switching (ATM)
198(17)
3.3.1 Cells
198(5)
3.3.2 Segmentation and Reassembly
203(6)
3.3.3 Virtual Paths
209(1)
3.3.4 Physical Layers for ATM
210(1)
3.3.5 ATM in the LAN
211(4)
3.4 Switching Hardware
215(17)
3.4.1 Design Goals
216(3)
3.4.2 Ports and Fabrics
219(2)
3.4.3 Crossbar Switches
221(5)
3.4.4 Shared-Media Switches
226(1)
3.4.5 Self-Routing Fabrics
227(5)
3.5 Summary
232(1)
Open Issue: The Future of ATM
233(1)
Further Reading
234(1)
Exercises
235(11)
4 Internetworking
246(122)
Problem: There Is More Than One Network 246(2)
4.1 Simple Internetworking (IP)
248(32)
4.1.1 What Is an Internetwork?
248(2)
4.1.2 Service Model
250(12)
4.1.3 Global Addresses
262(2)
4.1.4 Datagram Forwarding in IP
264(4)
4.1.5 Address Translation (ARP)
268(5)
4.1.6 Host Configuration (DHCP)
273(3)
4.1.7 Error Reporting (ICMP)
276(1)
4.1.8 Virtual Networks and Tunnels
277(3)
4.2 Routing
280(29)
4.2.1 Network as a Graph
282(2)
4.2.2 Distance Vector (RIP)
284(8)
4.2.3 Link State (OSPF)
292(9)
4.2.4 Metrics
301(3)
4.2.5 Routing for Mobile Hosts
304(5)
4.3 Global Internet
309(31)
4.3.1 Subnetting
311(5)
4.3.2 Classless Routing (CIDR)
316(3)
4.3.3 Interdomain Routing (BGP)
319(7)
4.3.4 Routing Areas
326(2)
4.3.5 IP version 6 (IPv6)
328(12)
4.4 Multicast
340(10)
4.4.1 Link-State Multicast
341(3)
4.4.2 Distance-Vector Multicast
344(2)
4.4.3 Protocol Independent Multicast (PIM)
346(4)
4.5 Summary
350(1)
Open Issue: IP, ATM, and MPLS
351(1)
Further Reading
352(2)
Exercises
354(14)
5 End-to-End Protocols
368(78)
Problem: Getting Processes to Communicate 368(78)
5.1 Simple Demultiplexer (UDP)
370(1)
5.2 Reliable Byte Stream (TCP)
371(26)
5.2.1 End-to-End Issues
373(2)
5.2.2 Segment Format
375(3)
5.2.3 Connection Establishment and Termination
378(5)
5.2.4 Sliding Window Revisited
383(6)
5.2.5 Adaptive Retransmission
389(4)
5.2.6 Record Boundaries
393(1)
5.2.7 TCP Extensions
394(1)
5.2.8 Alternative Design Choices
395(2)
5.3 Remote Procedure Call
397(29)
5.3.1 Bulk Transfer (BLAST)
400(7)
5.3.2 Request/Reply (CHAN)
407(10)
5.3.3 Dispatcher (SELECT)
417(3)
5.3.4 Putting It All Together (SunRPC, DCE)
420(6)
5.4 Performance
426(4)
5.4.1 Experimental Method
427(1)
5.4.2 Latency
428(2)
5.4.3 Throughput
430(1)
5.5 Summary
430(1)
Open Issue: Application-Specific Protocols
431(1)
Further Reading
432(1)
Exercises
433(13)
6 Congestion Control and Resource Allocation
446(82)
Problem: Allocating Resources 446(2)
6.1 Issues in Resource Allocation
448(9)
6.1.1 Network Model
448(4)
6.1.2 Taxonomy
452(2)
6.1.3 Evaluation Criteria
454(3)
6.2 Queuing Disciplines
457(7)
6.2.1 FIFO
458(1)
6.2.2 Fair Queuing
459(5)
6.3 TCP Congestion Control
464(11)
6.3.1 Additive Increase/Multiplicative Decrease
465(3)
6.3.2 Slow Start
468(4)
6.3.3 Fast Retransmit and Fast Recovery
472(3)
6.4 Congestion-Avoidance Mechanisms
475(13)
6.4.1 DECbit
475(1)
6.4.2 Random Early Detection (RED)
476(6)
6.4.3 Source-Based Congestion Avoidance
482(6)
6.5 Quality of Service
488(25)
6.5.1 Application Requirements
489(5)
6.5.2 Integrated Services (RSVP)
494(11)
6.5.3 Differentiated Services
505(4)
6.5.4 ATM Quality of Service
509(4)
6.6 Summary
513(1)
Open Issue: Inside versus Outside the Network
513(1)
Further Reading
514(2)
Exercises
516(12)
7 End-to-End Data
528(40)
Problem: What Do We Do with the Data? 528(2)
7.1 Presentation Formatting
530(9)
7.1.1 Taxonomy
531(4)
7.1.2 Examples (XDR, ASN.1, NDR)
535(4)
7.2 Data Compression
539(20)
7.2.1 Lossless Compression Algorithms
541(2)
7.2.2 Image Compression (JPEG)
543(5)
7.2.3 Video Compression (MPEG)
548(5)
7.2.4 Transmitting MPEG over a Network
553(4)
7.2.5 Audio Compression (MP3)
557(2)
7.3 Summary
559(1)
Open Issue: Computer Networks Meet Consumer Electronics
559(1)
Further Reading
560(1)
Exercises
561(7)
8 Network Security
568(54)
Problem: Securing the Data 568(2)
8.1 Cryptographic Algorithms
570(14)
8.1.1 Requirements
572(1)
8.1.2 The Data Encryption Standard (DES)
573(5)
8.1.3 RSA
578(3)
8.1.4 Message Digest 5 (MD5)
581(3)
8.1.5 Implementation and Performance
584(1)
8.2 Security Mechanisms
584(10)
8.2.1 Authentication Protocols
585(3)
8.2.2 Message Integrity Protocols
588(3)
8.2.3 Public Key Distribution (X.509)
591(3)
8.3 Example Systems
594(14)
8.3.1 Privacy Enhanced Mail (PEM)
594(5)
8.3.2 Pretty Good Privacy (PGP)
599(2)
8.3.3 Transport Layer Security (TLS, SSL, HTTPS)
601(4)
8.3.4 IP Security (IPSEC)
605(3)
8.4 Firewalls
608(5)
8.4.1 Filter-Based Firewalls
609(1)
8.4.2 Proxy-Based Firewalls
610(2)
8.4.3 Limitations
612(1)
8.5 Summary
613(1)
Open Issue: Denial-of-Service Attacks
614(1)
Further Reading
615(1)
Exercises
615(7)
9 Applications
622(51)
Problem: Applications Need Their Own Protocols 622(2)
9.1 Name Service (DNS)
624(9)
9.1.1 Domain Hierarchy
625(1)
9.1.2 Name Servers
626(4)
9.1.3 Name Resolution
630(3)
9.2 Traditional Applications
633(16)
9.2.1 Electronic Mail (SMTP, MIME)
634(6)
9.2.2 World Wide Web (HTTP)
640(6)
9.2.3 Network Management (SNMP)
646(3)
9.3 Multimedia Applications
649(13)
9.3.1 Requirements
651(2)
9.3.2 Real-time Transport Protocol (RTP)
653(7)
9.3.3 Session Control and Call Control (H.323)
660(2)
9.4 Summary
662(1)
Open Issue: Programming the Network
663(1)
Further Reading
664(1)
Exercises
665(8)
Glossary 673(26)
References 699(18)
Index 717(32)
About the Authors 749

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program