Home / Catalog / High Speed Networks
  
High Speed Networks  
Published by Vijay Nicole Imprints Private Limited
Publication Date:  Available in all formats
ISBN: 9789394524491

PAPERBACK

EBOOK (EPUB)

EBOOK (PDF)

ISBN: 9788182093461 Price: INR 395.00
Add to cart Buy Now

Description

Table of contents

Biographical note

This book High Speed Networks is designed as per the latest Anna University syllabus and covers the syllabi for students pursuing their BE in the Electronics and Communication Engineering and Computer Science and Engineering disciplines. A pre-requisite for any student, this book provides simple and neat presentation of concepts coupled with diagrams.

Rating
Description

This book High Speed Networks is designed as per the latest Anna University syllabus and covers the syllabi for students pursuing their BE in the Electronics and Communication Engineering and Computer Science and Engineering disciplines. A pre-requisite for any student, this book provides simple and neat presentation of concepts coupled with diagrams.

Table of contents
  • Title Page
  • Copyright Page
  • Dedication
  • Syllabus
  • Table of Contents
  • Preface
  • Acknowledgements
  • List of Abbreviations
  • UNIT– I INTRODUCTION TO HIGH SPEED NETWORKS
    • 1.1 Introduction
      • 1.1.1 Packet-Switching Networks
        • 1.1.1.1 Message Transmission Approaches
      • 1.1.2 Circuit-Switching Networks
      • 1.1.3 X.25
        • 1.1.3.1 Features of X.25
    • 1.2 Frame Relay Networks
      • 1.2.1 Frame Relay Architecture Compared with X.25
      • 1.2.2 User Data Transfer
      • 1.2.3 Frame Relay Call Control
    • 1.3 Asynchronous Transfer Mode
      • 1.3.1 ATM Protocol Architecture
      • 1.3.2 ATM Logical Connection
        • 1.3.2.1 Virtual Channel Connection Uses
        • 1.3.2.2 Characteristics of VCC
        • 1.3.2.3 Characteristics of VPC
        • 1.3.2.4 Reasons for Duplication of Characteristics in VPC
        • 1.3.2.5 Control Signaling
          • 1.3.2.5.1 Methods for Providing an Establishment/Release for VCC
          • 1.3.2.5.2 Methods for Providing an Establishment/Release for VPC
      • 1.3.3 ATM Cell
        • 1.3.3.1 Header Format
        • 1.3.3.2 UNI and NNI Interface
        • 1.3.3.3 Generic Flow Control
        • 1.3.3.4 Header Error Control
      • 1.3.4 ATM Service Categories
        • 1.3.4.1 Real-Time Services
          • 1.3.4.1.1 Constant Bit Rate
          • 1.3.4.1.2 Real-Time Variable Bit Rate
        • 1.3.4.2 Non-Real-Time Services
          • 1.3.4.2.1 Non-Real-Time Variable Bit Rate
          • 1.3.4.2.2 Available Bit Rate
          • 1.3.4.2.3 Unspecified Bit Rate
          • 1.3.4.2.4 Guaranteed Frame Rate (GFR)
      • 1.3.5 AAL
        • 1.3.5.1 AAL Services
        • 1.3.5.2 AAL Protocols
          • 1.3.5.2.1 AAL Type 1
          • 1.3.5.2.2 AAL Type 2
          • 1.3.5.2.3 AAL Type 3/4
          • 1.3.5.2.4 AAL Type 5
    • 1.4 High Speed LANs
      • 1.4.1 Fast Ethernet
        • 1.4.1.1 100BASE-X
        • 1.4.1.2 100BASE-T4
      • 1.4.2 Gigabit Ethernet
        • 1.4.2.1 Gbps Ethernet
    • 1.5 Fiber Channel
      • 1.5.1 Fiber Channel Elements
      • 1.5.2 Fiber Channel Protocol Architecture
      • 1.5.3 Fiber Channel Physical Media and Topologies
        • 1.5.3.1 Transmission Media
        • 1.5.3.2 Topologies
      • 1.5.4 Fiber Channel Prospects
    • 1.6 Wireless LANs
      • 1.6.1 Wireless LAN Applications
      • 1.6.2 Wireless LAN Requirements
    • 1.7 Architecture of IEEE 802.11
      • 1.7.1 IEEE 802.11 Services
      • 1.7.2 IEEE 802.11 Protocol Layers
      • 1.7.3 IEEE 802.11 Physical Layer
    • Review Questions
  • UNIT– II CONGESTION AND TRAFFIC MANAGEMENT
    • 2.0 Introduction
    • 2.1 Queuing Analysis
      • 2.1.1 Queue Behaviour
      • 2.1.2 Queuing Performance
    • 2.2 Queuing Models
      • 2.2.1 Single-Server Queues
        • 2.2.1.1 Queue Parameters
        • 2.2.1.2 Model Characteristics
      • 2.2.2 Multi-Server Queues
        • 2.2.2.1 Model Characteristics
      • 2.2.3 Basic Queuing Relationships
      • 2.2.4 Single-Server Queue Formulas
      • 2.2.5 Multi-Server Queue Formulas
    • 2.3 Effects of Congestion
      • 2.3.1 Ideal Performance
      • 2.3.2 Practical Performance
    • 2.4 Congestion Control
      • 2.4.1 Backpressure
      • 2.4.2 Choke Packet
      • 2.4.3 Implicit Congestion Signaling
      • 2.4.4 Explicit Congestion Signaling
    • 2.5 Traffic Management
      • 2.5.1 Fairness
      • 2.5.2 Quality of Service
      • 2.5.3 Reservations
    • 2.6 Congestion Control in Packet Switching Networks
    • 2.7 Frame Relay Congestion Control
      • 2.7.1 Objectives of Frame Relay
      • 2.7.2 Frame Relay Congestion Control Techniques
      • 2.7.3 Traffic Rate Management
      • 2.7.4 Congestion Avoidance with Explicit Signaling
    • Review Questions
  • UNIT– III TCP AND ATM CONGESTION CONTROL
    • 3.0 Introduction
    • 3.1 TCP Flow Control
      • 3.1.1 Effect of Window Size on Performance
      • 3.1.2 Retransmission Strategy
      • 3.1.3 Adaptive Retransmission Timer
      • 3.1.4 TCP Implementation Policy
        • 3.1.4.1 Send Policy
        • 3.1.4.2 Deliver Policy
        • 3.1.4.3 Accept Policy
        • 3.1.4.4 Retransmit Policy
        • 3.1.4.5 Acknowledge Policy
    • 3.2 TCP Congestion Control
      • 3.2.1 TCP Flow and Congestion Control
    • 3.3 Retransmission and Timer Management
      • 3.3.1 RTT Variance Estimation (Jacobson’s Algorithm)
      • 3.3.2 Exponential RTO Backoff
      • 3.3.3 KARN’s Algorithm
    • 3.4 Window Management
      • 3.4.1 Slow Start
      • 3.4.2 Dynamic Window Sizing on Congestion
      • 3.4.3 Fast Retransmit
      • 3.4.4 Fast Recovery
      • 3.4.5 Limited Transmit
        • 3.4.5.1 Adaptive Retransmission Timer
        • 3.4.5.2 Fast Retransmit Timer
    • 3.5 Performance of TCP over ATM
      • 3.5.1 Protocol Architecture
      • 3.5.2 TCP over UBR
        • 3.5.2.1 Plain UBR
    • 3.5.3 TCP over ABR
    • 3.6 Traffic and Congestion Control in ATM Networks
      • 3.6.1 Requirements for ATM Traffic and Congestion Control
        • 3.6.1.1 Latency/ Speed Effects
        • 3.6.1.2 Cell Delay Variation
          • 3.6.1.2.1 Network Contribution to Cell Delay Variation
          • 3.6.1.2.2 Cell Delay Variation at the UNI
    • 3.7 ATM Traffic-Related Attributes
      • 3.7.1 Traffic Parameters
        • 3.7.1.1 Source Traffic Descriptors
        • 3.7.1.2 Connection Traffic Descriptor
      • 3.7.2 QoS Parameters
      • 3.7.3 Congestion Control Attributes
      • 3.7.4 Other Attributes
    • 3.8 Traffic Management Framework
    • 3.9 Traffic Control
      • 3.9.1 Resource Management Using Virtual Paths
      • 3.9.2 Connection Admission Control
      • 3.9.3 Usage Parameter Control
        • 3.9.3.1 Location of UPC Connection
        • 3.9.3.2 Peak Cell Rate Algorithm
        • 3.9.3.3 Sustainable Cell Rate Algorithm
        • 3.9.3.4 UPC Actions
      • 3.9.4 Selective Cell Discard
      • 3.9.5 Traffic Shaping
      • 3.9.6 Explicit Forward Congestion Indication
    • 3.10 ABR Traffic Management
      • 3.10.1 ABR Rate Control
        • 3.10.1.1 Feedback Mechanism
        • 3.10.1.2 Cell Flow
      • 3.10.2 RM Cell Formats
      • 3.10.3 ABR Capacity Allocations
        • 3.10.3.1 Binary Feedback Schemes
        • 3.10.3.2 Explicit Rate Feedback Schemes
    • 3.11 GFR Traffic Management
      • 3.11.1 Rate Guarantee Mechanism
      • 3.11.2 GFR Conformance Definition
      • 3.11.3 QoS Eligibility Test Mechanism
    • Review Questions
  • UNIT– IV INTEGRATED AND DIFFERENTIATED SERVICES
    • 4.1 Introduction
    • 4.2 Integrated Services Architecture
      • 4.2.1 Internet Traffic
        • 4.2.1.1 Elastic Traffic
        • 4.2.1.2 Inelastic Traffic
      • 4.2.2 ISA Approach
      • 4.2.3 ISA Components
      • 4.2.4 ISA Services
        • 4.2.4.1 Token Bucket Traffic Specification
        • 4.2.4.2 Guaranteed service
        • 4.2.4.3 Controlled Load
    • 4.3 Queuing Discipline
      • 4.3.1 First-In First-Out (FIFO)
      • 4.3.2 Fair Queuing (FQ)
      • 4.3.3 Processor Sharing (PS)
      • 4.3.4 Bit-Round Fair Queuing (BRFQ)
      • 4.3.5 Generalized Processor Sharing (GPS)
      • 4.3.6 Weighted Fair Queuing (WFQ)
    • 4.4 Random Early Deduction (RED)
      • 4.4.1 Need of RED Algorithm
      • 4.4.2 Objectives of RED Algorithm
      • 4.4.3 RED Algorithm
      • 4.4.4 Average Queue Size Calculation
      • 4.4.5 Packet Discarding
    • 4.5 Differentiated Services
      • 4.5.1 DS Services
      • 4.5.2 DS Field
      • 4.5.3 DS Configuration
      • 4.5.4 Traffic Conditioning Elements
      • 4.5.5 Per-Hop Behavior (PHB)
        • 4.5.5.1 Expected Forwarding PHB
        • 4.5.5.2 Assured Forwarding PHB
    • Review Questions
  • UNIT– V PROTOCOLS FOR QoS SUPPORT
    • 5.0 Introduction
    • 5.1 Resource Reservation Protocol (RSVP)
      • 5.1.1 RSVP Goals and Characteristics
      • 5.1.2 Data Flow
        • 5.1.2.1 Session
        • 5.1.2.2 Flow Specification
        • 5.1.2.3 Filter Specification
      • 5.1.3 RSVP Operations
        • 5.1.3.1 Filtering
        • 5.1.3.2 Reservation Styles
      • 5.1.4 RSVP Protocol Mechanisms
        • 5.1.4.1 RESV messages
        • 5.1.4.2 Path message
    • 5.2 MultiProtocol Label Switching (MLS)
      • 5.2.1 MPLS Capabilities
        • 5.2.1.1 Connection-Oriented QoS Support
        • 5.2.1.2 Traffic Engineering
        • 5.2.1.3 Virtual Private Network (VPN) Support
        • 5.2.1.4 Multiprotocol Support
      • 5.2.2 MPLS Operations
      • 5.2.3 Label Stacking
      • 5.2.4 Label Format and Placement
        • 5.2.4.1 Time To Live Processing
        • 5.2.4.2 Label Stack
      • 5.2.5 FECs, LSPs and Labels
        • 5.2.5.1 Route Selection
        • 5.2.5.2 Constraint-Based Routing Algorithm
        • 5.2.5.3 Label Distribution
    • 5.3 Real-Time Transport Protocol (RTP)
      • 5.3.1 RTP Architecture
        • 5.3.1.1 Application-Level Framing
        • 5.3.1.2 Integrated Layer Processing
      • 5.3.2 RTP Data Transfer Protocol
        • 5.3.2.1 RTP Header
      • 5.3.3 RTP Control Protocol (RTCP)
        • 5.3.3.1 Sender Report (SR)
        • 5.3.3.2 Receiver Report (RR)
        • 5.3.3.3 Source Description (SDES)
        • 5.3.3.4 Goodbye (BYE)
        • 5.3.3.5 Application Specific
    • Review Questions
  • University Solved Question Papers
    • Nov/Dec 2007
    • Apr/ May 2008
    • Nov/Dec 2008
    • May/June 2009
    • Nov/Dec 2009
    • Apr/ May 2010
    • Apr/ May 2011
    • Nov/Dec 2011
    • Nov/Dec 2012
    • Nov/Dec 2013
    • May/June 2014
  • Glossary
  • Index
Biographical note

Dr. Jose Anand is Associate Professor, Department of Electronics and Communication, KCG College of Technology, Chennai. He obtained his Bachelors in Engineering from Institution of Engineers (India), Masters in Embedded Systems from Anna University, MBA from Alagappa University, and completed his Doctrate from Anna University.

User Reviews
Rating