Ramdan Hours:
Sun - Thu
9.30 AM - 2.30 PM
Iftar in --:--:--
🌙 Maghrib: --:--
Image from Google Jackets

Data communications and networks : an engineering approach / James Irvine and David Harle

By: Contributor(s): Material type: TextTextPublisher: New Delhi : Wiley, 2012Description: xx, 268 pages : illustrations ; 25 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9788126507658
Subject(s): DDC classification:
  • 004.6 22 I.J.D
Contents:
1 Communication Systems 1 -- 1.2 Partitioning Communication Systems 1 -- 1.3 Layered Communication Architectures 3 -- 1.3.1 Need for Standards 4 -- 1.3.2 Internet Reference Model 5 -- 1.3.3 OSI Reference Model 5 -- 2 User Perspective 13 -- 2.1 User Data 13 -- 2.2 Introduction to Information Theory 13 -- 2.2.1 Information Content 13 -- 2.2.2 Mutual Information 15 -- 2.3 Information Sources 16 -- 2.4 Coding 16 -- 2.4.1 Properties of Codes 16 -- 2.4.2 Minimum Code Lengths 17 -- 2.4.3 Redundancy and Efficiency 17 -- 2.4.4 Types of Coding 18 -- 2.5 Source Coding 18 -- 2.5.1 Quantisation 18 -- 2.5.2 Quantisation Accuracy 19 -- 2.5.3 Sampling Rate 20 -- 2.5.4 Fourier Series 20 -- 2.5.5 Calculation of the Frequency Spectrum 20 -- 2.5.6 Frequency Spectrum 23 -- 2.5.7 Minimum Sampling Rate 23 -- 2.5.8 Pulse Code Modulation (PCM) 24 -- 2.5.9 Source Coding for Memoryless Sources 24 -- 2.5.10 Source Coding for Sources with Memory 26 -- 2.6 Questions on the User Perspective 29 -- 2.6.1 Questions on Information Theory 29 -- 2.6.2 Questions on Memoryless Source Coding 29 -- 2.6.3 Questions on Source Coding for Sources with Memory 30 -- 3 Security Perspective 31 -- 3.2 Types of Cryptography 31 -- 3.2.1 Diffusion 32 -- 3.2.2 Confusion 33 -- 3.3 Cryptographic Scenarios 33 -- 3.4 Private Key Systems 34 -- 3.4.2 Transposition Ciphers 35 -- 3.4.3 Transformation Ciphers 35 -- 3.4.4 One Time Pad 37 -- 3.4.5 Shift Register Encoders 38 -- 3.4.6 Product Ciphers 38 -- 3.4.7 Stream Ciphers 41 -- 3.5 Public Key Cryptosystems 42 -- 3.5.1 Key Distribution Problem 42 -- 3.5.2 One Way Functions 44 -- 3.5.3 Diffie-Hellman Key Exchange 45 -- 3.5.4 RSA (Rivest, Shamir, Adleman) Cryptosystem 46 -- 3.6 Authentication 47 -- 3.6.2 Integrity 47 -- 3.6.3 Authentication 49 -- 3.6.4 Digital Signatures 50 -- 3.7 Other Cryptographic Protocols 50 -- 3.7.1 Tossing a Coin Remotely 50 -- 3.7.2 Oblivious Transfer 51 -- 3.8 Practical Security 52 -- 3.8.1 How Much Security? 52 -- 3.8.2 Trusted Authorities 53 -- 3.8.3 Error Conditions 53 -- 3.8.4 Human Factor 53 -- 3.9 Questions on the Security Perspective 54 -- 4 Network Perspective 55 -- 4.2 Network Configurations 56 -- 4.2.1 Network Topology 58 -- 4.2.2 Connectivity 60 -- 4.3 Network Size 64 -- 4.3.1 Wide Area Networks 64 -- 4.3.2 Metropolitan Area Networks 65 -- 4.3.3 Local Area Networks 65 -- 4.4 Switching Techniques 65 -- 4.4.1 Circuit Switching 66 -- 4.4.2 Packet Switching 66 -- 4.5 Service Definition from a Network Viewpoint 70 -- 4.5.1 Non-performance-oriented Quality Parameters 71 -- 4.5.2 Performance-oriented Quality Parameters 71 -- 4.6 Network Dimensioning 72 -- 4.6.1 Dimensioning in Circuit Switching 72 -- 4.6.2 Dimensioning in Packet-Switched Systems 75 -- 4.7 Link Properties 80 -- 4.8 Internetworking 81 -- 4.8.1 Repeater 81 -- 4.8.2 Bridge 82 -- 4.8.3 Router 82 -- 4.8.4 Higher Level Gateway 83 -- 4.9 Routing 83 -- 4.9.1 Shortest Path 84 -- 4.9.2 Flooding 86 -- 4.9.3 Distributed Routing 87 -- 4.9.4 Broadcast Routing 89 -- 4.10 Congestion 91 -- 4.10.1 Admission Control 91 -- 4.10.2 Load Shedding 91 -- 4.10.3 Flow Control 92 -- 4.11 Error Control 92 -- 4.11.1 Error Detection 93 -- 4.11.2 ARQ 94 -- 4.12 Transport Layer Services 98 -- 4.12.1 Addressing 99 -- 4.12.2 OSI Transport Service Classes 100 -- 4.12.3 Internet Transport Service Classes 101 -- 4.13 Internet Protocol 106 -- 4.13.1 IP Packet Format 106 -- 4.13.2 Addressing 108 -- 4.13.3 Subnets 108 -- 4.13.4 Classless Addressing 110 -- 4.13.5 Domain Name Service 111 -- 4.13.6 IP Routing 113 -- 4.13.7 IPv6 114 -- 4.14 QoS over IP 116 -- 4.14.1 Integrated Services 116 -- 4.14.2 Resource Reservation Protocol 117 -- 4.14.3l Differentiated Services 118 -- 4.14.4 Multi-Protocol Label Switching 119 -- 4.15 Questions on the Network Perspective 120 -- 4.15.1 Questions on Network Configuration 120 -- 4.15.2 Questions on Switching Techniques 121 -- 4.15.3 Questions on Network Dimensioning 121 -- 4.15.4 Questions on Routing 122 -- 4.15.5 Questions on Error Control 122 -- 5 Link Perspective 124 -- 5.1 Data Link Layer 124 -- 5.2 Frame Delimiting 124 -- 5.3 Medium Access Control 125 -- 5.3.1 Contention-Based Schemes 125 -- 5.3.2 Reservation-Based Schemes 128 -- 5.3.3 Comparison of Access Techniques 133 -- 5.4 Channel Coding 133 -- 5.4.1 Probability of Error 136 -- 5.4.2 Constructing Error Correcting Codes 136 -- 5.4.3 Linear Codes 137 -- 5.4.4 Convolutional Codes 141 -- 5.4.5 Interleaving 144 -- 5.4.6 Combining Codes 144 -- 5.5 Comparison between Forward and Feedback Error Correction (ARQ) 147 -- 5.6 Local Area Networks 148 -- 5.6.1 LAN Configuration 149 -- 5.6.2 IEEE 802 LANs 149 -- 5.6.3 Device Addressing 150 -- 5.6.4 IEEE 802.3 (Ethernet) LAN 152 -- 5.6.5 High Speed Ethernet 153 -- 5.6.6 IEEE Token Ring LANs 158 -- 5.6.7 IEEE 802.11 Wireless LAN 159 -- 5.7 Connecting LANs 160 -- 5.7.1 Repeaters 160 -- 5.7.2 Bridges 161 -- 5.8 WAN Protocols 163 -- 5.8.1 SDH/SONET 163 -- 5.8.2 ATM 164 -- 5.9 Transporting IP over WANs 172 -- 5.9.1 Point-to-Point Protocol 172 -- 5.9.2 IP over SDH/SONET 173 -- 5.9.3 IP over ATM 174 -- 5.10 Metropolitan Area Networks 174 -- 5.10.1 Fibre Distributed Data Interface 176 -- 5.10.2 Distributed Queue Dual Bus 179 -- 5.11 Questions on the Link Perspective 182 -- 5.11.1 Questions on Linear Codes 182 -- 5.11.2 Questions on Convolutional Codes 184 -- 5.11.3 Questions on LANs and MANs 185 -- 6 Channel Perspective 186 -- 6.2 Channel Capacity 186 -- 6.2.1 Discrete Memoryless Channel 186 -- 6.2.2 Capacity of a Discrete Memoryless Channel 187 -- 6.2.3 Channel Coding Theorem 188 -- 6.2.4 Analogue Channels--The Channel Capacity Theorem 188 -- 6.3 Transmission Media 189 -- 6.3.1 Wire 189 -- 6.3.2 Optical Fibre 191 -- 6.3.3 Radio 193 -- 6.3.4 Other Media 198 -- 6.4 Line Coding 199 -- 6.4.1 Binary Line Codes 199 -- 6.4.2 Multi-level Codes 202 -- 6.4.3 Scrambling 203 -- 6.4.4 Example Line Code Applications 206 -- 6.5 Modulation 206 -- 6.5.2 Multiple Access 207 -- 6.5.3 Digital Modulation 210 -- 6.6 Application Example: ADSL 220 -- 6.7 Questions on the Channel Perspective 221 -- 6.7.1 Questions on Channel Capacity 221 -- 7 Putting it all together 223 -- 7.2 GSM Mobile Phone System 223 -- 7.2.1 Transmission Media 223 -- 7.2.2 Line Coding and Modulation 223 -- 7.2.3 Medium Access Control 224 -- 7.2.4 Coding 226 -- 7.3 Voice over IP (VoIP) 226 -- 7.3.1 Requirements 227 -- 7.3.2 Error Control 228 -- 7.3.3 Transmission Protocol 228 -- 7.3.4 Architecture 230.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Books Books Main library A1 Computers & Information Technology ( Digital Media Tech. ) 004.6 I.J.D (Browse shelf(Opens below)) Available 00012469

Includes index.

1 Communication Systems 1 --
1.2 Partitioning Communication Systems 1 --
1.3 Layered Communication Architectures 3 --
1.3.1 Need for Standards 4 --
1.3.2 Internet Reference Model 5 --
1.3.3 OSI Reference Model 5 --
2 User Perspective 13 --
2.1 User Data 13 --
2.2 Introduction to Information Theory 13 --
2.2.1 Information Content 13 --
2.2.2 Mutual Information 15 --
2.3 Information Sources 16 --
2.4 Coding 16 --
2.4.1 Properties of Codes 16 --
2.4.2 Minimum Code Lengths 17 --
2.4.3 Redundancy and Efficiency 17 --
2.4.4 Types of Coding 18 --
2.5 Source Coding 18 --
2.5.1 Quantisation 18 --
2.5.2 Quantisation Accuracy 19 --
2.5.3 Sampling Rate 20 --
2.5.4 Fourier Series 20 --
2.5.5 Calculation of the Frequency Spectrum 20 --
2.5.6 Frequency Spectrum 23 --
2.5.7 Minimum Sampling Rate 23 --
2.5.8 Pulse Code Modulation (PCM) 24 --
2.5.9 Source Coding for Memoryless Sources 24 --
2.5.10 Source Coding for Sources with Memory 26 --
2.6 Questions on the User Perspective 29 --
2.6.1 Questions on Information Theory 29 --
2.6.2 Questions on Memoryless Source Coding 29 --
2.6.3 Questions on Source Coding for Sources with Memory 30 --
3 Security Perspective 31 --
3.2 Types of Cryptography 31 --
3.2.1 Diffusion 32 --
3.2.2 Confusion 33 --
3.3 Cryptographic Scenarios 33 --
3.4 Private Key Systems 34 --
3.4.2 Transposition Ciphers 35 --
3.4.3 Transformation Ciphers 35 --
3.4.4 One Time Pad 37 --
3.4.5 Shift Register Encoders 38 --
3.4.6 Product Ciphers 38 --
3.4.7 Stream Ciphers 41 --
3.5 Public Key Cryptosystems 42 --
3.5.1 Key Distribution Problem 42 --
3.5.2 One Way Functions 44 --
3.5.3 Diffie-Hellman Key Exchange 45 --
3.5.4 RSA (Rivest, Shamir, Adleman) Cryptosystem 46 --
3.6 Authentication 47 --
3.6.2 Integrity 47 --
3.6.3 Authentication 49 --
3.6.4 Digital Signatures 50 --
3.7 Other Cryptographic Protocols 50 --
3.7.1 Tossing a Coin Remotely 50 --
3.7.2 Oblivious Transfer 51 --
3.8 Practical Security 52 --
3.8.1 How Much Security? 52 --
3.8.2 Trusted Authorities 53 --
3.8.3 Error Conditions 53 --
3.8.4 Human Factor 53 --
3.9 Questions on the Security Perspective 54 --
4 Network Perspective 55 --
4.2 Network Configurations 56 --
4.2.1 Network Topology 58 --
4.2.2 Connectivity 60 --
4.3 Network Size 64 --
4.3.1 Wide Area Networks 64 --
4.3.2 Metropolitan Area Networks 65 --
4.3.3 Local Area Networks 65 --
4.4 Switching Techniques 65 --
4.4.1 Circuit Switching 66 --
4.4.2 Packet Switching 66 --
4.5 Service Definition from a Network Viewpoint 70 --
4.5.1 Non-performance-oriented Quality Parameters 71 --
4.5.2 Performance-oriented Quality Parameters 71 --
4.6 Network Dimensioning 72 --
4.6.1 Dimensioning in Circuit Switching 72 --
4.6.2 Dimensioning in Packet-Switched Systems 75 --
4.7 Link Properties 80 --
4.8 Internetworking 81 --
4.8.1 Repeater 81 --
4.8.2 Bridge 82 --
4.8.3 Router 82 --
4.8.4 Higher Level Gateway 83 --
4.9 Routing 83 --
4.9.1 Shortest Path 84 --
4.9.2 Flooding 86 --
4.9.3 Distributed Routing 87 --
4.9.4 Broadcast Routing 89 --
4.10 Congestion 91 --
4.10.1 Admission Control 91 --
4.10.2 Load Shedding 91 --
4.10.3 Flow Control 92 --
4.11 Error Control 92 --
4.11.1 Error Detection 93 --
4.11.2 ARQ 94 --
4.12 Transport Layer Services 98 --
4.12.1 Addressing 99 --
4.12.2 OSI Transport Service Classes 100 --
4.12.3 Internet Transport Service Classes 101 --
4.13 Internet Protocol 106 --
4.13.1 IP Packet Format 106 --
4.13.2 Addressing 108 --
4.13.3 Subnets 108 --
4.13.4 Classless Addressing 110 --
4.13.5 Domain Name Service 111 --
4.13.6 IP Routing 113 --
4.13.7 IPv6 114 --
4.14 QoS over IP 116 --
4.14.1 Integrated Services 116 --
4.14.2 Resource Reservation Protocol 117 --
4.14.3l Differentiated Services 118 --
4.14.4 Multi-Protocol Label Switching 119 --
4.15 Questions on the Network Perspective 120 --
4.15.1 Questions on Network Configuration 120 --
4.15.2 Questions on Switching Techniques 121 --
4.15.3 Questions on Network Dimensioning 121 --
4.15.4 Questions on Routing 122 --
4.15.5 Questions on Error Control 122 --
5 Link Perspective 124 --
5.1 Data Link Layer 124 --
5.2 Frame Delimiting 124 --
5.3 Medium Access Control 125 --
5.3.1 Contention-Based Schemes 125 --
5.3.2 Reservation-Based Schemes 128 --
5.3.3 Comparison of Access Techniques 133 --
5.4 Channel Coding 133 --
5.4.1 Probability of Error 136 --
5.4.2 Constructing Error Correcting Codes 136 --
5.4.3 Linear Codes 137 --
5.4.4 Convolutional Codes 141 --
5.4.5 Interleaving 144 --
5.4.6 Combining Codes 144 --
5.5 Comparison between Forward and Feedback Error Correction (ARQ) 147 --
5.6 Local Area Networks 148 --
5.6.1 LAN Configuration 149 --
5.6.2 IEEE 802 LANs 149 --
5.6.3 Device Addressing 150 --
5.6.4 IEEE 802.3 (Ethernet) LAN 152 --
5.6.5 High Speed Ethernet 153 --
5.6.6 IEEE Token Ring LANs 158 --
5.6.7 IEEE 802.11 Wireless LAN 159 --
5.7 Connecting LANs 160 --
5.7.1 Repeaters 160 --
5.7.2 Bridges 161 --
5.8 WAN Protocols 163 --
5.8.1 SDH/SONET 163 --
5.8.2 ATM 164 --
5.9 Transporting IP over WANs 172 --
5.9.1 Point-to-Point Protocol 172 --
5.9.2 IP over SDH/SONET 173 --
5.9.3 IP over ATM 174 --
5.10 Metropolitan Area Networks 174 --
5.10.1 Fibre Distributed Data Interface 176 --
5.10.2 Distributed Queue Dual Bus 179 --
5.11 Questions on the Link Perspective 182 --
5.11.1 Questions on Linear Codes 182 --
5.11.2 Questions on Convolutional Codes 184 --
5.11.3 Questions on LANs and MANs 185 --
6 Channel Perspective 186 --
6.2 Channel Capacity 186 --
6.2.1 Discrete Memoryless Channel 186 --
6.2.2 Capacity of a Discrete Memoryless Channel 187 --
6.2.3 Channel Coding Theorem 188 --
6.2.4 Analogue Channels--The Channel Capacity Theorem 188 --
6.3 Transmission Media 189 --
6.3.1 Wire 189 --
6.3.2 Optical Fibre 191 --
6.3.3 Radio 193 --
6.3.4 Other Media 198 --
6.4 Line Coding 199 --
6.4.1 Binary Line Codes 199 --
6.4.2 Multi-level Codes 202 --
6.4.3 Scrambling 203 --
6.4.4 Example Line Code Applications 206 --
6.5 Modulation 206 --
6.5.2 Multiple Access 207 --
6.5.3 Digital Modulation 210 --
6.6 Application Example: ADSL 220 --
6.7 Questions on the Channel Perspective 221 --
6.7.1 Questions on Channel Capacity 221 --
7 Putting it all together 223 --
7.2 GSM Mobile Phone System 223 --
7.2.1 Transmission Media 223 --
7.2.2 Line Coding and Modulation 223 --
7.2.3 Medium Access Control 224 --
7.2.4 Coding 226 --
7.3 Voice over IP (VoIP) 226 --
7.3.1 Requirements 227 --
7.3.2 Error Control 228 --
7.3.3 Transmission Protocol 228 --
7.3.4 Architecture 230.

There are no comments on this title.

to post a comment.