Information Elements IE THE SIGNALING PROTOCOL Q.2931
6.1.1 The IP Header
An IP datagram consists of a header and a payload. The IP header is shown in Figure 6.1, and it consists of a 20-byte fixed part and an optional part which has a variable length. The following fields are defined in the IP header: • Version : A 4-bit field used to indicate which version of the protocol is used. • Internet Header Length IHL : This is a 4-bit field that gives the length of the header in 32-bit words. The minimum header length is five 32-bit words or 20 bytes. • Type of service : This is an 8-bit field that indicates whether the sender prefers for the datagram to travel over a route with minimal delay, or a route with maximal throughput. • Total length : A 16-bit field used to indicate the length of the entire datagram i.e., header and payload. The default value for the maximum length is 65,535 bytes. • Identification : A 16-bit field used by the receiver to identify the datagram that the fragment belongs to. All fragments of a datagram have the same value in the identifi- cation field. • Flags : This is a 3-bit field, but only two bits – more fragments and don’t fragment – are used. All fragments, except the last one, have the more fragments bit set. This infor- mation permits the receiver to know when all of the fragments have arrived. The don’t fragment bit is used to disallow fragmentation. Version IHL Type of Service Total length Identification Flags Fragment offset Time to live Protocol Header checksum Source address Destination address Options and padding Fixed 20 bytes variable Figure 6.1 The IPv4 header. THE INTERNET PROTOCOL IP: A PRIMER 133 • Fragment offset : This 13-bit field contains an offset that points to where this fragment belongs to in the original datagram. • Time to live : This is an 8-bit field that specifies in seconds how long a datagram is allowed to live in the network. The maximum lifetime is 255 sec. Every router that processes the datagram must decrease this field by one second, and by several seconds if the datagram is queued in the router for a long time. This field can be seen as being similar to a hop count. When the time to live field becomes equal to 0, the datagram is discarded. This prevents a datagram from moving around in the network forever. • Protocol : This field is 8 bits long; it specifies the next higher level protocol e.g. TCP and UDP to which the datagram should be delivered. • Header checksum : A 16-bit field used to verify whether the IP header has been correctly received. The transmitting host adds up all of the 16-bit half-words of the header using 1’s compliment arithmetic, assuming that the checksum field is 0. The 1’s compliment of the final result is then computed and placed in the checksum field. The receiving host calculates the checksum, and if the final result is 0, then the header has been correctly received. Otherwise, the header is erroneous and the datagram is dropped. The checksum is recomputed at each router along the path of the datagram, since at least one field of the header the time to live field is changed. • Source address : A 32-bit field populated with the network and host number of the sending host. • Destination address : A 32-bit field populated with the network and host number of the destination host. The IP addressing scheme is discussed below. • Options : A variable-length field used to encode the options requested by the user e.g. security, source routing, route recording, and time stamping. • Padding : A variable-length field used to make the header of the datagram an integral multiple of 32-bit words.6.1.2 IP Addresses
As we saw above, IP addresses are 32 bits long. An IP address is divided into two parts: a network and a suffix. The network identifies the physical network that the host computer is attached to. The suffix identifies the host computer itself. The size of these two fields vary according to the class of the IP address. Specifically, five different classes of addresses – A, B, C, D, and E – have been defined see Figure 6.2. Network Suffix Suffix Suffix Network Network Multicast address Reserved for future use 1 0 1 1 0 1 1 1 0 1 1 1 1 0 A B C D E Figure 6.2 The IP address classes.Parts
» COMMUNICATION NETWORKS Connection Oriented Network
» An ATM Connection EXAMPLES OF CONNECTIONS
» An MPLS Connection EXAMPLES OF CONNECTIONS
» A Telephone Connection EXAMPLES OF CONNECTIONS
» A Wavelength Routing Optical Network Connection
» The American National Standards Institute ANSI
» The Institute of Electrical and Electronics Engineering IEEE
» The Internet Engineering Task Force IETF
» The ATM Forum STANDARDS COMMITTEES
» The MPLS and Frame Relay Alliance The Optical Internetworking Forum OIF
» The DSL Forum STANDARDS COMMITTEES
» The Section, Line, and Path Overheads
» The STS-1 Section, Line, and Path Overheads
» THE SONET STS-3 FRAME STRUCTURE
» SONETSDH DEVICES Connection Oriented Network
» Two-fiber Unidirectional Path Switched Ring 2F-UPSR
» Two-fiber Bidirectional Line Switched Ring 2F-BLSR
» Four-fiber Bidirectional Line Switched Ring 4F-BLSR
» GFP Client-independent Functions THE GENERIC FRAMING PROCEDURE GFP
» GFP Client-dependent Functions THE GENERIC FRAMING PROCEDURE GFP
» Virtual Concatenation DATA OVER SONETSDH DOS
» Link Capacity Adjustment Scheme LCAS
» INTRODUCTION Connection Oriented Network
» THE STRUCTURE OF THE HEADER OF THE ATM CELL
» The Transmission Convergence TC Sublayer
» The Physical Medium-Dependent PMD Sublayer
» THE ATM LAYER Connection Oriented Network
» Scheduling Algorithms THE ATM SWITCH ARCHITECTURE
» ATM Adaptation Layer 1 AAL 1
» ATM Adaptation Layer 2 AAL 2
» ATM Adaptation Layer 5 AAL 5
» ATMARP CLASSICAL IP AND ARP OVER ATM
» Types of Parameters TRAFFIC CHARACTERIZATION
» Standardized Traffic Descriptors
» Empirical Models TRAFFIC CHARACTERIZATION
» Probabilistic Models TRAFFIC CHARACTERIZATION
» QUALITY OF SERVICE QOS PARAMETERS
» The CBR Service ATM SERVICE CATEGORIES
» The RT-VBR Service ATM SERVICE CATEGORIES
» The NRT-VBR Service ATM SERVICE CATEGORIES
» The UBR Service ATM SERVICE CATEGORIES
» The ABR Service ATM SERVICE CATEGORIES
» The GFR Service ATM SERVICE CATEGORIES
» CONGESTION CONTROL Connection Oriented Network
» PREVENTIVE CONGESTION CONTROL Connection Oriented Network
» Equivalent Bandwidth CALL ADMISSION CONTROL CAC
» The ATM Block Transfer ABT Scheme
» Virtual Path Connections CALL ADMISSION CONTROL CAC
» The Generic Cell Rate Algorithm GCRA
» Packet Discard Schemes BANDWIDTH ENFORCEMENT
» The Available Bit Rate ABR Service
» THE SIGNALING PROTOCOL STACK
» The SSCOP THE SIGNALING ATM ADAPTATION LAYER SAAL
» Primitives THE SIGNALING ATM ADAPTATION LAYER SAAL
» THE SIGNALING CHANNEL Connection Oriented Network
» ATM ADDRESSING Connection Oriented Network
» THE FORMAT OF THE SIGNALING MESSAGE
» Information Elements IE THE SIGNALING PROTOCOL Q.2931
» Q.2931 Messages THE SIGNALING PROTOCOL Q.2931
» The IP Header THE INTERNET PROTOCOL IP: A PRIMER
» IP Addresses THE INTERNET PROTOCOL IP: A PRIMER
» Label Allocation Schemes THE MULTI-PROTOCOL LABEL SWITCHING MPLS ARCHITECTURE
» The Next Hop Label Forwarding Entry NHLFE
» Explicit Routing THE MULTI-PROTOCOL LABEL SWITCHING MPLS ARCHITECTURE
» An Example of the Use of the Label Stack
» Schemes for Setting up an LSP
» Hybrid ATM Switches MPLS OVER ATM
» Label Spaces, LDP Sessions, and Hello Adjacencies
» The LDP Messages THE LABEL DISTRIBUTION PROTOCOL LDP
» CR-LSP Setup Procedure THE CONSTRAINED-BASED ROUTING LABEL DISTRIBUTION
» The Label Mapping Message The Traffic Parameters TLV
» Classes of Service THE CONSTRAINED-BASED ROUTING LABEL DISTRIBUTION
» Reservation Styles THE RESOURCE RESERVATION PROTOCOL RSVP
» Soft State THE RESOURCE RESERVATION PROTOCOL RSVP
» The Path Message THE RESOURCE RESERVATION PROTOCOL RSVP
» The Resv Message THE RESOURCE RESERVATION PROTOCOL RSVP
» Service Classes and Reservation Styles
» The RSVP-TE Path and Resv Messages
» RSVP-TE Extensions THE RESOURCE RESERVATION PROTOCOL – TRAFFIC
» WDM OPTICAL NETWORKS Connection Oriented Network
» Multi-mode and Single-mode Optical Fibers
» Impairments HOW LIGHT IS TRANSMITTED THROUGH AN OPTICAL FIBER
» Photo-detectors and Optical Receivers
» Optical Amplifiers COMPONENTS
» Optical Cross-connects OXCs COMPONENTS
» Lightpaths WAVELENGTH ROUTING NETWORKS
» Traffic Grooming WAVELENGTH ROUTING NETWORKS
» Point-to-point Links WDM Optical Rings
» Mesh Optical Networks PROTECTION SCHEMES
» The Optical Channel Och Frame
» Overhead Types THE ITU-T G.709 STANDARD – THE DIGITAL WRAPPER
» CONTROL PLANE ARCHITECTURES Connection Oriented Network
» RSVP-TE Extensions For GMPLS
» LDP Extensions for UNI Signaling
» RSVP Extensions For UNI Signaling
» A Space Switch OPTICAL PACKET SWITCHING
» Reservation and Release of Resources in an OXC
» Scheduling of Bursts at an OBS Node
» Lost Bursts OPTICAL BURST SWITCHING OBS
» Signaling Messages THE JUMPSTART PROJECT
» The Signaling Message Structure
» Addressing THE JUMPSTART PROJECT
» The Routing Architecture THE JUMPSTART PROJECT
» The Discrete Multi-tone DMT Technique
» Bearer Channels THE ADSL-BASED ACCESS NETWORKS
» The ADSL Super Frame Schemes for Accessing Network Service Providers
» The ADSL2 and ADSL2+ Standards
» The Physical Layer THE CABLE-BASED ACCESS NETWORK
» The DOCSIS MAC Protocol Operation
» Frame Structures for Downstream and Upstream Transmission
» The PLOAM Cell THE ATM PASSIVE OPTICAL NETWORK
» The Divided-slots Cell THE ATM PASSIVE OPTICAL NETWORK
» Churning THE ATM PASSIVE OPTICAL NETWORK
» Ranging THE ATM PASSIVE OPTICAL NETWORK
» Channel-Associated Signaling CAS BACKGROUND
» Narrowband ISDN N-ISDN BACKGROUND
» Digital Subscriber Signaling System No. 1 DSS1
» VOICE OVER ATM SPECIFICATIONS
» Structured DS1E1J2 N × 64 Kbps Service DS1E1J2 Unstructured Service
» Switched and Non-Switched Trunking
» IWF Functionality for Switched Trunking
» IWF Functionality for Non-switched Trunking
» User Functions THE AAL 2 SERVICE-SPECIFIC CONVERGENCE SUBLAYER SSCS
» The Service-Specific Convergence Sublayer
» SSSAR THE SEGMENTATION AND REASSEMBLY SSCS FOR AAL 2
» SSTED THE SEGMENTATION AND REASSEMBLY SSCS FOR AAL 2
» SSADT THE SEGMENTATION AND REASSEMBLY SSCS FOR AAL 2
Show more