`
`
`
` Merilee Ford
`
`H. Kim Lew
`Steve Spanier
`Tim Stevenson
`
`Cisco SYSTEMS
`
`Cisco PRESS
`
`* Riders
`
`New Riders Publishing
`201 West 103rd Street
`Indianapolis, IN 46290 USA
`
`1
`
`SAMSUNG 1013
`
`SAMSUNG 1013
`
`1
`
`
`
`Copyright © 1997 by New Riders Publishing
`
`Cisco Press logo is a trademark of Cisco Systems,Inc.
`All rights reserved. No part of this book may be reproduced or transmitted in any form or by any
`means,electronic or mechanical, including photocopying, recording, or by any information stor-
`age andretrieval system, without written permission from the publisher, except for the inclusion
`of brief quotations in a review.
`
`Printed in the United States of America 1234567890
`
`Library of Congress Cataloging-in-Publication Data
`
`*** CYP data available upon request* **
`
`Warning and Disclaimer
`This book is designed to provide information about internetworking technologies. Every effort
`has been made to make this book as complete and as accurate as possible, but no warranty or
`fitness is implied.
`The information is provided on an “as is” basis. The author, New Riders Publishing, and Cisco
`SystemsInc. shall have neitherliability nor responsibility to any person orentity with respect to
`any loss or damagesarising from the information contained in this book or from the use of the
`disks or programs that may accompanyit.
`
`Publisher:
`Publishing Manager:
`Executive Editor-in-Chief:
`Cisco Systems Representative:
`Marketing Manager:
`Managing Editor:
`
`Don Fowley
`Julie Fairweather
`Ann Trump Daniel, Macmillan
`H. Kim Lew, Cisco Systems
`Mary Foote
`Carla Hall
`
`Project Managers:
`
`Senior Editors:
`
`CopyEditor:
`Technical Editor:
`Cover Designer:
`Cover Production:
`
`Cover Art:
`Interior Layout and Design:
`Indexer:
`
`Tracy Turgeson
`Gina Brown
`Cliff Shubs
`Sarah Kearns
`Suzanne Snyder
`Krista Hansing
`H. Kim Lew
`Sandra Schroeder
`Aren Howell
`Provided by Cisco Systems
`Argosy
`Brad Herriman
`
`2
`
`
`
` Contents
`
`at a Glance
`
`PART 1
`
`INTRODUCTION TO INTERNETWORKING
`
`Chapter1
`
`Internetworking Basics
`3
`Whatis an Internetwork?
`3
`OpenSystems Interconnection (OSI) Reference Model
`Information Formats
`17
`20
`ISO Hierarchy of Networks
`Connection-Oriented and Connectionless Network
`
`5
`
`Services
`21
`Internetwork Addressing
`Flow-Control Basics
`30
`Error-Checking Basics
`31
`32
`Multiplexing Basics
`Standards Organizations
`
`23
`
`34
`
`Chapter 2
`
`Introduction to LAN Protocols
`
`37
`
`WhatisaLAN?
`
`38
`
`LAN Protocols and the OSI Reference Model
`
`38
`
`LAN Media-Access Methods
`
`LANTransmission Methods
`
`39
`
`40
`
`ili
`
`3
`
`
`
`iv
`
`Internetworking Technologies Handbook
`
`LAN Topologies
`LAN Devices
`
`42
`
`40
`
`Chapter 3
`
`Introduction to WAN Technologies
`What isa WAN?
`45
`
`45
`
`Point-to-Point Links
`47
`Circuit Switching
`48
`Packet Switching
`WANVirtual Circuits
`WANDialup Services
`WAN Devices
`50
`
`46
`
`49
`50
`
`Chapter 4
`
`Chapter 5
`
`Bridging and Switching Basics
`What are Bridges and Switches?
`Link-Layer Device Overview
`Types of Bridges
`58
`Types of Switches
`60
`
`56
`
`55
`55
`
`63
`Routing Basics
`63
`What is Routing?
`Routing Components
`Routing Algorithms
`Network Protocols
`
`64
`67
`75
`
`Chapter 6
`
`77
`Network Management Basics
`77
`Whatis Network Management?
`Network Management Architecture
`ISO Network Management Model
`
`78
`79
`
`PART 2
`
`LAN PROTOCOLS
`
`Chapter 7
`
`Ethernet Technologies
`Background
`87
`
`987
`
`
`
`4
`
`
`
`Contents at a Glance
`
`Ethernet and [EEE 802.3
`100-Mbps Ethernet
`93
`100VG-AnyLAN=103
`Gigabit Ethernet
`106
`
`88
`
`Chapter 8
`
`Chapter 9
`
`111
`
`Fiber Distributed Data Interface (FDDI)
`Background
`111
`FDDI Transmission Media
`FDDISpecifications
`114
`FDDIStation-Attachment Types
`FDDI Fault Tolerance
`117
`
`116
`
`113
`
`FDDI Frame Format
`122
`Copper-Distributed Data Interface (CDDI)
`
`123
`
`125
`
`Token Ring/IEEE 802.5
`Background
`125
`Physical Connections
`Token Ring Operation
`Priority System 128
`Fault-Management Mechanisms
`Frame Format
`129
`
`126
`127
`
`129
`
`PART 3
`
`WAN TECHNOLOGIES
`
`Chapter 10
`
`135
`Frame Relay
`135
`Background
`137
`Frame Relay Devices
`138
`Frame Relay Virtual Circuits
`141
`Congestion-Control Mechanisms
`Frame Relay Local ManagementInterface (LMI)
`Frame Relay Network Implementation
`143
`Frame Relay Frame Formats
`145
`
`142
`
`
`
`
`
`5
`
`
`
`Vi
`
`Internetworking Technologies Handbook
`
`Chapter 11
`
`High-Speed Serial Interface
`Background
`151
`HSSI Interface Basics
`HSSI Operation
`152
`
`151
`
`151
`
`Chapter 12
`
`Chapter 13
`
`Chapter 14
`
`155
`
`Integrated Services Digital Network (ISDN)
`Background
`155
`ISDN Components
`Services
`157
`Layer1
`158
`Layer2
`160
`Layer3
`161
`
`155
`
`163
`
`Point-to-Point Protocol
`Background
`163
`163
`PPP Components
`164
`General Operation
`Physical-Layer Requirements
`PPP Link Layer
`165
`
`164
`
`169
`
`Switched Multimegabit Data Service (SMDS)
`Background
`169
`169
`SMDS Network Components
`171
`SMDSInterface Protocol (SIP)
`Distributed Queue Dual Bus (DQDB)
`SMDS Access Classes
`174
`175
`SMDS Addressing Overview
`SMDS Reference: SIP Level 3 PDU Format
`
`173
`
`176
`
`SMDS Reference: SIP Level 2 Cell Format
`
`178
`
`Chapter 15
`
`Asymmetric Digital Subscriber Line (ADSL)
`Background
`181
`ADSL Technology Overview
`
`182
`
`181
`
`
`
`6
`
`
`
`Contents at a Glance
`vii
`
`Chapter 16
`
`Chapter 17
`
`183
`ADSL Operation
`ADSL Reference Model
`
`185
`
`Synchronous Data-Link Control and
`Derivatives
`189
`Background
`189
`SDLC Types and Topologies
`SDLC Frame Format
`190
`
`190
`
`Derivative Protocols
`
`193
`
`X.25
`197
`197
`Background
`X.25 Devices and Protocol Operation
`X.25 Protocol Suite
`201
`
`197
`
`LAPB Frame Format
`X.121 Address Format
`
`205
`206
`
`PART 4
`
`BRIDGING AND SWITCHING
`
`Chapter 18
`
`211
`
`212
`
`AsynchronousTransfer Mode (ATM) Switching
`Background
`211
`ATM Devices and Network Environment
`ATM Cell-Header Format
`215
`ATM Services
`217
`ATM Switching Operation
`ATM Reference Model
`219
`ATM Addressing
`224
`ATM Connections
`227
`228
`ATM and Multicasting
`229
`ATM Quality of Service (QOS)
`ATMSignaling and Connection Establishment
`ATM Connection-Management Messages
`231
`LAN Emulation (LANE)
`232
`
`218
`
`230
`
`7
`
`
`
`Vili
`
`Internetworking Technologies Handbook
`
`Chapter 19
`
`243
`
`Data-Link Switching
`Background
`243
`DLSw Contrasted with Source-Route Bridging
`DLSw SNA Support
`246
`DLSw Switch-to-Switch Protocol (SSP)
`DLSw Operation
`248
`DLSw Message Formats
`
`245
`
`248
`
`253
`
`LAN Switching
`Background
`259
`260
`LAN Switch Operation
`LAN Switch and the OSI Model=263
`
`Chapter 20
`
`259
`
`Chapter 21
`
`266
`268
`
`265
`Tag Switching
`Background
`265
`Tag-Switching Architecture
`Destination-Based Routing
`Hierarchical Routing
`271
`Flexible Routing using Explicit Routes
`Multicast Routing
`273
`Tag Switching with ATM 274
`Quality of Service
`275
`IP Switching
`276
`
`272
`
`Chapter 22
`
`277
`
`Mixed-Media Bridging
`Background
`277
`278
`Translation Challenges
`280
`Translational Bridging
`Source-Route Transparent Bridging
`
`283
`
`Chapter 23
`
`Source-Route Bridging (SRB)
`Background
`285
`SRB Algorithm 285
`Frame Format
`287
`
`285
`
`8
`
`
`
`Contents at a Glance
`ix
`
`Chapter 24
`
`291
`
`Transparent Bridging
`Background
`291
`Transparent Bridging Operation
`Frame Format
`297
`
`291
`
`PART 5
`
`NETWORK PROTOCOLS
`
`Chapter 25
`
`Chapter 26
`
`301
`AppleTalk
`301
`Background
`302
`AppleTalk Network Components
`AppleTalk Physical and Data-Link Layers
`Network Addresses
`313
`315
`AppleTalk Address-Resolution Protocol (AARP)
`Datagram-Delivery Protocol (DDP) Overview 317
`AppleTalk Transport Layer
`318
`AppleTalk Upper-Layer Protocols
`AppleTalk Protocol Suite
`328
`
`307
`
`324
`
`DECnet
`331
`331
`Background
`DECnetPhase IV Digital Network Architecture
`(DNA)
`332
`DECnet/OSI Digital Network Architecture (DNA)
`DECnet Media Access
`336
`DECnet Routing
`337
`DECnet End-Communications Layer
`DECnet/OSI Transport Layer
`339
`DECnet Phase IV Upper Layers
`339
`DECnet/OSI Upper Layers
`341
`
`338
`
`335
`
`Chapter 27
`
`IBM Systems Network Architecture (SNA)
`Protocols
`345
`Background
`345
`Traditional SNA Environments
`
`346
`
`9
`
`
`
`Chapter 28
`
`Chapter 29
`
`Internetworking Technologies Handbook
`
`353
`IBM Peer-Based Networking
`Basic Information Unit (BIU) Format
`Path-Information Unit (PIU) Format
`
`360
`361
`
`365
`
`Internet Protocols
`Background
`365
`366
`Internet Protocol (IP)
`Address-Resolution Protocol (ARP) Overview 377
`Internet Routing
`377
`Internet Control-Message Protocol (ICMP)
`Transmission-Control Protocol (TCP)
`381
`User Datagram Protocol (UDP)
`385
`Internet Protocols Application-Layer Protocols
`
`379
`
`386
`
`389
`
`NetWare Protocols
`Background
`389
`391
`NetWare Media Access
`Internetwork Packet Exchange (IPX) Overview 391
`IPX Encapsulation Types
`392
`Service-Advertisement Protocol (SAP)
`NetWare Transport Layer
`394
`NetWare Upper-Layer Protocols and Services
`IPX Packet Format
`396
`
`393
`
`395
`
`Chapter 30
`
`Open System Interconnection (OSI) Protocols
`Background
`399
`OSI Networking Protocols
`
`400
`
`399
`
`Chapter 31
`
`411
`
`Banyan VINES
`Background
`411
`Media Access
`412
`Network Layer
`412
`Transport Layer
`420
`Upper-Layer Protocols
`
`420
`
`10
`
`10
`
`
`
`Contents at a Glance
`XISSS
`
`Chapter 32
`
`Xerox Network Systems (XNS)
`Background
`421
`XNS Hierarchy Overview 422
`Media Access
`423
`Network Layer
`423
`Transport Layer
`425
`Upper-Layer Protocols
`
`426
`
`PART 6
`
`ROUTING PROTOCOLS
`
`Border Gateway Protocol (BGP)
`Background
`431
`BGP Operation
`433
`BGP Routing
`434
`BGP Message Types
`BGP Packet Formats
`
`435
`436
`
`421
`
`431
`
`Chapter 33
`
`Chapter 34
`
`Chapter 35
`
`443
`
`Enhanced IGRP
`Background
`443
`Enhanced IGRP Capabilities and Attributes
`Underlying Processes and Technologies
`445
`Routing Concepts
`446
`Enhanced IGRP Packet Types
`
`448
`
`444
`
`IBM Systems Network Architecture (SNA)
`Routing
`451
`Background
`451
`452
`IBM SNASession Connectors
`IBM SNA Transmission Groups (TGs)
`IBM SNA Explicit and Virtual Routes
`IBM SNAClass of Service (COS)
`454
`IBM SNA Subarea Routing
`457
`IBM Advanced Peer-to-Peer Networking (APPN)
`Routing
`458
`
`453
`453
`
`11
`
`11
`
`
`
`Xil
`
`Internetworking Technologies Handbook
`
`Chapter 36
`
`Interior-Gateway Routing Protocol
`Background
`465
`IGRP Protocol Characteristics
`
`466
`
`465
`
`Chapter 37
`
`Internet Protocol (IP) Multicast
`Background
`471
`Internet Group-Membership Protocol (IGMP)
`IP Multicast Routing Protocols
`473
`
`471
`
`NetWare Link-Services Protocol (NLSP)
`Background
`477
`NLSP Hierarchical Routing
`NLSP Operation
`481
`NLSP Hierarchical Addressing
`NLSPHello Packets
`483
`
`482
`
`478
`
`472
`
`477
`
`Chapter 38
`
`Chapter 39
`
`Chapter 40
`
`Open SystemsInterconnection (OSI) Routing
`Protocol
`489
`Background
`489
`491
`End System-to-Intermediate System (ES-IS)
`Intermediate System-to-Intermediate System (IS-IS)
`Integrated IS-IS
`495
`Interdomain Routing Protocol (IDRP)
`
`496
`
`492
`
`499
`
`Open Shortest Path First (OSPF)
`Background
`499
`Routing Hierarchy
`SPF Algorithm 503
`Packet Format
`504
`Additional OSPF Features
`
`500
`
`505
`
`Chapter41
`
`Resource-Reservation Protocol (RSVP)
`Background
`507
`RSVP Data Flows
`
`508
`
`507
`
`12
`
`12
`
`
`
`Contents at a Glance
`Xill
` O-_—OOese
`
`RSVP Quality of Service (QOS)
`RSVPSession Start-up
`511
`RSVPReservation Style
`511
`RSVP Soft State Implementation
`RSVP Operational Model
`514
`RSVP Messages
`517
`RSVP Packet Format
`
`519
`
`510
`
`513
`
`Chapter 42
`
`523
`
`Routing-Information Protocol (RIP)
`Background
`523
`Routing Updates
`RIP Routing Metric
`RIP Stability Features
`RIP Timers
`525
`Packet Formats
`
`524
`524
`525
`
`525
`
`Chapter 43
`
`Simple Multicast Routing Protocol (SMRP)
`Background
`529
`SMRP Multicast Transport Services
`SMRP Transaction Example
`539
`SMRPPacket Format
`540
`
`530
`
`529
`
`PART 7
`
`NETWORK MANAGEMENT
`
`Chapter 44
`
`545
`
`IBM Network Management
`Background
`545
`IBM Network-Management Functional Areas
`IBM Network-Management Architectures
`549
`IBM Network-ManagementPlatforms
`551
`
`546
`
`Chapter 45
`
`Remote Monitoring (RMON)
`Background
`553
`RMON Groups
`
`554
`
`553
`
`13
`
`13
`
`
`
`
`
`xiv Internetworking Technologies Handbook
`
`Chapter 46 Simple Network-ManagementProtocol
`(SNMP)
`557
`557
`Background
`558
`SNMPBasic Components
`559
`SNMP Basic Commands
`SNMP Management-Information Base (MIB)
`SNMPand Data Representation
`562
`SNMPVersion 1 (SNMPv1)
`562
`SNMPVersion 2 (SNMPv2)
`564
`SNMP Management
`566
`SNMPSecurity
`566
`567
`SNMPInteroperability
`SNMPReference: SNMPv1 Message Formats
`SNMPReference: SNMPv2 Message Format
`
`560
`
`568
`570
`
`Internetworking Terms and Acronyms
`
`575
`
`Index
`
`665
`
`
`
`14
`
`14
`
`
`
`
`
`32 Internetworking Technologies Handbook
`
`over the contents of the packet and then comparesits computed value with that
`contained in the packet. If the values are equal, the packet is considered valid.
`If the values are unequal, the packet containserrors andis discarded.
`
`MULTIPLEXING BASICS
`
`Multiplexing is a process in which multiple data channels are combinedinto a
`single data or physical channelat the source. Multiplexing can be implemented
`at any of the OSI layers. Conversely, demultiplexing is the process of separating
`multiplexed data channels at the destination. One example of multiplexing is
`when data from multiple applications is multiplexed into a single lower-layer
`data packet. Figure 1-18 illustrates this example.
`
`Word
`Figure 1-18
`Multiple Spreadsheet=Processing
`
`applications can be
`multiplexed into a
`single lower-layer User Applications
`
`§=———>
`
`data packet. ApplicationData —_
`]
`Lower-Layer Header ———> a. LEED }
`
`Source
`
`Another example of multiplexing is when data from multiple devices is com-
`bined into a single physical channel (using a device called a multiplexer).
`Figure 1-19 illustrates this example.
`
`
`
`
`
`
`
`15
`
`15
`
`
`
`Chapter1
`
`°
`
`Internetworking Basics
`
`Data
`Channels
`
` Multiplexer
`
`Data
`Channels
`
`Cy A
`Physical
`Channel
`—— CS.
`a a
`Multiplexer
`=e# Cc
`
`33
`
`Figure 1-19
`Multiple devices
`can be multiplexed
`into a single
`physical channel.
`
`A multiplexer is a physical-layer device that combines multiple data streams
`snto one or more output channels at the source. Multiplexers demultiplex the
`channels into multiple data streams at the remote end and thus maximizethe
`use of the bandwidth ofthe physical medium by enablingit to be shared by mul-
`tiple traffic sources.
`Some methods used for multiplexing data are time-division multiplexing
`(TDM), asynchronoustime-division multiplexing (ATDM),frequency-division
`multiplexing (FDM), andstatistical multiplexing.
`In TDM,information from each data channelis allocated bandwidth based on
`preassigned time slots, regardless of whether there is data to transmit. In
`ATDM,information from data channels is allocated bandwidth as needed, by
`using dynamically assigned time slots. In FDM, information from each data
`channelis allocated bandwidth based on the signal frequency of the traffic. In
`statistical multiplexing, bandwidth is dynamically allocated to any data chan-
`nels that have information to transmit.
`
`
`
`16
`
`16
`
`
`
`Chapter 28
`
`¢
`
`Internet Protocols
`
`381
`
`IRDPoffers several advantages over other methods of discovering addressesof
`neighboring routers. Primarily, it does not require hosts to recognize routing
`protocols, nor does it require manual configuration by an administrator.
`Router-Advertisement messages enable hosts to discover the existence of neigh-
`boring routers but not which router is best to reach a particular destination.If
`a host uses a poorfirst-hop router to reacha particular destination,it receives
`a Redirect messageidentifying a better choice.
`
`TRANSMISSION-CONTROL PROTOCOL (TCP)
`
`The TCP provides reliable transmission of data in an IP environment. TCP cor-
`responds to the transport layer (Layer 4) of the OSI reference model. Among
`the services TCP provides are stream data transfer,reliability, efficient flow con-
`trol, full-duplex operation, and multiplexing.
`
`With stream data transfer, TCP delivers an unstructured stream of bytes identi-
`fied by sequence numbers. Thisservice benefits applications because they do not
`have to chop datainto blocks before handing it off to TCP. Instead, TCP groups
`bytes into segments and passes them toIP for delivery.
`
`TCP offers reliability by providing connection-oriented, end-to-end reliable
`packet delivery through an internetwork.It does this by sequencing bytes with
`a forwarding acknowledgment number that indicates to the destination the
`next byte the source expects to receive. Bytes not acknowledged within a spec-
`ified time period are retransmitted. The reliability mechanism of TCP allows
`devices to deal with lost, delayed, duplicate, or misread packets. A time-out
`mechanism allows devices to detect lost packets and request retransmission.
`
`TCPoffers efficient flow control, which meansthat, when sending acknowledg-
`ments back to the source, the receiving TCP process indicates the highest
`sequence numberit can receive without overflowingits internal buffers.
`
`Full-duplex operation means that TCP processes can both send andreceive at
`the same time.
`
`
`
`17
`
`17
`
`
`
`Internetworking Technologies Handbook
`382
`SEEeee
`
`Finally, TCP’s multiplexing means that numerous simultaneous upper-laye;
`conversations can be multiplexed over a single connection.
`
`TCP Connection Establishment
`
`To use reliable transport services, TCP hosts must establish a connection-oyj-
`ented session with one another. Connection establishment is performed by
`using a “three-way handshake” mechanism.
`
`A three-way handshake synchronizes both ends of a connection by allowing
`both sides to agree upon initial sequence numbers. This mechanism also guar.
`antees that both sides are ready to transmit data and know thatthe otherside
`is ready to transmit as well. This is necessary so that packets are not transmitted
`or retransmitted during session establishment or after session termination.
`
`Each host randomly chooses a sequence numberusedto track bytes within the
`stream it is sending and receiving. Then, the three-way handshakeproceedsin
`the following manner:
`
`Thefirst host (Host A)initiates a connection by sending a packetwith theinitial
`sequence number(X) and SYNbitset to indicate a connection request. Thesec-
`ond host (Host B) receives the SYN, records the sequence number X,andreplies
`by acknowledging the SYN (with an ACK = X + 1). Host B includes its own
`initial sequence number (SEQ = Y). An ACK = 20 meansthe hosthas received
`bytes 0 through 19 and expects byte 20 next. This techniqueis called forward
`acknowledgment. Host A then acknowledges all bytes Host B sent with a for
`ward acknowledgmentindicating the next byte Host A expects to receive (ACK
`=Y+1).
`
`Data transfer then can begin.
`
`Positive Acknowledgmentand Retransmission (PAR)
`.
`.
`.
`2.
`aes
`|
`A simple transport protocol might implement a reliability-and-flow-contt
`,
`<
`‘
`n
`technique where the source sends one packet, starts a timer, and waits for a
`‘5
`not
`acknowledgment before sending a new packet. If the acknowledgment1s
`
`18
`
`18
`
`
`
`Chapter 28
`
`¢
`
`Internet Protocols
`
`|
`
`383
`
`received before the timer expires, the source retransmits the packet. Such a tech-
`nique is called positive acknowledgment and retransmission.
`
`By assigning each packet a sequence number, PAR enables hosts to track lost or
`duplicate packets caused by networkdelays that result in premature retransmis-
`sion. The sequence numbersare sent back in the acknowledgmentsso thatthe
`acknowledgmentscan betracked.
`
`PARis aninefficient use of bandwidth, however, because a host must wait for
`an acknowledgment before sending a new packet, and only one packet can be
`sent at a time.
`
`TCP Sliding Window
`
`A TCPsliding window provides moreefficient use of network bandwidth than
`PAR becauseit enables hosts to send multiple bytes or packets before waiting
`for an acknowledgment.
`
`In TCP, the receiver specifies the current windowsize in every packet. Because
`TCP provides a byte-stream connection, windowsizes are expressed in bytes.
`This means that a windowis the numberofdata bytes that the senderis allowed
`to send before waiting for an acknowledgment.Initial window sizes are indi-
`cated at connection setup but might vary throughoutthe data transfer to pro-
`vide flow control. A windowsize of zero, for instance, means “Send no data.”
`
`In a TCP sliding-window operation, for example, the sender might have a
`sequence of bytes to send (numbered 1 to 10) to a receiver who has a window
`size of five. The sender then would place a window aroundthefirst five bytes
`and transmit them together. It would then wait for an acknowledgment.
`
`The receiver would respond with an ACK = 6,indicating that it has received
`bytes 1 to 5 andis expecting byte 6 next. In the same packet, the receiver would
`indicate that its window size is 5. The sender then would movethesliding win-
`dow five bytes to the right and transmit bytes 6 to 10. The receiver would
`respond with an ACK = 11, indicating that it is expecting sequenced byte 11
`next. In this packet, the receiver might indicate that its window size is 0
`
`19
`
`19
`
`
`
`Internetworking Technologies Handbook
`384
`
`
`——_——_|.rrr,secogiesTandbook
`
`(because, for example,its internal buffers are full). At this point, the sender can-
`not send any morebytesuntil the receiver sends another packet with a window
`size greater than 0.
`
`TCP Packet Format
`
`Figure 28-10 illustrates the fields and overall format of a TCP packet.
`
`|
`
`Figure 28-10
`Twelvefields
`
`comprise a TCP
`
`packet.
`
`
`32 bits
`
`
`
`Source Port
`
`i
`
`Destination Port
`
`
`
`
`
`
`
`oo Sequence Number
`
`
`
`
`
` Data Offset
`
`
`Acknowledgement Number
`
`
`Window
`
`
`
`Checksum
`
`
`Urgent Pointer
`
`Options (+ Padding)
`
`
`Data (Variable)
`
`
`
`
`
`TCP Packet Field Descriptions
`The following descriptions summarize the TCP packetfieldsillustrated in Fi -
`ure 28-10:
`
`¢ Source Port and Destination Port — Identify points at which up-
`per-layer source anddestination processes receive TCP services.
`
`20
`
`20
`
`
`
`Chapter 28
`
`¢
`
`Internet Protocols
`
`385
`
`° Sequence Number — Usually specifies the numberassignedto thefirst
`byte of data in the current message. In the connection-establishment
`phase, this field also can be used toidentify an initial sequence number
`to be used in an upcoming transmission.
`
`© Acknowledgment Number — Contains the sequence number of the
`next byte of data the sender of the packet expects to receive.
`
`¢ Data Offset — Indicates the number of 32-bit words in the TCP header.
`
`e Reserved — Remainsreserved for future use.
`
`e Flags — Carries a variety of control information, including the SYN
`and ACKbits used for connection establishment, and the FIN bit used
`for connection termination.
`
`¢ Window — Specifies the size of the sender’s receive window (thatis, the
`buffer space available for incoming data).
`
`® Checksum — Indicates whether the header was damagedintransit.
`
`¢ Urgent Pointer — Pointsto thefirst urgent data byte in the packet.
`
`* Options — Specifies various TCP options.
`
`¢ Data — Contains upper-layer information.
`
`UsER DATAGRAM PROTOCOL (UDP)
`
`The User Datagram Protocol (UDP) is a connectionless transport-layer protocol
`(Layer 4) that belongs to the Internet protocol family. UDPis basically aninter-
`face between IP and upper-layer processes. UDP protocolports distinguish mul-
`tiple applications running onasingle device from one another.
`
`Unlike the TCP, UDP adds noreliability, flow-control, or error-recovery func-
`tions to IP. Because of UDP’s simplicity, UDP headers contain fewer bytes and
`consumeless network overhead than TCP.
`
`
`
`21
`
`21
`
`