Telecommunications Networks

Switching
 Switching
• Historically, telecoms systems began with point-to-point links directly
connecting nodes between which communication was required—
dedicated communication circuits
• As distances and number of nodes increased, it became infeasible to
have dedicated circuits between each pair of nodes—sharing of
transmission circuits became necessary
• etwork is a set of nodes that are interconnected to permit the
exchange of information and the sharing of resources
• Switching is the means by which information is transferred across a
network over the shared communication circuits
 Switching Techniques
• There are 3 main kinds of switching techniques:
– Circuit Switching
– Message Switching
– Packet Switching
• Briefly, the distinction between the 3 is as follows:
– Circuit: a pair of nodes has a dedicated communication circuit for duration of
communication, e.g., conventional telephony systems
– Message: storing and forwarding of messages at each intermediate node, e.g., telex
systems (telegraphy-based communication system using teleprinters, comprising
keyboard transmitters and printer receivers)
– Packet: similar to message switching but upper limit on size of messages—these
short messages are called packets, e.g., Internet and other data communications
networks
 Circuit Switching (1)
• Classic example: conventional telephony systems
• Each pair of communicating nodes/users has
exclusive use of a dedicated communications
circuit
• Communication is initiated by a connection phase
and terminated by a disconnection phase
• Circuit setup times in conventional telephony
systems can typically take 5-25 seconds after
dialing
Circuit Switching (2)
 Message Switching (1)
• When a message is to be sent between two communicating nodes, the
complete message is transmitted across each communications link,
stored at each intermediate node, and then forwarded to the next node
(hence store-and-forward)
• Typically no upper limit to size of message
• Header info, such as destination address, included with each message
(thus messages tend to be longer than in circuit switched systems)
• Queueing delays may be experienced at the nodes as messages queue
for access to outgoing links (cf. circuit setup delays in circuit switched
systems)
Message Switching (2)
 Packet Switching (1)
• Messages are broken up into shorter messages (packets) of a certain maximum size
• Each packet has some associated PCI (Protocol Control Information)
• 2 important advantages of packet switching:
– Since packets are short, associated transmission delays and occupation of
communication links are small (cf. transmission of large messages in message
switching)
– Pipelining (simultaneous use of multiple links to transmit the packets associated
with a single original message—see diagram overleaf). Hence, packet switching
may be considerably faster than message switching despite the inclusion of PCI
with each packet
• 2 kinds of packet switching: Datagram and Virtual Circuit
Packet Switching (2)
 Datagram Packet Switching
• Each packet treated as a separate entity with its own header containing
full info about destination node
• Intermediate nodes (routers) examine each packet’s header to
determine appropriate outgoing link on which to forward packet
• No predetermined/pre-established routes
• Packets may follow different routes & arrive out of sequence
• Typically: delivery is not guaranteed (best effort service); No QoS
guarantees (in terms of delays, etc.)
• Example: TCP/IP-based networks such as the Internet
 Virtual Circuit Packet Switching
• Involves an initial set-up phase to determine a fixed route between end
nodes (as in circuit switched systems)
• At each intermediate node, an entry is made in a table to indicate the
route for the connection that has just been established
• Packets can use short headers since only the virtual circuit needs to be
included rather than the full destination address
• Other possible enhancements such as for reliability and QoS
• Example: ATM networks
 Cct Switching v. Pckt Switching
Item Circuit Switched Packet Switched

Dedicated path Yes No

Bandwidth allocation Fixed Dynamic

Bandwidth wastage Yes No

Store and forward No Yes

Delivery sequence Always in sequence May be out of seq.

Call setup Yes No

Congestion phase @ call setup time Throughout

Typical pricing Distance/time-based Volume-based