Scribd
Upload
68 views25 pages

10 Circuit Packet 1

1. Circuit switching delay is 0.432 seconds, which includes call setup time and propagation delays across 4 hops. 2. Virtual circuit packet switching delay is 0.432 seconds, same as circuit switching since it establishes a virtual circuit. 3. Datagram packet switching delay is 0.416 seconds, which is faster than circuit/virtual circuit since it doesn't require call setup.

Uploaded by

memo1023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
68 views25 pages

10 Circuit Packet 1

1. Circuit switching delay is 0.432 seconds, which includes call setup time and propagation delays across 4 hops. 2. Virtual circuit packet switching delay is 0.432 seconds, same as circuit switching since it establishes a virtual circuit. 3. Datagram packet switching delay is 0.416 seconds, which is faster than circuit/virtual circuit since it doesn't require call setup.

Uploaded by

memo1023
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 25

Data and Computer

Communications
Chapter 10 – Circuit Switching and
Packet Switching

Eighth Edition
by William Stallings

Lecture slides by Lawrie Brown


Switched Network
Nodes
 a collection of nodes and connections is a
communications network
 nodes may connect to other nodes only, or to
stations and other nodes
 network is usually partially connected
 some redundant connections are desirable
 have two different switching technologies
 circuit switching

 packet switching
Circuit Switching
 uses a dedicated path between two stations
 has three phases
 establish
 transfer
 disconnect
 inefficient
 channel capacity dedicated for duration of connection
 if no data, capacity wasted
 set up (connection) takes time
 once connected, transfer is transparent
Public Circuit Switched
Network
Circuit Establishment
Circuit
Switch
Elements
Blocking or Non-blocking
 blocking network
 may be unable to connect stations because
all paths are in use
 used on voice systems
 non-blocking network
 permits all stations to connect at once
 used for some data connections
Space Division Switch
3 Stage Space Division Switch
Time Division Switching
 modern digital systems use intelligent
control of space & time division elements
 use digital time division techniques to set
up and maintain virtual circuits
 partition low speed bit stream into pieces
that share higher speed stream
 individual pieces manipulated by control
logic to flow from input to output
Softswitch
Traditional Circuit Switching
Packet Switching
 circuit switching was designed for voice
 packet switching was designed for data
 transmitted in small packets
 packets contains user data and control info
 user data may be part of a larger message
 control info includes routing (addressing) info
 packets are received, stored briefly (buffered)
and past on to the next node
Packet Switching
Advantages
 line efficiency
 single link shared by many packets over time
 packets queued and transmitted as fast as possible
 data rate conversion
 stations connects to local node at own speed
 nodes buffer data if required to equalize rates
 packets accepted even when network is busy
 priorities can be used
Switching Techniques
 station breaks long message into packets
 packets sent one at a time to the network
 packets can be handled in two ways
 datagram
 virtual circuit
Datagram
Diagram
Virtual
Circuit
Diagram
Virtual Circuits v Datagram
 virtual circuits
 network can provide sequencing and error
control
 packets are forwarded more quickly
 less reliable
 datagram
 no call setup phase
 more flexible
 more reliable
Packet
Size
Circuit v Packet Switching
 performance depends on various delays
 propagation delay
 transmission time
 node delay
 range of other characteristics, including:
 transparency
 amount of overhead
Event Timing
Comparison of
communication
switching
techniques
Given the following
N=number of hopes between two end system
L=Message length in bits
B= Link speed in Bps,on all links
P=fixed packet size in Bits
H=Overheads(Header) ,Bits per Packet
S=Call setup Time ,in seconds
D=Propagation Delay per Hop in seconds
For N=4,L=3200,B=9600,P=1024,H=16,S=0.2,D=0.001, Ignore processing delays
Compute the end to end Delay for
1-Circuit Switching
2-Virtual circuit Packet switching
3-Datagram Packet switching

You might also like