COMPLETE COMPUTER NETWORK
-
Upload
amar-panchal -
Category
Technology
-
view
541 -
download
3
description
Transcript of COMPLETE COMPUTER NETWORK
![Page 1: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/1.jpg)
WWW.AMARPANCHAL.COM
Computer Networks
LMR
![Page 2: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/2.jpg)
What is….. It ?
• A computer network consists of end systems, which are sources of information, which are sources of information, which communicate through the transit systems interconnecting them. The transit system is also called an interconnect subsystem or a subnetwork.
![Page 3: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/3.jpg)
Topology:
– Topology refers to the way the network is laid out, either physically or logically. Two or more devices connect to a link, two or more links form a topology.
A
F
D
E
C
B
A
F
D
E
C
B
Central Controller
B A
HUB
HUBHUB
C D D DD
A B
C D
A
A
A
A
ARing interface
unit
![Page 4: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/4.jpg)
The OSI Model
![Page 5: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/5.jpg)
TCP/IP Protocol :
![Page 6: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/6.jpg)
DSL BLOCK DIAGRAM
![Page 7: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/7.jpg)
Asymmetrical DSL (ADSL)
• ADSL divides up the available frequencies in a line on the assumption that most Internet users look at, or download, much more information than they send, or upload. – Under this assumption, if the connection speed
from the Internet to the user is three to four times faster than the connection from the user back to the Internet, then the user will see the most benefit (most of the time).
![Page 8: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/8.jpg)
Asymmetrical DSL (ADSL)
• ADSL is an adaptive technology.
• The system uses a data rate based on the condition of the local loop line.
• Speed:Most existing local loops can handle
bandwidths up to 1.1 MHz.
![Page 9: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/9.jpg)
ADSL Modem
![Page 10: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/10.jpg)
OTHER TYPES OF DSL:
• Symmetric DSL (SDSL)• High-bit-rate DSL (HDSL)• Very high bit-rate DSL (VDSL)
![Page 11: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/11.jpg)
Symmetric DSL (SDSL)
• Used mainly by small businesses & residential areas
• Bit rate of downstream is higher than upstream
![Page 12: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/12.jpg)
High-bit-rate DSL (HDSL)
• Used as alternative of T-1 line• Uses 2B1Q encoding• Less susceptible to attenuation at higher
frequencies• Unlike T-1 line (AMI/1.544Mbps/1km), it can
reach 2Mbps @ 3.6Km
![Page 13: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/13.jpg)
Very high bit-rate DSL (VDSL)
• Uses DMT modulation technique• Effective only for short distances(300-1800m)• Speed:
downstream : 50 - 55 Mbpsupstream : 1.5-2.5 Mbps
![Page 14: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/14.jpg)
DATA LINK LAYER
• chacter count
![Page 15: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/15.jpg)
• Starting and ending characters with character stuffing
![Page 16: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/16.jpg)
• Starting end ending flags with bit stuffing.
![Page 17: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/17.jpg)
Flow Control
• STOP N WAIT• SLIDDING WINDOW
– SLIDDING WINDOW GO BACK N ARQ– SELECTIVE REJECT ARQ
![Page 18: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/18.jpg)
Error control :
• Cyclic redundancy check :• If Original Data to be transmitted is 110101010• Divisor is 10101• The data is appended with 4 zeros and divided by the divisor.• The remainder is added to the dividend in order to obtain the data to be transmitted.• 1101010100000• 1011• 1101010101011• Therefore, transmitted data : 1101010101011
10101 1101010100000
10101
11111
10101
10100
10101
11000
10101
11010
10101
11110
10101
1011 REMANIDER
![Page 19: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/19.jpg)
• HAMMING CODE
![Page 20: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/20.jpg)
CS757© Jörg Liebeherr, 2000-2003
• Communication networks can be classified based on the way in which the nodes exchange information:
Taxonomy of Networks
Communication Network
Circuit-SwitchedNetwork
Packet-SwitchedNetwork
Datagram Network
Virtual Circuit NetworkFrequency
DivisionMultiplexing
Time DivisionMultiplexing
Wavelength Division
Multiplexing
![Page 21: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/21.jpg)
CS757© Jörg Liebeherr, 2000-2003
• In a circuit-switched network, a dedicated communication path (“circuit”) is established between two stations through the nodes of the network
• The dedicated path is called a circuit-switched connection or circuit
• A circuit occupies a fixed capacity of each link for the entire lifetime of the connection. Capacity unused by the circuit cannot be used by other circuits
• Data is not delayed at the switches
Circuit Switching
![Page 22: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/22.jpg)
CS757© Jörg Liebeherr, 2000-2003
• Circuit-switched communication involves three phases:
1. Circuit Establishment2. Data Transfer3. Circuit Release
• “Busy Signal” if capacity for a circuit not available
• Most important circuit-switching networks:• Telephone networks• ISDN (Integrated Services Digital Networks)
Circuit Switching
![Page 23: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/23.jpg)
CS757© Jörg Liebeherr, 2000-2003
Circuit Switching
4
5
7
C
B
A E
1 2D
6
3
circuit 2
circuit 1
![Page 24: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/24.jpg)
CS757© Jörg Liebeherr, 2000-2003
Implementation of Circuit-Switching
• There are two ways to implement circuits– Frequency Division Multiplexing (FDM)– Time Division Multiplexing (TDM)– Wavelength Division Multiplexing (WDM)
• Example: Voice in (analog) telephone network: Needed bandwidth: 3000 Hz
Allocated bandwidth: 4000 HzTherefore, a channel with 64 kHz can carry 16 voice conversations
![Page 25: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/25.jpg)
CS757© Jörg Liebeherr, 2000-2003
Frequency Division Multiplexing (FDM)
Channel 1 (f1)
Channel 2 (f2)
Channel 3 (f3)
Channel 4 (f4)
Channel 5 (f5)
Channel 6 (f6)
Source 1
Source 2
Source 3
Source 4
Source 5
Source 6
1
2
3
4
5
6
Switch
Switch
Approach: Divide the frequency spectrum into logical channels and assign each information flow one logical channel
![Page 26: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/26.jpg)
CS757© Jörg Liebeherr, 2000-2003
Frequency Division Multiplexing (FDM)
CircuitSwitch
End-system
End-system
End-system
CircuitSwitch
End-system
• A circuit switch bundles (multiplexes) multiple voice calls on a high-bandwidth link
• Frequency-Division-Multiplexing (FDM): Each circuit receives a fixed bandwidth. The frequency of each call is shifted, so that multiple calls do not interfere
![Page 27: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/27.jpg)
CS757© Jörg Liebeherr, 2000-2003
Source 1
Source 2
Source 3
Source 4
Source 5
Source 6
1
2
3
4
5
6
U
X
M
U
X
M
1 2 3 4 5 6 1 2
Time Division Multiplexing (TDM) Approach: Multiple signals can be carried
on a single transmission medium by interleaving portions of each signal in time
![Page 28: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/28.jpg)
CS757© Jörg Liebeherr, 2000-2003
CircuitSwitch
end-system
end-system
end-system
CircuitSwitch
end-system
Time Division Multiplexing (TDM)
• Time is divided into frames of fixed length • Each frame has a fixed number of constant-sized “slots” • Each circuit obtains one or more “slots” per frame
frames
slots
![Page 29: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/29.jpg)
CS757© Jörg Liebeherr, 2000-2003
Circuit Switch
memory
switchfabric
•A circuit switch relays a circuit from an input to an output link
•A switch may reassign frequencies (FDM) or time slot allocation (TDM)
•No queueing delays are experienced
![Page 30: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/30.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Switching• Data are sent as formatted bit-sequences, so-called packets • Packets have the following structure:
• Header and Trailer carry control information
• Each packet is passed through the network from node to node along some path (Forwarding/Routing)
• At each node the entire packet is received, stored briefly, and then forwarded to the next node (Store-and-Forward Networks)
• Packet transmission is never interrupted (no preemption)• No capacity is allocated for packets
Header Data Trailer
![Page 31: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/31.jpg)
CS757© Jörg Liebeherr, 2000-2003
A Packet Switch
memory
outputqueues
inputqueues
switchfabric
![Page 32: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/32.jpg)
CS757© Jörg Liebeherr, 2000-2003
Transmissionline
Packets from differentstreams
1 12N
1
N
2
output buffer
Statistical Multiplexing
• Packet transmission on a link is referred to as statistical multiplexing – There is no fixed allocation of packet transmissions– Packets are multiplexed as they arrive
![Page 33: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/33.jpg)
CS757© Jörg Liebeherr, 2000-2003
Datagram Packet Switching
• The network nodes process each packet independentlyIf Host A sends two packets back-to-back to Host B over a datagram packet network, the network cannot tell that the packets belong together In fact, the two packets can take different routes
• Packets are called datagrams
• Implications of datagram packet switching: • A sequence of packets can be received in a different order than it
was sent• Each packet header must contain the full address of the destination
![Page 34: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/34.jpg)
CS757© Jörg Liebeherr, 2000-2003
Virtual-Circuit Packet Switching
• Virtual-circuit packet switching is a hybrid of circuit switching and packet switching– All data is transmitted as packets– Emulates a circuit-switched network
• All packets from one packet stream are sent along a pre-established path (=virtual circuit)– Guarantees in-sequence delivery of packets– Note: Packets from different virtual circuits may be
interleaved
![Page 35: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/35.jpg)
CS757© Jörg Liebeherr, 2000-2003
Virtual-Circuit Packet Switching
• Communication with virtual circuits (VC) takes place in three phases:
1. VC Establishment2. Data Transfer3. VC Disconnect
• Note: Packet headers don’t need to contain the full destination address of the packet
• Circuit-switched and virtual-circuit packet-switched networks are said to provide a connection-oriented service.
![Page 36: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/36.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Forwarding and Routing
• There are two parts to the routing problem:1. How to pass a packet from an input interface to the
output interface of a router (packet forwarding)? 2. How to calculate routes (routing algorithm)?
• Packet forwarding is done differently in datagram and virtual-circuit packet networks
• Route calculation is similar in datagram and virtual-circuit packet networks
![Page 37: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/37.jpg)
CS757© Jörg Liebeherr, 2000-2003
Datagram Packet Switching
4
5
7
C
B
A E
1 2D
6
3
A.3
A.2
C.2A.1
C.1
A.3
A.2
A.1
C.1
C.2
A.3A.2A.1
C.1C.2
A.3
A.2
C.2A.1
C.1
A.3A.2A.1
C.1C.2
A.2
A.3
A.1
A.2A.2A.2
C.2
A.2
A.3
A.1
A.2A.3
A.2
A.1
C.2
![Page 38: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/38.jpg)
CS757© Jörg Liebeherr, 2000-2003
4
5
7
C
B
A E
1 2D
6
3
A.3
A.2
A.1
Virtual-Circuit Packet Switching
VC 2
VC 1
C.1
C.2
C.1
C.2
A.3A.2A.1
A.3A.2A.1
C.1
C.2
A.3A.2A.1
A.3A.2A.1
A.3A.2C.2
A.1C.1
A.3A.2C.2
A.1C.1
C.1
A.3
A.1
C.2 A.3
A.1
A.2A.3
A.2
A.1C.1
A.3
A.1
C.2 A.3
A.1
A.2A.3
A.2
A.1
![Page 39: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/39.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Forwarding of Datagrams
• Recall: In datagram networks, each packet must carry the full destination address
• Each router maintains a routing table which has one row for each possible destination address
• The lookup yields the address of the next hop (next-hop routing)to
x
w v n
n
via(next hop)
d
Routing Table of node v
d
![Page 40: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/40.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Forwarding of Datagrams
• When a packet arrives at an incoming link, ...1. The router looks up the routing table2. The routing table lookup yields the address of the
next node (next hop)3. The packet is transmitted onto the outgoing link
that goes to the next hopto
x
w v n
n
via(next hop)
d
Routing Table of node v
d
d d
![Page 41: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/41.jpg)
CS757© Jörg Liebeherr, 2000-2003
ForwardingDatagrams
X
EA
C
B
D
To Next hop
A -
B B
C C
D C
E B
X C
To Next hop
A C
B C
C C
D C
E C
X -
To Next hop
A A
B -
C D
D D
E E
X D
To Next hop
A B
B B
C B
D B
E -
X B
To Next hop
A B
B B
C C
D -
E B
X C
To Next hop
A A
B -
C D
D D
E D
X E
EE
EE
EE
![Page 42: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/42.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Forwarding with Virtual Circuits
• Recall: In VC networks, the route is setup in the connection establishment phase
• During the setup, each router assigns a VC number (VC#) to the virtual circuit
• The VC# can be different for each hop• VC# is written into the packet headers
3dx
w v n
2w
Routing Table of node v
dfrom VC# to VC#
path of virtualcircuit
2 31
![Page 43: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/43.jpg)
CS757© Jörg Liebeherr, 2000-2003
Packet Forwarding of Virtual Circuits• When a packet with VCin in header arrives from router nin, ...
1. The router looks up the routing table for an entry with (VCin, nin)
2. The routing table lookup yields (VCout, nout)
3.The router updates the VC# of the header to VCout and transmits the packet to nout
3dx
w v n
2w
Routing Table of node v
dfrom VC# to VC#
path of virtualcircuit
2 31
2 3 1
![Page 44: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/44.jpg)
CS757© Jörg Liebeherr, 2000-2003
Forwarding with VCs
X
EA
C
B
D
nin Vin nout Vout
- - C 5
nin Vin nout Vout
X 5 D 3
nin Vin nout Vout
C 3 B 5
nin Vin nout Vout
D 5 E 3
nin Vin nout Vout
B 3 - -
Part 1: VC setup from X to E
![Page 45: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/45.jpg)
CS757© Jörg Liebeherr, 2000-2003
Forwarding with VCs
X
EA
C
B
D
nin Vin nout Vout
- - C 5
nin Vin nout Vout
X 5 D 3
nin Vin nout Vout
C 3 B 5
nin Vin nout Vout
D 5 E 2
nin Vin nout Vout
B 3 - -5
53
2
Part 2: Forwarding the packet
![Page 46: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/46.jpg)
CS757© Jörg Liebeherr, 2000-2003
Comparison
Dedicated transmission path
Continuous transmission
Path stays fixed for entire connection
Call setup delay Negligible
transmission delay No queueing delay Busy signal overloaded
network Fixed bandwidth for
each circuit No overhead after call
setup
Circuit Switching
No dedicated transmission path
Transmission of packets
Route of each packet is independent
No setup delay Transmission delay
for each packet Queueing delays at
switches Delays increase in
overloaded networks Bandwidth is shared
by all packets Overhead in each
packet
Datagram Packet Switching
No dedicated transmission path
Transmission of packets
Path stays fixed for entire connection
Call setup delay Transmission delay
for each packet Queueing delays at
switches Delays increase in
overloaded networks Bandwidth is shared
by all packets Overhead in each
packet
VC Packet Switching
![Page 47: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/47.jpg)
HDLC Overview
Broadly HDLC features are as follows:• Reliable protocol
– selective repeat or go-back-N• Full-duplex communication
– receive and transmit at the same time• Bit-oriented protocol
– use bits to stuff flags occurring in data• Flow control
– adjust window size based on receiver capability• Uses physical layer clocking and synchronization to
send and receive frames
![Page 48: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/48.jpg)
HDLC Overview• Defines three types of stations
– Primary– Secondary– Combined
• Defines three types of data transfer mode– Normal Response mode– Asynchronous Response mode– Asynchronous Balanced mode
• Three types of frames– Unnumbered– information– Supervisory
![Page 49: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/49.jpg)
HDLC• The three stations are :
– Primary station • Has the responsibility of controlling the operation of data flow the
link. • Handles error recovery• Frames issued by the primary station are called commands.
– Secondary station, • Operates under the control of the primary station. • Frames issued by a secondary station are called responses.• The primary station maintains a separate logical link with each
secondary station.– Combined station,
• Acts as both as primary and secondary station.• Does not rely on other for sending data
![Page 50: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/50.jpg)
HDLC
Primary
Secondary Secondary
Commands
Responses
Combined Combined
commands/Responses
Unbalanced Mode
Balanced mode
![Page 51: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/51.jpg)
HDLC• The three modes of data transfer operations are
– Normal Response Mode (NRM) • Mainly used in terminal-mainframe networks. In this case, • Secondaries (terminals) can only transmit when specifically instructed by
the primary station in response to a polling• Unbalanced configuration, good for multi-point links
– Asynchronous Response Mode (ARM) • Same as NRM except that the secondaries can initiate transmissions
without direct polling from the primary station• Reduces overhead as no frames need to be sent to allow secondary nodes
to transmit• Transmission proceeds when channel is detected idle , used mostly in
point-to-point-links– Asynchronous Balanced Mode (ABM)
• Mainly used in point-to-point links, for communication between combined stations
![Page 52: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/52.jpg)
Data Link Control HDLC frame structure
(a) Frame Format
(b) Control field format
![Page 53: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/53.jpg)
11-7 POINT-TO-POINT PROTOCOL
Although HDLC is a general protocol that can be used for both point-to-point and multipoint configurations, one of the most common protocols for point-to-point access is the Point-to-Point Protocol (PPP). PPP is a byte-oriented protocol.
![Page 54: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/54.jpg)
11.54
Figure 11.32 PPP frame format
![Page 55: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/55.jpg)
11.55
PPP is a byte-oriented protocol using byte stuffing with the escape byte 01111101.
Note
![Page 56: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/56.jpg)
11.56
Figure 11.33 Transition phases
![Page 57: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/57.jpg)
Routing :
• 1) Centralized Routing :• 2) Distributed Routing :• 3) Static Routing or Non-adaptive routing :• 4) Dynamic Routing or Adaptive Routing :
![Page 58: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/58.jpg)
• 1.Shortest path routing algorithm:
![Page 59: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/59.jpg)
• Distance Vector Routing :
![Page 60: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/60.jpg)
• . The count-to-infinity problem.
![Page 61: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/61.jpg)
• Link State Routing– Discover its neighbors and learn their network
addresses.– Measure the delay or cost to each of its neighbors.– Construct a packet telling all it has just learned.– Send this packet to all other routers.– Compute the shortest path to every other router.
![Page 62: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/62.jpg)
CS 640 62
CIDR Addresses
• Identifying a CIDR block requires both an address and a mask– Slash notation– 128.211.168.0/21 for addresses 128.211.168.0 – 128.211.175.255
• Here the /21 indicates a 21 bit mask– All possible CIDR masks can easily be generated
• /8, /16, /24 correspond to traditional class A, B, C categories
• IP addresses are now arbitrary integers, not classes• Raises interesting questions about lookups
– Routers cannot determine the division between prefix and suffix just by looking at the address
• Hashing does not work well• Interesting lookup algorithms have been developed and analyzed
![Page 63: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/63.jpg)
CS 640 63
CIDR – A Couple Details
• ISP’s can further subdivide their blocks of addresses using CIDR
• Some prefixes are reserved for private addresses– 10/8, 172.16/12, 192.168/16, 169.254/16– These are not routable in the Internet
![Page 64: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/64.jpg)
Traffic Shaping
![Page 65: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/65.jpg)
Congestion control
• In Virtual-Circuit – Admission control
• In Datagram Subnets– The Warning Bit– Choke Packets– Hop-by-Hop Choke Packets– Load Shedding– Jitter Control
![Page 66: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/66.jpg)
IP Addresses
![Page 67: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/67.jpg)
HEADER
![Page 68: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/68.jpg)
TRANSPORT LAYER
![Page 69: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/69.jpg)
HAND SHAKE
![Page 70: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/70.jpg)
T/TCP
![Page 71: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/71.jpg)
HEADER-TCP
![Page 72: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/72.jpg)
INTER NETWORKING DEVICES
![Page 73: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/73.jpg)
Connecting Devices and the OSI Model
![Page 74: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/74.jpg)
Connecting Devices
![Page 75: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/75.jpg)
Connecting Devices
Repeaters
Hubs
Bridges
Two-Layer Switches
![Page 76: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/76.jpg)
Connecting devices
![Page 77: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/77.jpg)
Repeaters• A repeater (or regenerator) is an electronic device that
operates on only the physical layer of the OSI model.• A repeater installed on a link receives the signal before it
becomes too weak or corrupted, regenerates the original pattern, and puts the refreshed copy back on the link.
![Page 78: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/78.jpg)
Repeaters• A repeater does not actually connect two LANS; it connects
two segments of the same LAN.
• A repeater forwards every frame; it has no filtering capability.
![Page 79: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/79.jpg)
Hubs
• A Hub is a multiport repeater. It is normally used to create connections between stations in a physical star topology.
![Page 80: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/80.jpg)
Bridges
• Bridges operate in both the physical and the data link layers of the OSI model.
![Page 81: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/81.jpg)
Bridges
• Bridges can divide a large network into smaller segments. They contain logic that allows them to keep the traffic on each segment separate. When a frame (or packet) enters a bridge, the bridge not only regenerates the signal but checks the destination address and forwards the new copy only to the segment the address belong.
![Page 82: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/82.jpg)
Bridges• A bridge operates in both the physical and the data link layers.• As a physical layer device, it regenerates the signal it receives.
• As a data link layer device, the bridge can check the physical
(MAC) address (source and destination) contained in the frame.
• A bridge has filtering capability. It can check the destination address of a frame and decide if the frame should be forwarded or dropped. If the frame is to be forwarded, the decision must specify the port.
• A bridge does not change the physical (MAC) addresses in a frame.
• A bridge has a table used in filtering decisions.
![Page 83: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/83.jpg)
Bridge
![Page 84: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/84.jpg)
Types of Bridges
• To select between segments, a bridge must have a look-up table that contains the physical addresses of every station connect to it. The table indicate to which segment each station belongs.
Simple Bridge• The address table must be entered manually, before a
simple bridge can be used.• Whenever a new station is added or removed, the table
must modified.• Installation and maintenance of simple bridges are time-
consuming and potentially more trouble than the cost savings are worth.
![Page 85: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/85.jpg)
Routers• Routers have access
to network layer addresses and contain software that enables them to determine which of several possible paths between those addresses is the best for a particular transmission.
• Routers operate in the physical, data link, and network layers of the OSI model.
![Page 86: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/86.jpg)
• Routers relay packets among multiple interconnected networks. They route packets from one network to any of a number of potential destination networks on an internet.
![Page 87: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/87.jpg)
Gateways• Gateways potentially operate in all seven layers of the OSI
model.
![Page 88: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/88.jpg)
Gateways
• A gateway is a protocol converter. A router by itself transfers, accepts, and relays packets only across networks using similar protocols.
A gateway can accept a packet formatted for one protocol (e.g. AppleTalk) and convert it to a packet for another protocol (e.g. TCP/IP).
![Page 89: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/89.jpg)
Gateways• A gateway is generally software installed within a router.
The gateway understands the protocols used by each network linked into the router and is therefore able to translate from one to another.
![Page 90: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/90.jpg)
What is SONET?
• Synchronous Optical Network standard
• Defines a digital hierarchy of synchronous signals• Maps asynchronous signals (DS1, DS3) to synchronous format• Defines electrical and optical connections between equipment• Allows for interconnection of different vendors’ equipment• Provides overhead channels for interoffice OAM&P
SONETNetworkElement
SONETNetworkElement
DigitalTributaries
DigitalTributaries
![Page 91: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/91.jpg)
SONET Rates
STS-1 OC-1 51.840
STS-3 OC-3 155.520
STS-12 OC-12 622.080
STS-48 OC-48 2,488.320
STS-192 OC-192 9,953.280
Level OpticalDesignation
Bit Rate(Mb/s)
STS = SYNCHRONOUS TRANSPORT SIGNALOC = OPTICAL CARRIER (“..result of a direct optical conversions of the STS after synchronous scrambling” - ANSI)
![Page 92: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/92.jpg)
SONET Network Layers
DS3etc
DS3etc
Path • Map Services & POH Into SPE• Path Protection/Restoration • Other Path OA&M Functions
Line • Combine SPE & LOH• Sync & Mux For Path Layer• Line Protection/Restoration• Other Line OA&M Functions
Section • Add SOH & Create STS Signal• Framing, Scrambling• Section OA&M Functions
Physical(Photonic)
• E/O Conversion• Line Code• Physical Signal[No additional overhead]
MUX LTE Regen MUXLTELTERegen
ServicesDS3, DS1, etc
SONET ADM
Path
Line Line
SectionSection Section Section
![Page 93: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/93.jpg)
Functional Description of SONET Layers
OH: Overhead
Path Layer
Line Layer
SectionLayer
PhotonicLayer
Information Payload
PathOH
LineOH
SectionOH
E/O Conversion
Transmission over OC-N
Function
Payload MappingError Monitoring
SynchronizationMultiplexingError MonitoringLine MaintenanceProtection SwitchOrder Wire
FramingScramblingError MonitoringSection MaintenanceOrderwire
E/O ConversionPulse ShapingPower LevelWavelenght
![Page 94: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/94.jpg)
Internet Protocol (IP)• Features:
– Layer 3 (Network layer)– Unreliable, Connectionless, Datagram– Best-effort delivery
• Popular version: IPv4• Major functions
– Global addressing– Datagram lifetime– Fragmentation & Reassembly
![Page 95: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/95.jpg)
IPv4 Header
![Page 96: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/96.jpg)
IPv4 companion protocols (1)
• ARP: Address Resolution Protocol– Mapping from IP address to MAC address
• ICMP: Internet Control Message Protocol– Error reporting & Query
• IGMP: Internet Group Management Protocol– Multicast member join/leave
• Unicast Routing Protocols (Intra-AS)– Maintaining Unicast Routing Table– E.g. RIP, OSPF (Open Shortest Path
First)
![Page 97: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/97.jpg)
IPv4 companion protocols (2)
• Multicast Routing Protocols– Maintaining Multicast Routing Table– E.g. DVMRP, MOSPF, CBT, PIM
• Exterior Routing Protocols (Inter-AS)– E.g. BGP (Border Gateway Protocol)
• Quality-of-Service Frameworks– Integrated Service (ISA, IntServ)– Differentiated Service (DiffServ)
![Page 98: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/98.jpg)
Why IPv6?• Deficiency of IPv4• Address space exhaustion• New types of service Integration
– Multicast– Quality of Service– Security– Mobility (MIPv6)
• Header and format limitations
![Page 99: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/99.jpg)
Advantages of IPv6 over IPv4
• Larger address space• Better header format• New options• Allowance for extension• Support for resource allocation• Support for more security• Support for mobility
![Page 100: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/100.jpg)
Header: from IPv4 to IPv6Changed Removed
![Page 101: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/101.jpg)
IPv6 Header Format
![Page 102: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/102.jpg)
Advantages of IPv6 over IPv4 (1)
Feature IPv4 IPv6
Source and destination address
32 bits 128 bits
IPSec Optional required
Payload ID for QoS in the header
No identification Using Flow label field
Fragmentation Both router and the sending hosts
Only supported at the sending hosts
Header checksum included Not included
Resolve IP address to a link layer address
broadcast ARP request
Multicast Neighbor Solicitation
message
![Page 103: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/103.jpg)
Advantages of IPv6 over IPv4 (2)
Feature IPv4 IPv6
Determine the address of the best default gateway
ICMP Router Discovery(optional)
ICMPv6 Router Solicitation and
Router Advertisement
(required)
Send traffic to all nodes on a subnet
Broadcast Link-local scope all-nodes multicast
address
Configure address Manually or DHCP Autoconfiguration
Manage local subnet group membership
(IGMP) Multicast Listener Discovery (MLD)
![Page 104: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/104.jpg)
Bluetooth Overview
• Wireless technology for short-range voice and data communication
• Low-cost and low-power• Provides a communication platform between a
wide range of “smart” devices• Not limited to “line of sight” communication
![Page 105: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/105.jpg)
Motivation
PDACell Phone
Cordless PhoneBase Station
InkjetPrinter
Scanner
Home Audio System
Computer
Digital Camera
![Page 106: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/106.jpg)
Bluetooth Applications
• Automatic synchronization between mobile and stationary devices
• Connecting mobile users to the internet using bluetooth-enabled wire-bound connection ports
• Dynamic creation of private networks
![Page 107: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/107.jpg)
Ad Hoc Networks
• Up to 8 devices can be actively connected in master/slave configuration
• Piconets can be combined to form scatternets providing unlimited device connectivity
![Page 108: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/108.jpg)
Bluetooth Radio
• Uses 2.4 GHz ISM band spread spectrum radio (2400 – 2483.5 MHz)
• Advantages– Free– Open to everyone worldwide
• Disadvantages– Can be noisy (microwaves, cordless phones,
garage door openers)
![Page 109: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/109.jpg)
Frequency Hopping
• In order to mitigate interference, Bluetooth implements frequency hopping
• 1600 hops per second through 79 1MHz channels
• Spreads Bluetooth traffic over the entire ISM band
• All slaves in piconet follow the master for frequency hop sequence
![Page 110: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/110.jpg)
Establishing Piconets
• Whenever there is a connection between two Bluetooth devices, a piconet is formed
• Always 1 master and up to 7 active slaves
• Any Bluetooth device can be either a master or a slave
• Can be a master of one piconet and a slave of another piconet at the same time (scatternet)
• All devices have the same timing and frequency hopping sequence
![Page 111: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/111.jpg)
Scatternets
• Formed by two or more Piconets
• Master of one piconet can participate as a slave in another connected piconet
• No time or frequency synchronization between piconets
![Page 112: COMPLETE COMPUTER NETWORK](https://reader036.fdocuments.in/reader036/viewer/2022062312/554a3981b4c90582328b49f3/html5/thumbnails/112.jpg)
Berkeley Sockets
The socket primitives for TCP.