Академический Документы
Профессиональный Документы
Культура Документы
insulating material
copper or aluminum
conductor
• Infrared
– “invisible” light waves (frequency is below red light)
– Requires line of sight; generally subject to interference from heavy rain,
smog, and fog
– Used in remote control units (e.g., TV)
A special form of
microwave
communications
3.25
Figure 3.25 Causes of impairment
3.26
Figure 3.26 Attenuation
3.27
Example 3.26
3.29
Example 3.28
3.30
Figure 3.27 Decibels for Example 3.28
3.31
Example 3.29
Solution
We can calculate the power in the signal as
3.32
Example 3.30
3.33
Figure 3.29 Noise
3.34
Example 3.31
Solution
The values of SNR and SNRdB can be calculated as
follows:
3.35
Example 3.32
3.36
DELAY ANALYSIS
3.37
PROCESSING AND QUEUING DELAY
Processing Delay
• Required time to analyze a packet header and decide
where to send the packet (e.g. a routing decision)
• Inside a router this depends on the number of entries in the
routing table, the implementation of data structures, hardware
in use, etc.
• This can include error verification, such as IPv4, IPv6
header checksum calculations.
Queueing or Buffer Delays
• The time a packet is enqueued until it is transmitted
• The number of packets waiting in the queue will
depend on traffic intensity and of the type of traffic
(bursty or sustained)
• Router queue algorithms try to adapt delays to specific
preferences, or impose equal delay On all traffic.
3.38
TRANSMISSION DELAY AND PROPOGATION
DELAY
Transmission Delay
The time required to push all the bits in a MESSAGE on
the transmission medium in use.
B= bandwidth of channel/link, S=Size of message, Td= transmission
delay
Td = S/B
Propogation Delay
Once a bit is 'pushed' on to the transmission medium, the time
required for the bit to propagate to the end of its physical
trajectory
• The velocity of propagation of the circuit depends mainly on
the actual distance of the physical circuit
For d = distance, s = propagation velocity, Pd= propogation
delay
3.39 Pd = d/s
Some important formulae
3.40
DELAY ANALYSIS
3.41
Example 3.46
Solution
We can calculate the propagation and transmission time
as shown on the next slide:
3.42
Example 3.46 (continued)
3.43
Example 3.47
Solution
We can calculate the propagation and transmission
times as shown on the next slide.
3.44
Example 3.47 (continued)
3.45
QUES.1
Question : How much time will it take to send a packet
of size L bits from A to B (A---R1---R2---B) if Bandwidth
is R bps, propagation speed is t meter/sec and distance
b/w any two points is d meters (ignore processing and
queuing delay) ?
Ans: N = no. of links = no. of hops = no. of routers +1 = 3 ,File size = L bits ,Bandwidth = R bps,
Propagation speed = t meter/sec, Distance = d meters
Transmission delay = (N*L)/R = (3*L)/R sec
Propagation delay = N*(d/t) = (3*d)/t sec
Total time = 3*(L/R + d/t) sec
3.46
QUES.2
3.47
Answer
3.48
Average Queuing delay = (N-1)L/(2*R)
where N = no. of packets L=size of packet R=bandwidth
3.49
Queueing delay
3.50
Switching-Motivation
Explain Scenario 2
Circuit Switching
• Circuit switching is a technique that directly connects the sender and the receiver in an unbroken path.
• Phase 1-Connection Establishment
– With this type of switching technique, once a connection is established, a dedicated path exists between both ends until the
connection is terminated.
– Routing decisions must be made when the circuit is first established, but there are no decisions made after that time.
• Phase 2- Data Transfer
– Once the connection has been initiated and completed to the destination device, the destination device must acknowledge that it
is ready and willing to carry on a transfer.
• Phase 3- Connection Teardown
– After Data Transfer is complete, the Resources reserved during setup are released.
Delay in a Circuit-Switched Network
8.64
Figure 8.14 Setup request in a virtual-circuit network
8.65
Figure 8.15 Setup acknowledgment in a virtual-circuit network
8.66
Delay Analysis in Virtual Circuit
Comparison chart
Exercise:
• There is a network having bandwidth of 1 MBps.
• A message of size 1000 bytes has to be sent.
• Packet switching technique is used.
• Each packet contains a header of 100 bytes.
• Out of the following, in how many packets the message must be divided so that total
time taken is minimum-
• 1 packet
• 5 packets
• 10 packets
• 20 packets[GATE-2014]
Important Points to NOTE
• NOTE
• While calculating the total time, we often ignore the
propagation delay.
• The reason is in packet switching, transmission delay
dominates over propagation delay.
• This is because each packet is transmitted over the link at
each hop.
Case-01: Sending Message in 1 Packet-
In this case, the entire message is sent in a single packet.
Size Of Packet-
Packet size
= 1000 bytes of data + 100 bytes of header
= 1100 bytes
Transmission Delay-
Transmission delay
= Packet size / Bandwidth
= 1100 bytes / 1 MBps
= 1100 x 10-6 sec
= 1100 μsec
= 1.1 msec
Total time taken to send the complete message from sender to receiver
= 3 x Transmission delay
= 3 x 1.1 msec
= 3.3 msec
Exercise:
In a packet switching network, packets are routed from source to
destination along a single path having two intermediate nodes. If the
message size is 24 bytes and each packet contains a header of 3 bytes,
then the optimum packet size is-[GATE-2017]
• 4 bytes
• 6 bytes
• 7 bytes
• 9 bytes
Option 1
• Let bandwidth of the network = X Bps and 1 / X = a
• Option-A: Packet Size = 4 Byte
• In this case The entire message is divided into packets of size 4 bytes. These packets are then sent
one after the other.
• Data Sent in One Packet-
• Data size = Packet size – Header size = 4 bytes – 3 bytes = 1 byte
• Thus, only 1 byte of data can be sent in each packet.
• Number of packets required = Total data to be sent / Data contained in one packet = 24 bytes / 1 byte
= 24 packets
• Transmission delay = Packet size / Bandwidth = 4 bytes / X Bps = 4a sec
• Time Taken By First Packet- Time taken by the first packet to reach from sender to receiver = 3 x
Transmission delay = 3 x 4a sec = 12a sec
• Time Taken By Remaining Packets-
• Time taken by the remaining packets to reach from sender to receiver = Number of remaining
packets x Transmission delay = 23 x 4a sec = 92a sec
• Total Time Taken- Total time taken to send the complete message from sender to receiver = 12a sec
+ 92a sec = 104a sec
Similarly calculate for other options
• Option-B: Packet Size = 6 bytes
• Option-C: Packet Size = 7 bytes
• Option-D: Packet size = 9 Bytes
• Observations-
• From here,
• Total time taken when packet size is 4 bytes = 104a sec
• Total time taken when packet size is 6 bytes = 60a sec
• Total time taken when packet size is 7 bytes = 56a sec
• Total time taken when packet size is 9 bytes = 54a sec
Problem with Crossbar Switch
M * N crosspoints i.e O(MN) or if M=N then O(N2), suppose m=1000 and n=10000, then
1000*10000 crosspoints, normally only 25% of the crosspoints are active at any time.
Figure 8.18 Multistage switch
8.76
Note
Solution
In the first stage we have N/n or 10 crossbars, each of size
20 × 4. In the second stage, we have 4 crossbars, each of
size 10 × 10. In the third stage, we have 10 crossbars,
each of size 4 × 20. The total number of crosspoints is
2kN + k(N/n)2, or 2000 crosspoints. This is 5 percent of
the number of crosspoints in a single-stage switch (200 ×
200 = 40,000).
8.78
PROBLEM OF BLOCKING IN MULTISTAGE SWITCH
"In multistage switching, blocking refers to times when one
input cannot be connected to an output because there is
no path available between them—all the possible
intermediate switches are occupied. One solution to
blocking is to increase the number of intermediate
switches based on the Clos criteria."
Solution
We let n = (200/2)1/2, or n = 10. We calculate k = 2n − 1 =
19. In the first stage, we have 200/10, or 20, crossbars,
each with 10 × 19 crosspoints. In the second stage, we
have 19 crossbars, each with 10 × 10 crosspoints. In the
third stage, we have 20 crossbars each with 19 × 10
crosspoints. The total number of crosspoints is 20(10 ×
19) + 19(10 × 10) + 20(19 ×10) = 9500.
8.80