Switching C
Switching C
Switching
1
Switched Communications Networks
• Networks are used to interconnect many
devices.
E.g. LAN, MAN, WAN
Reference: https://slideplayer.com/slide/4883041/ 2
Switched Communications Networks
• Long distance transmission between stations (called
“end devices”) is typically done over a network of
switching nodes.
• Switching nodes do not concern with content of data.
Their purpose is to provide a switching facility that will
move the data from node to node until they reach their
destination (the end device).
• A collection of nodes and connections forms a
communications network.
• In a switched communications network, data entering
the network from a station are routed to the
destination by being switched from node to node.
Reference: https://slideplayer.com/slide/4883041/ 3
Simple Switching Network
Reference: https://slideplayer.com/slide/4883041/ 4
Switching Nodes
• Nodes may connect to other nodes, or to some
stations.
Reference: https://slideplayer.com/slide/4883041/ 5
Switched Network
Datagram
Virtual Circuit
Circuit Switching
• Circuit switching:
— There is a dedicated communication path between two stations
(end-to-end)
— The path is a connected sequence of links between network
nodes. On each physical link, a logical channel is dedicated to
the connection.
• Communication via circuit switching has three phases:
— Circuit establishment (link by link)
• Routing & resource allocation (FDM or TDM)
— Data transfer
— Circuit disconnect
• Deallocate the dedicated resources
• The switches must know how to find the route to the
destination and how to allocate bandwidth (channel) to
establish a connection.
Reference: https://slideplayer.com/slide/4883041/ 7
Public Circuit Switched
Network
Reference: https://slideplayer.com/slide/4883041/ 9
Circuit Switching
• Contiguous Flow
• No Header
• Efficiency
• Delay Lags Transmission Time Propagation Delay
10
Packet Switching Principles
• Problem of circuit switching
—designed for voice service
—Resources dedicated to a particular call
—For data transmission, much of the time the
connection is idle (say, web browsing)
—Data rate is fixed
• Both ends must operate at the same rate during the entire
period of connection
• Packet switching is designed to address these
problems.
Reference: https://slideplayer.com/slide/4883041/ 11
Basic Operation
• Data are transmitted in short packets
— Typically at the order of 1000 bytes
— Longer messages are split into series of packets
— Each packet contains a portion of user data plus some control
info
• Control info contains at least
— Routing (addressing) info, so as to be routed to the intended
destination
— Recall the content of an IP header!
• store and forward
— On each switching node, packets are received, stored briefly
(buffered) and passed on to the next node.
Reference: https://slideplayer.com/slide/4883041/ 12
Use of Packets
Reference: https://slideplayer.com/slide/4883041/ 13
Advantages of Packet Switching
• Line efficiency
— Single node-to-node link can be dynamically shared by many
packets over time
— Packets are queued up and transmitted as fast as possible
• Data rate conversion
— Each station connects to the local node at its own speed
• In circuit-switching, a connection could be blocked if
there lacks free resources. On a packet-switching
network, even with heavy traffic, packets are still
accepted, by delivery delay increases.
• Priorities can be used
— On each node, packets with higher priority can be forwarded
first. They will experience less delay than lower-priority packets.
Reference: https://slideplayer.com/slide/4883041/ 14
Packet Switching
• Data Link & Network Layer
• Store & Forward A 4 3 2 1
• Pipelining
• Efficiency
• Delay
No. of Switches 15
Circuit Switching Packet Switching
A physical path is established which is Data is divided into small units called
dedicated to a single connection between packets with each packet carrying small
the two end points. header containing signalling information.
Data transmission takes place after the Dynamic route is established for each
circuit is established for the duration of the packet which carries the routing
transmission. information.
A dedicated routing path is followed Each data packet may take a different
throughout the transmission and no other route to reach the destination, making it
user is allowed to use the circuit. flexible throughout the session.
It follows a uniform path throughout the
There is no end to end reservation of links.
session.
Each data packet carries the signalling
Data doesn’t carry the signalling information containing source and
information and moves on its own. destination addresses in the packet
header.
It’s mainly used for data and voice
It’s ideal for voice communication and the
communication, and the delay is not
delay is uniform.
uniform.
It is connection oriented which is It is connectionless and is implemented at
implemented at physical layer. network layer.
Reference: https://`slideplayer.com/slide/4883041/
Packet Switching Technique
• A station breaks long message into packets
• Packets are sent out to the network
sequentially, one at a time
• How will the network handle this stream of
packets as it attempts to route them through
the network and deliver them to the intended
destination?
—Two approaches
• Datagram approach
• Virtual circuit approach
Reference: https://slideplayer.com/slide/4883041/
17
Datagram
• Each packet is treated independently, with no
reference to packets that have gone before.
—Each node chooses the next node on a packet’s path.
• Packets can take any possible route.
• Packets may arrive at the receiver out of order.
• Packets may go missing.
• It is up to the receiver to re-order packets and
recover from missing packets.
• Example: Internet
Reference: https://slideplayer.com/slide/4883041/
18
Datagram
Reference: https://slideplayer.com/slide/4883041/ 19
Virtual Circuit
• In virtual circuit, a preplanned route is
established before any packets are sent, then all
packets follow the same route.
• Each packet contains a virtual circuit
identifier instead of destination address, and
each node on the preestablished route knows
where to forward such packets.
—The node need not make a routing decision for each
packet.
• Example: X.25, Frame Relay, ATM
Reference: https://slideplayer.com/slide/4883041/ 20
Virtual
Circuit
Reference: https://slideplayer.com/slide/4883041/ 21
Datagram Vs Virtual Circuit
22
Message Switching
• Predecessor of Packet Switching
• Store & Forward
• Hop by Hop Delivery (Entire message send from
one hop to hop)
• Delay & Efficiency is more as compared to
circuit switching
23
Virtual Circuits v Datagram
• Virtual circuits
— Network can provide sequencing (packets arrive at the same
order) and error control (retransmission between two nodes).
— Packets are forwarded more quickly
• Based on the virtual circuit identifier
• No routing decisions to make
— Less reliable
• If a node fails, all virtual circuits that pass through that node fail.
• Datagram
— No call setup phase
• Good for bursty data, such as Web applications
— More flexible
• If a node fails, packets may find an alternate route
• Routing can be used to avoid congested parts of the network
Reference: https://slideplayer.com/slide/4883041/ 24
Comparison of
communication
switching
techniques
Reference: https://slideplayer.com/slide/4883041/