Normal view MARC view ISBD view

Data communications and networks : (Record no. 9612)

MARC details
000 -LEADER
fixed length control field	07395nam a22002537i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20230827143551.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	150309s2012 ii a\|\|\|\| \|\|\|\| 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	9788126507658
040 ## - CATALOGING SOURCE
Transcribing agency	EG-NcFUE
Description conventions	rda
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number	004.6
Edition number	22
Item number	I.J.D
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name	Irvine, James,
Dates associated with a name	1968-,
Relator term	author
245 10 - TITLE STATEMENT
Title	Data communications and networks :
Remainder of title	an engineering approach /
Statement of responsibility, etc	James Irvine and David Harle
264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc	New Delhi :
Name of publisher, distributor, etc	Wiley,
Date of publication, distribution, etc	2012
300 ## - PHYSICAL DESCRIPTION
Extent	xx, 268 pages :
Other physical details	illustrations ;
Dimensions	25 cm
336 ## - CONTENT TYPE
Content type term	text
Source	rdacontent
337 ## - MEDIA TYPE
Media type term	unmediated
Source	rdamedia
338 ## - CARRIER TYPE
Carrier type term	volume
Source	rdacarrier
500 ## - GENERAL NOTE
General note	Includes index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note	1 Communication Systems 1 --<br/>1.2 Partitioning Communication Systems 1 --<br/>1.3 Layered Communication Architectures 3 --<br/>1.3.1 Need for Standards 4 --<br/>1.3.2 Internet Reference Model 5 --<br/>1.3.3 OSI Reference Model 5 --<br/>2 User Perspective 13 --<br/>2.1 User Data 13 --<br/>2.2 Introduction to Information Theory 13 --<br/>2.2.1 Information Content 13 --<br/>2.2.2 Mutual Information 15 --<br/>2.3 Information Sources 16 --<br/>2.4 Coding 16 --<br/>2.4.1 Properties of Codes 16 --<br/>2.4.2 Minimum Code Lengths 17 --<br/>2.4.3 Redundancy and Efficiency 17 --<br/>2.4.4 Types of Coding 18 --<br/>2.5 Source Coding 18 --<br/>2.5.1 Quantisation 18 --<br/>2.5.2 Quantisation Accuracy 19 --<br/>2.5.3 Sampling Rate 20 --<br/>2.5.4 Fourier Series 20 --<br/>2.5.5 Calculation of the Frequency Spectrum 20 --<br/>2.5.6 Frequency Spectrum 23 --<br/>2.5.7 Minimum Sampling Rate 23 --<br/>2.5.8 Pulse Code Modulation (PCM) 24 --<br/>2.5.9 Source Coding for Memoryless Sources 24 --<br/>2.5.10 Source Coding for Sources with Memory 26 --<br/>2.6 Questions on the User Perspective 29 --<br/>2.6.1 Questions on Information Theory 29 --<br/>2.6.2 Questions on Memoryless Source Coding 29 --<br/>2.6.3 Questions on Source Coding for Sources with Memory 30 --<br/>3 Security Perspective 31 --<br/>3.2 Types of Cryptography 31 --<br/>3.2.1 Diffusion 32 --<br/>3.2.2 Confusion 33 --<br/>3.3 Cryptographic Scenarios 33 --<br/>3.4 Private Key Systems 34 --<br/>3.4.2 Transposition Ciphers 35 --<br/>3.4.3 Transformation Ciphers 35 --<br/>3.4.4 One Time Pad 37 --<br/>3.4.5 Shift Register Encoders 38 --<br/>3.4.6 Product Ciphers 38 --<br/>3.4.7 Stream Ciphers 41 --<br/>3.5 Public Key Cryptosystems 42 --<br/>3.5.1 Key Distribution Problem 42 --<br/>3.5.2 One Way Functions 44 --<br/>3.5.3 Diffie-Hellman Key Exchange 45 --<br/>3.5.4 RSA (Rivest, Shamir, Adleman) Cryptosystem 46 --<br/>3.6 Authentication 47 --<br/>3.6.2 Integrity 47 --<br/>3.6.3 Authentication 49 --<br/>3.6.4 Digital Signatures 50 --<br/>3.7 Other Cryptographic Protocols 50 --<br/>3.7.1 Tossing a Coin Remotely 50 --<br/>3.7.2 Oblivious Transfer 51 --<br/>3.8 Practical Security 52 --<br/>3.8.1 How Much Security? 52 --<br/>3.8.2 Trusted Authorities 53 --<br/>3.8.3 Error Conditions 53 --<br/>3.8.4 Human Factor 53 --<br/>3.9 Questions on the Security Perspective 54 --<br/>4 Network Perspective 55 --<br/>4.2 Network Configurations 56 --<br/>4.2.1 Network Topology 58 --<br/>4.2.2 Connectivity 60 --<br/>4.3 Network Size 64 --<br/>4.3.1 Wide Area Networks 64 --<br/>4.3.2 Metropolitan Area Networks 65 --<br/>4.3.3 Local Area Networks 65 --<br/>4.4 Switching Techniques 65 --<br/>4.4.1 Circuit Switching 66 --<br/>4.4.2 Packet Switching 66 --<br/>4.5 Service Definition from a Network Viewpoint 70 --<br/>4.5.1 Non-performance-oriented Quality Parameters 71 --<br/>4.5.2 Performance-oriented Quality Parameters 71 --<br/>4.6 Network Dimensioning 72 --<br/>4.6.1 Dimensioning in Circuit Switching 72 --<br/>4.6.2 Dimensioning in Packet-Switched Systems 75 --<br/>4.7 Link Properties 80 --<br/>4.8 Internetworking 81 --<br/>4.8.1 Repeater 81 --<br/>4.8.2 Bridge 82 --<br/>4.8.3 Router 82 --<br/>4.8.4 Higher Level Gateway 83 --<br/>4.9 Routing 83 --<br/>4.9.1 Shortest Path 84 --<br/>4.9.2 Flooding 86 --<br/>4.9.3 Distributed Routing 87 --<br/>4.9.4 Broadcast Routing 89 --<br/>4.10 Congestion 91 --<br/>4.10.1 Admission Control 91 --<br/>4.10.2 Load Shedding 91 --<br/>4.10.3 Flow Control 92 --<br/>4.11 Error Control 92 --<br/>4.11.1 Error Detection 93 --<br/>4.11.2 ARQ 94 --<br/>4.12 Transport Layer Services 98 --<br/>4.12.1 Addressing 99 --<br/>4.12.2 OSI Transport Service Classes 100 --<br/>4.12.3 Internet Transport Service Classes 101 --<br/>4.13 Internet Protocol 106 --<br/>4.13.1 IP Packet Format 106 --<br/>4.13.2 Addressing 108 --<br/>4.13.3 Subnets 108 --<br/>4.13.4 Classless Addressing 110 --<br/>4.13.5 Domain Name Service 111 --<br/>4.13.6 IP Routing 113 --<br/>4.13.7 IPv6 114 --<br/>4.14 QoS over IP 116 --<br/>4.14.1 Integrated Services 116 --<br/>4.14.2 Resource Reservation Protocol 117 --<br/>4.14.3l Differentiated Services 118 --<br/>4.14.4 Multi-Protocol Label Switching 119 --<br/>4.15 Questions on the Network Perspective 120 --<br/>4.15.1 Questions on Network Configuration 120 --<br/>4.15.2 Questions on Switching Techniques 121 --<br/>4.15.3 Questions on Network Dimensioning 121 --<br/>4.15.4 Questions on Routing 122 --<br/>4.15.5 Questions on Error Control 122 --<br/>5 Link Perspective 124 --<br/>5.1 Data Link Layer 124 --<br/>5.2 Frame Delimiting 124 --<br/>5.3 Medium Access Control 125 --<br/>5.3.1 Contention-Based Schemes 125 --<br/>5.3.2 Reservation-Based Schemes 128 --<br/>5.3.3 Comparison of Access Techniques 133 --<br/>5.4 Channel Coding 133 --<br/>5.4.1 Probability of Error 136 --<br/>5.4.2 Constructing Error Correcting Codes 136 --<br/>5.4.3 Linear Codes 137 --<br/>5.4.4 Convolutional Codes 141 --<br/>5.4.5 Interleaving 144 --<br/>5.4.6 Combining Codes 144 --<br/>5.5 Comparison between Forward and Feedback Error Correction (ARQ) 147 --<br/>5.6 Local Area Networks 148 --<br/>5.6.1 LAN Configuration 149 --<br/>5.6.2 IEEE 802 LANs 149 --<br/>5.6.3 Device Addressing 150 --<br/>5.6.4 IEEE 802.3 (Ethernet) LAN 152 --<br/>5.6.5 High Speed Ethernet 153 --<br/>5.6.6 IEEE Token Ring LANs 158 --<br/>5.6.7 IEEE 802.11 Wireless LAN 159 --<br/>5.7 Connecting LANs 160 --<br/>5.7.1 Repeaters 160 --<br/>5.7.2 Bridges 161 --<br/>5.8 WAN Protocols 163 --<br/>5.8.1 SDH/SONET 163 --<br/>5.8.2 ATM 164 --<br/>5.9 Transporting IP over WANs 172 --<br/>5.9.1 Point-to-Point Protocol 172 --<br/>5.9.2 IP over SDH/SONET 173 --<br/>5.9.3 IP over ATM 174 --<br/>5.10 Metropolitan Area Networks 174 --<br/>5.10.1 Fibre Distributed Data Interface 176 --<br/>5.10.2 Distributed Queue Dual Bus 179 --<br/>5.11 Questions on the Link Perspective 182 --<br/>5.11.1 Questions on Linear Codes 182 --<br/>5.11.2 Questions on Convolutional Codes 184 --<br/>5.11.3 Questions on LANs and MANs 185 --<br/>6 Channel Perspective 186 --<br/>6.2 Channel Capacity 186 --<br/>6.2.1 Discrete Memoryless Channel 186 --<br/>6.2.2 Capacity of a Discrete Memoryless Channel 187 --<br/>6.2.3 Channel Coding Theorem 188 --<br/>6.2.4 Analogue Channels--The Channel Capacity Theorem 188 --<br/>6.3 Transmission Media 189 --<br/>6.3.1 Wire 189 --<br/>6.3.2 Optical Fibre 191 --<br/>6.3.3 Radio 193 --<br/>6.3.4 Other Media 198 --<br/>6.4 Line Coding 199 --<br/>6.4.1 Binary Line Codes 199 --<br/>6.4.2 Multi-level Codes 202 --<br/>6.4.3 Scrambling 203 --<br/>6.4.4 Example Line Code Applications 206 --<br/>6.5 Modulation 206 --<br/>6.5.2 Multiple Access 207 --<br/>6.5.3 Digital Modulation 210 --<br/>6.6 Application Example: ADSL 220 --<br/>6.7 Questions on the Channel Perspective 221 --<br/>6.7.1 Questions on Channel Capacity 221 --<br/>7 Putting it all together 223 --<br/>7.2 GSM Mobile Phone System 223 --<br/>7.2.1 Transmission Media 223 --<br/>7.2.2 Line Coding and Modulation 223 --<br/>7.2.3 Medium Access Control 224 --<br/>7.2.4 Coding 226 --<br/>7.3 Voice over IP (VoIP) 226 --<br/>7.3.1 Requirements 227 --<br/>7.3.2 Error Control 228 --<br/>7.3.3 Transmission Protocol 228 --<br/>7.3.4 Architecture 230.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Computer networks.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Harle, David
Fuller form of name	(David),
Dates associated with a name	1963-,
Relator term	author
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme	Dewey Decimal Classification
Koha item type	Books

Holdings
Lost status	Source of classification or shelving scheme	Damaged status	Not for loan	Collection code	Home library	Current library	Shelving location	Date acquired	Source of acquisition	Cost, normal purchase price	Acquisition method	Total Checkouts	Full call number	Barcode	Date last seen	Price effective from	Koha item type
	Dewey Decimal Classification			Computers & Information Technology ( Digital Media Tech. )	Main library	Main library	A1	09/03/2015	Osiris Bookshop	148.00	Purchase		004.6 I.J.D	00012469	18/02/2025	09/03/2015	Books