Professional Documents
Culture Documents
Networking Concepts Switching Networks: Dr.K.Murugan Assistant Professor VIT
Networking Concepts Switching Networks: Dr.K.Murugan Assistant Professor VIT
SWITCHING NETWORKS
DR.K.MURUGAN
ASSISTANT PROFESSOR
VIT
SUMMARY OF TOPICS
Simple Solution: Connect each pair of end system by a dedicated point-to-point link
The simple solution is sufficient if the number of end systems is small
COMMUNICATION NETWORKS
With a large number of end systems it is not practical to connect each pair
COMMUNICATION NETWORKS
Principles:
There are two types of devices: end systems and nodes
Each node is connected to at least one node
Network nodes carry the information from a source to a destination end system
Note: Network nodes do not generate information
COMMUNICATION NETWORKS
end system
Communication
Node Network
Communication networks can be classified based on the way in which the nodes
exchange information:
Communication
Network
Circuit-Switched Packet-Switched
Network Network
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
C
circuit 2
B D
1 2
3
A circuit 1 7 6 E
IMPLEMENTATION OF CIRCUIT-SWITCHING
There are two ways to implement circuits
Frequency Division Multiplexing (FDM)
Time Division Multiplexing (TDM)
Wavelength Division Multiplexing (WDM)
Source 6 6
Channel 6 (f6)
FREQUENCY DIVISION MULTIPLEXING (FDM)
End- End-
system system
Circuit Circuit
Switch Switch
End- End-
system system
Source 1
1
Source 2
2
M M
Source 3 3
U 1 2 3 4 5 6 1 2 U
Source 4 4
Source 5 X X
5
Source 6 6
TIME DIVISION MULTIPLEXING (TDM)
end- end-
system
slots system
Circuit Circuit
Switch Switch
end- end-
system frames system
switch
fabric
memory
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
A PACKET SWITCH
input output
queues queues
switch
fabric
memory
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
output buffer
N
DATAGRAM PACKET SWITCHING
The network nodes process each packet independently
If 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
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
VIRTUAL-CIRCUIT PACKET SWITCHING
Communication with virtual circuits (VC) takes place in three phases:
1. VC Establishment
2. Data Transfer
3. VC Disconnect
Note: Packet headers don’t need to contain the full destination address of the packet
C
A.1
C.2 C.1
B C.1 C.2
A.2
A.3
D
1 2
C.1
C.2 3
A.1
A.3 C.2
A.3 A.2
A.1 5
A.2
4 A.2
A A.1 7 A.2 6 E
A.2
A.3
VIRTUAL-CIRCUIT PACKET SWITCHING
C.2
C A.1
C.1
C.1
B VC 2 A.2
C.2 A.3 D
1 2
C.2
C.1 3
A.1 C.1
C.2
A.3 A.2
5
A.1
A.3 A.2
4
A A.1 VC 1 7 6 E
A.2
A.3
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 via
(next hop)
w v n d
x
d n
PACKET FORWARDING OF DATAGRAMS
When a packet arrives at an incoming link, ...
1. The router looks up the routing table
2. 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 hop
to via
(next hop)
w v n d
x
d n
d d
FORWARDING
To Next
hop
To Next
hop
DATAGRAMS A - A A
B B B -
C C C D
D C D D To Next
E B E E hop
X C X D E A B
E B B
A B E
C B
To Next D B
E
hop E E -
A C
E E
X C D X B
B C
C C To Next To Next
hop hop
D C
A A A B
E C
B - B B
X -
C D C C
D D D -
E D E B
X E X C
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
x
w 2 d 3
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 (VC in, nin)
2. The routing table lookup yields (VCout, nout)
3. The router updates the VC# of the header to VC out and transmits the packet to nout
2 3 x 1
w 2 d 3
FORWARDING WITH VCS
from X to E D 5 E 3
- - C 5
nin Vin nout Vout
B 3 - -
X C D
the packet D 5 E 2
2
nin Vin nout Vout A B E
- - C 5
nin Vin nout Vout
5
5 3 B 3 - -
X C D