CS553 ST7 Ch10-CircuitandPacketSwitch
CS553 ST7 Ch10-CircuitandPacketSwitch
Chapter 10
Circuit Switching and Packet
Switching
Switching Networks
• Long distance transmission is typically done over
a network of switched nodes
• Nodes not concerned with content of data
• End devices are stations
—Computer, terminal, phone, etc.
• A collection of nodes and connections is a
communications network
• Data routed by being switched from node to
node
Nodes
• Nodes may connect to other nodes only, or to
stations and other nodes
• Node to node links usually multiplexed
• Network is usually partially connected
—Some redundant connections are desirable for
reliability
• Two different switching technologies
—Circuit switching
—Packet switching
Simple Switched Network
Circuit Switching
• Dedicated communication path between two
stations
• Three phases
—Establish
—Transfer
—Disconnect
• Must have switching capacity and channel
capacity to establish connection
• Must have intelligence to work out routing
Circuit Switching - Applications
• Inefficient
—Channel capacity dedicated for duration of
connection
—If no data, capacity wasted
• Set up (connection) takes time
• Once connected, transfer is transparent
• Developed for voice traffic (phone)
Public Circuit Switched
Network
Telecomms Components
• Subscriber
— Devices attached to network
• Subscriber line
— Local Loop
— Subscriber loop
— Connection to network
— Few km up to few tens of km
• Exchange
— Switching centers
— End office - supports subscribers
• Trunks
— Branches between exchanges
— Multiplexed
Circuit Establishment
Circuit Switch Elements
Circuit Switching Concepts
• Digital Switch
—Provide transparent signal path between devices
• Network Interface
• Control Unit
—Establish connections
• Generally on demand
• Handle and acknowledge requests
• Determine if destination is free
• construct path
—Maintain connection
—Disconnect
Blocking or Non-blocking
• Blocking
—A network is unable to connect stations because all
paths are in use
—A blocking network allows this
—Used on voice systems
• Short duration calls
• Non-blocking
—Permits all stations to connect (in pairs) at once
—Used for some data connections
Problem
• Consider two hosts, A and B, connected by a single link of
rate R bps. Suppose that the two hosts are separated by m
meters, and suppose the propagation speed along the link is s
meters/sec. Host A is to send a packet of size L bits to Host B.
• a. Ignoring processing and queuing delay, obtain an
expression for the end-to-end delay.
• b. Suppose s=2.5*10^8 meters/sec, L=120 bits, and
R=56kbps. Find the distance m so that the propagation delay
equals transmission delay.
Circuit switching problem
• Find the total delay in sending x bits of user data over a k-hop
path in a circuit switched networks. Consider lossless circuit
switching networks, the circuit setup time is s seconds, the
propagation delay is d second per hop, each packet contains p
data bits, and the bit rate of the line on each hop is b bps.
• Over the circuit-switched network, the total delay is due to
three parts: the setup time s, the total propagation delay kd,
and the transmission time x/b. So,
• Circuit switching
• Packet switching
Packet Switching Principles
• Circuit switching designed for voice
—Resources dedicated to a particular call
—Much of the time a data connection is idle
—Data rate is fixed
• Both ends must operate at the same rate
Basic Operation
• Data transmitted in small packets
—Typically 1000 octets
—Longer messages split into series of packets
—Each packet contains a portion of user data plus
some control info
• Control info
—Routing (addressing) info
• Packets are received, stored briefly (buffered)
and past on to the next node
—Store and forward
Store-and-Forward
Transmission
Packet switching – Packet loss
Caravan Analogy
Nodal delay
Use of Packets
Advantages
• Line efficiency
— Single node to node link can be shared by many packets over
time
— Packets queued and transmitted as fast as possible
• Data rate conversion
— Each station connects to the local node at its own speed
— Nodes buffer data if required to equalize rates
• Packets are accepted even when network is busy
— Delivery may slow down
• Priorities can be used
Switching Technique
• Station breaks long message into packets
• Packets sent one at a time to the network
• Packets handled in two ways
—Datagram
—Virtual circuit
Datagram
• Each packet treated independently
• Packets can take any practical route
• Packets may arrive out of order
• Packets may go missing
• Up to receiver to re-order packets and recover
from missing packets
Datagram
Diagram
Virtual Circuit
• Preplanned route established before any packets
sent
• Call request and call accept packets establish
connection (handshake)
• Each packet contains a virtual circuit identifier
instead of destination address
• No routing decisions required for each packet
• Clear request to drop circuit
• Not a dedicated path
Virtual
Circuit
Diagram
Virtual Circuits v Datagram
• Virtual circuits
—Network can provide sequencing and error control
—Packets are forwarded more quickly
• No routing decisions to make
—Less reliable
• Loss of a node looses all circuits through that node
• Datagram
—No call setup phase
• Better if few packets
—More flexible
• Routing can be used to avoid congested parts of the
network
Circuit v Packet Switching
• Performance
—Propagation delay
—Transmission time
—Node delay
Problem
(a) What are “loss-intolerant” applications? Give an example of a loss-intolerant
Internet application.
•Applications that don’t tolerate loss of data. Example; Email, File transfer,
Web.
(b) What are “delay intolerant” applications? Give an example of a delay-
intolerant Internet application.
•Applications that don’t tolerate delay in data delivery. Example; Internet
telephony, video conferencing, etc.
(c) Based on your comparative analysis in Question 1, does the Internet
adequately support loss-intolerant applications? And delay-intolerant
applications? Explain. (2pts)
•The Internet was designed to support loss-intolerant applications but was not
designed to support delay-intolerant applications properly.
•This is because, the Internet, as a packet switching network, cannot provide
delay bound guarantees.
Problem
• Question 3 (6 points) Consider an Internet application running on two
Internet hosts, Host1 and Host2, which are communicating using a path
through router R. Assume that the average service time at R is 10 ms,
packets are 2,000 bits long, and the propagation delay between Host1 and
Host2 is 150ms.
• (a) Based on the latency expression we covered in class, how is service
time defined?
• Write the mathematical expression for it explaining its terms.
The service delay is the sum of the delays for processing and queueing.
• Processing: checking bit errors, determining output link
• Queueing: waiting for output link availability
• Total delay = processing + queue + transmission + propagation
• Service time = processing + queue
Problem
• (b) If the application running on Host1 and Host2 cannot
tolerate latencies over 200ms, what is the minimum capacity
of the link connecting the two hosts? Show your work.