Switching Techniques in Computer Networks: Circuit, Message & Packet Switching

COMPUTER NETWORKS • CHAPTER 7
Switching Techniques in Computer Networks: Circuit, Message & Packet Switching

When two computers communicate over a large network, they are usually not connected by one permanent direct cable. Data may have to pass through several intermediate devices before reaching the destination.

The process used to move communication from one network link to another is called switching. The three classic switching techniques are Circuit Switching, Message Switching and Packet Switching.

Instead of memorizing their definitions, we will understand one main question: “When data reaches an intermediate switching node, what exactly does that node do with it?”

✓
Direct Answer

Switching is the method used to transfer data from a source to a destination through intermediate network nodes and communication links.

Circuit Switching establishes a dedicated communication path before data transfer.

Message Switching stores and forwards the complete message at every intermediate node.

Packet Switching divides the message into smaller packets and forwards those packets through the network.

What Is Switching in Computer Networks?

Switching Techniques in Computer Networks: Circuit, Message & Packet Switching

Suppose Computer A wants to communicate with Computer B.

If both computers were directly connected, communication would be simple.

But a large network may contain thousands or millions of devices. Creating a separate physical cable between every pair of computers would be impractical.

Instead, networks contain intermediate devices called switching nodes.

Basic Switching Concept
💻 Source
🔀 Switching Node
🔀 Switching Node
🖥️ Destination
Simple Definition: Switching is the process of selecting or using communication paths through intermediate nodes so that data can travel from source to destination.

Why Do Computer Networks Need Switching?

Imagine a network containing 100 devices.

If every device needed a separate physical connection to every other device, the number of required links would become enormous.

Switching allows many users to share network infrastructure efficiently.

🔗

Shared Network Links

Multiple users can communicate through common intermediate infrastructure.

📈

Scalability

Large numbers of devices can communicate without direct links between every pair.

🧭

Path Selection

Communication can travel through suitable intermediate nodes.

💰

Lower Infrastructure Cost

Shared network infrastructure reduces the need for dedicated physical connections between all devices.

What Is a Switching Node?

A switching node is an intermediate network device or system that receives data and forwards it toward another link or destination.

The exact behaviour depends on the switching technique.

Technique What the Intermediate Node Handles
Circuit Switching Maintains an already established communication circuit
Message Switching Stores the complete message before forwarding it
Packet Switching Receives and forwards individual packets

Types of Switching Techniques

Classification of Switching
Switching Techniques
☎️ Circuit Switching
📨 Message Switching
📦 Packet Switching

Circuit Switching

Circuit switching establishes a dedicated communication path between sender and receiver before actual data transfer begins.

Once the circuit is established, the reserved resources remain associated with that communication session until the connection is released.

Circuit Switching - Dedicated Path
Caller / Source
Switch A
Switch B
Switch C
Receiver
Reserved End-to-End Communication Circuit
Easy Idea: Circuit switching is like reserving a private road from source to destination before starting the journey.

Three Phases of Circuit Switching

1

Circuit Establishment

Before communication begins, the network creates an end-to-end circuit through intermediate switches.

2

Data Transfer

After the circuit is ready, data travels through the established path.

3

Circuit Release

When communication finishes, the reserved resources are released so they can be used by other connections.

How Circuit Switching Works

Suppose Device A wants to communicate with Device B.

  1. A connection request is sent through the switching network.
  2. Intermediate switches identify an available route.
  3. Communication resources are reserved along that route.
  4. An end-to-end circuit is established.
  5. Data starts flowing through the dedicated circuit.
  6. After communication finishes, the circuit is released.

Important Characteristic

Data normally follows the same established path throughout the communication session.

Resource Reservation in Circuit Switching

The important feature of circuit switching is resource reservation.

The network may reserve communication capacity for a connection.

This can provide predictable service, but it can also waste capacity when the user is temporarily silent.

Example: Imagine a traditional telephone conversation. Even when both people remain silent for five seconds, the established circuit remains reserved during that time.

How Can Capacity Be Divided?

Traditional circuit-switched systems can divide transmission resources using techniques such as:

  • Frequency Division Multiplexing (FDM) – different connections use different frequency ranges.
  • Time Division Multiplexing (TDM) – different connections use different repeating time slots.
FDM and TDM are multiplexing techniques. They help multiple circuits share a larger transmission medium while still reserving resources for individual connections.

Advantages of Circuit Switching

Advantages

  • Dedicated communication path
  • Predictable performance after setup
  • Reserved bandwidth or resources
  • No per-message routing decision during established communication
  • Suitable for continuous real-time communication
  • Low variation in delay after circuit establishment

Disadvantages

  • Connection setup takes time
  • Reserved capacity may remain unused during silence
  • Less efficient for bursty computer data
  • Circuit failure can interrupt communication
  • Resources are unavailable to other users while reserved

Circuit Switching Delay

Circuit switching usually includes a setup delay before useful data can be transmitted.

Simplified Circuit Switching Delay
Total Delay ≈ Setup Delay + Message Transmission Time + Propagation Delay

If a message contains M bits and the dedicated circuit operates at rate R bits/second, the message transmission time is approximately:

M / R

Message Switching

Message switching does not establish a dedicated circuit before communication.

Instead, the entire message is treated as one unit.

Each switching node receives the complete message, stores it temporarily, examines its destination information and then forwards it to the next node.

Message Switching - Whole Message Stored at Each Node
Source
MESSAGE
Switch A
STORE
Switch B
STORE
Destination
MESSAGE

Store-and-Forward in Message Switching

The term store-and-forward is extremely important.

Suppose a 10 MB message reaches Switch A.

Switch A does not immediately forward the first few bytes while the rest are still arriving.

In classic message switching:

  1. The complete message arrives.
  2. The message is stored in the switch's memory.
  3. The destination address is examined.
  4. The next path is selected.
  5. The complete message is transmitted to the next switching node.
Because the complete message must be stored, large messages require large storage buffers at switching nodes.

No Dedicated Path

Unlike circuit switching, message switching does not reserve a complete end-to-end path in advance.

A message can wait at an intermediate node until an outgoing link becomes available.

Advantages of Message Switching

  • No dedicated circuit required
  • Network links can be shared efficiently
  • Messages can wait when the next link is busy
  • Routing decisions can be made at intermediate nodes
  • Priority handling can be implemented
  • Large storage is required
  • Delay can be high
  • Not suitable for interactive real-time communication
  • The complete message must arrive before forwarding
  • Large messages can occupy buffers for a long time

Message Switching Delay

Suppose a complete message of M bits passes through N equal links.

Each link has transmission rate R bits/second.

Ignoring propagation, processing and queueing delays:

Message Switching Delay ≈ N × M / R

Why?

Because every switching node must receive the entire message before sending it across the next link.

Packet Switching

Packet switching solves one major weakness of message switching.

Instead of treating a complete large message as one unit, the message is divided into smaller units called packets.

Packet Switching - Smaller Units Move Through the Network
Source
Packet
Switch A
Packet
Switch B
Destination
Easy Idea: Packet switching is like breaking one large parcel into several smaller parcels that can move through a shared delivery network.

What Is Packetization?

Packetization is the process of dividing a large message or data stream into smaller packets before transmission.

One Message Divided Into Packets
Original Large Message
HEADER
DATA 1
HEADER
DATA 2
HEADER
DATA 3
HEADER
DATA 4

Why Divide Data Into Packets?

  • Smaller units are easier to store and forward.
  • Network resources can be shared between many users.
  • Packets from different users can be interleaved.
  • Packets can begin moving before the full original message has reached an intermediate node.
  • If data is lost, a smaller unit may need retransmission instead of the entire message, depending on the protocol.

How Packet Switching Works

1

Data Is Divided

The original data is divided into smaller packets.

2

Headers Are Added

Each packet receives control information required by the communication protocol.

3

Packets Enter the Network

Packets are transmitted through intermediate packet-switching devices.

4

Packets Are Forwarded

Each switching node forwards packets according to network forwarding information.

5

Destination Receives Packets

The receiving system processes the packets and higher-layer protocols may reconstruct the original data.

What Does a Packet Contain?

A packet is not made only of user data.

It also needs control information.

Packet Structure

HEADER
PAYLOAD / DATA

Headers may contain addresses, identifiers, sequence-related information and other protocol fields depending on the protocol.

Why Headers Are Needed

Network devices need control information to know how the packet should be handled and delivered.

However, header bits also create overhead because they are not part of the original application data.

Datagram Packet Switching

In datagram packet switching, each packet is treated independently.

A complete end-to-end path does not have to be established before packets are sent.

Each packet carries enough addressing information for the network to forward it.

Datagram Network - Different Packets May Use Different Paths
Source
Router A
Router B
Router C
Router D
Destination

Important Characteristics

  • No connection setup is required at the packet-switching level.
  • Each packet is forwarded independently.
  • Packets may follow different routes.
  • Packets may experience different delays.
  • Packets can potentially arrive out of order.
Important Example: IP provides a datagram-style packet delivery service. Each IP packet is forwarded independently through interconnected networks.

Virtual Circuit Packet Switching

Virtual circuit packet switching combines some ideas of circuit-oriented communication with packet switching.

Before data transfer, a logical path is established through the packet network.

Packets then follow that logical path.

Virtual Circuit - Logical Path Established First
Source
Switch A
Switch B
Switch C
Destination
Logical Virtual Circuit

Virtual Circuit Phases

  1. Setup phase
  2. Packet transfer phase
  3. Connection release phase
Virtual Circuit Does Not Mean Dedicated Physical Circuit.

Packets still share network links with other traffic. The virtual circuit provides a logical path, not necessarily exclusive physical resources like traditional circuit switching.

Datagram vs Virtual Circuit Packet Switching

Datagram Virtual Circuit
No connection setup required at packet-switching level Logical path setup occurs before data transfer
Packets are handled independently Packets follow the established logical path
Packets may take different routes Packets normally follow the same virtual circuit
Packets may arrive out of order Ordering is easier to preserve within the chosen path
Routing/forwarding decision can be based on destination address Packets may use a shorter virtual-circuit identifier after setup
Example concept: IP datagram forwarding Seen in virtual-circuit-oriented packet technologies

Packet Pipelining

One important advantage of dividing data into packets is pipelining.

An intermediate node does not need to wait for the entire original message before forwarding the first packet.

Once Packet 1 has been received and forwarded, the next packet can follow behind it.

Simplified Packet Pipeline
Stage
Time 1
Time 2
Time 3
Time 4
Link 1
P1
P2
P3
Link 2
P1
P2
P3
Link 3
P1
P2
Key Point: Packetization allows different links to work on different packets at the same time. This can reduce total delivery time compared with forwarding one huge message as a single unit.

Packet Switching Delay

Suppose:

  • Message is divided into P equal packets.
  • Each packet contains L bits.
  • The path contains N links.
  • Every link has transmission rate R.

Ignoring propagation, queueing, processing and header overhead, store-and-forward packet switching with pipelining requires approximately:

Total Time = (N + P − 1) × L / R

Why N + P − 1?

The first packet requires transmission over all N links.

After the pipeline is full, every additional packet arrives approximately one packet-transmission time later.

Solved Switching Delay Example

Suppose:

  • Total message = 12,000 bits
  • Number of links = 3
  • Link rate = 1 Mbps
  • Ignore propagation, processing and queueing delay

Case 1: Message Switching

3 × 12,000 / 1,000,000

= 0.036 seconds

= 36 ms

Case 2: Packet Switching

Divide the message into 3 packets of 4,000 bits each.

P = 3

N = 3

L/R = 4,000 / 1,000,000

= 4 ms

(3 + 3 − 1) × 4 ms

= 5 × 4 ms

= 20 ms

Case 3: Circuit Switching

Assume circuit setup time = 10 ms.

Message transmission time:

12,000 / 1,000,000 = 12 ms

10 ms + 12 ms = 22 ms
These simplified calculations ignore propagation, processing, queueing, protocol headers and other real-network delays. They are useful for understanding the basic switching concepts.

Effect of Packet Size on Packet Switching

Students often assume that making packets as small as possible is always better.

It is not that simple.

Very Large Packets

HEADER
LARGE PAYLOAD
  • Lower relative header overhead
  • Longer transmission time per packet
  • One packet may occupy a link for longer
  • Retransmission can waste more data if a large packet is lost

Very Small Packets

HEADER
DATA
  • Better fine-grained sharing of links
  • Smaller individual transmission times
  • More packets are needed
  • Header overhead becomes larger relative to useful data
Design Trade-Off: Packet size balances efficiency, delay, overhead and error-recovery requirements.

Advantages of Packet Switching

  • Efficient use of network links
  • No dedicated physical circuit required
  • Suitable for bursty computer traffic
  • Multiple users can share the same links
  • Packets can be dynamically forwarded
  • Alternative paths may be possible
  • Supports scalable data networks

Limitations

  • Queueing delay can vary
  • Packets may be lost during congestion
  • Datagrams can arrive out of order
  • Every packet requires control information
  • Delay variation can affect real-time applications
  • Network devices need buffers and forwarding logic

Circuit vs Message vs Packet Switching

Feature Circuit Switching Message Switching Packet Switching
Dedicated Path Yes, logical/physical circuit resources reserved No No dedicated physical circuit in normal packet switching
Setup Required Yes No Datagram: No
Virtual Circuit: Yes
Data Unit Continuous data stream / circuit Complete message Packet
Store-and-Forward Not for the whole data unit in the same way Entire message Usually individual packet
Resource Reservation Yes No Generally shared; depends on network technology
Buffer Requirement Relatively low for complete-message storage High Smaller packet buffers
Delay Setup delay first, predictable afterward Can be very high Variable due to queueing
Link Utilization Can be inefficient during idle periods Better sharing Efficient statistical sharing
Real-Time Suitability Traditionally good Poor Good when network and protocols control delay/QoS properly
Typical Historical Example Traditional telephone network Store-and-forward telegraph/message systems Modern computer data networks

Connection-Oriented vs Connectionless Switching Idea

Switching techniques are often easier to understand when we connect them with connection-oriented and connectionless communication.

CONNECTION-ORIENTED

Path or Connection Established

A logical relationship is established before normal data transfer.

Circuit switching and virtual-circuit packet switching have connection-oriented characteristics.

CONNECTIONLESS

Packets Sent Independently

No dedicated connection setup is required before each datagram is sent.

Datagram packet switching follows this model.

How Network Resources Are Used

Circuit

Reserved Capacity

Resources remain associated with a connection even when no useful data is being transmitted.

Message

Whole-Message Sharing

Links are shared, but the entire message occupies storage and transmission resources at each stage.

Packet

Statistical Sharing

Packets from different users can share communication links dynamically according to traffic demand.

Switching vs Routing

Students sometimes use switching and routing as if they mean exactly the same thing.

They are related but not identical.

Switching Routing
General process of moving data between links/nodes Process of determining paths through interconnected networks
Can refer to circuit, message or packet switching Mainly associated with network-layer packet forwarding decisions
May operate at different communication levels Uses network topology and routing information
Broad networking concept Specific path-selection and forwarding concept
Also do not confuse: “Switching techniques” such as Circuit, Message and Packet Switching are broader communication methods. An Ethernet switch is a specific LAN networking device.

What Happens If a Link Fails?

Circuit Switching

If a link forming the established circuit fails, the connection may be interrupted and a new circuit may need to be established.

Message Switching

Because no dedicated path is fixed, a stored message may potentially be forwarded through another available route if the network supports such routing.

Packet Switching

Datagram networks can often route future packets through another available path when routing information changes.

This flexibility is one reason packet switching works well for large interconnected data networks.

Switching and Network Congestion

Packet and message switching share links among many users.

If packets arrive at a switching node faster than the outgoing link can transmit them, they must wait in buffers.

This creates queueing delay.

If buffers become full, packets may be discarded.

Circuit switching avoids this type of packet queue competition after resources are successfully reserved, but it pays for that predictability by reserving capacity in advance.

Real-Life Applications and Examples

☎️

Traditional Telephone Network

Classic telephone systems are a standard example used to explain circuit switching.

📨

Historical Store-and-Forward Systems

Message switching concepts were used in older communication systems in which complete messages were stored before forwarding.

🌐

Internet Data

Modern Internet communication is based primarily on packet-switched networking using IP packets.

💬

Messaging Applications

Application messages ultimately travel through packet-switched IP networks.

🎥

Video Streaming

Video data is transmitted as packets across shared IP networks rather than using one exclusive traditional physical circuit.

🎮

Online Gaming

Game updates and real-time communication are carried through packet-switched networks.

Which Switching Technique Should Be Used?

No switching technique is best for every possible communication system.

Requirement Suitable Concept Reason
Dedicated predictable communication resources Circuit Switching Resources are reserved before transfer
Complete-message store-and-forward Message Switching Entire message is stored at intermediate nodes
Efficient shared computer-data network Packet Switching Users dynamically share links
No packet-network setup before sending Datagram Switching Packets are independently forwarded
Logical path before packet transfer Virtual Circuit Packets follow a pre-established logical route

Best Real-Life Analogy for All Three Switching Techniques

CIRCUIT

Reserved Railway Track

Imagine reserving an entire route for your train before the journey starts. Once reserved, the route remains dedicated to your journey.

MESSAGE

One Large Parcel

A huge parcel reaches one warehouse completely, waits there, and then the complete parcel is sent to the next warehouse.

PACKET

Many Small Parcels

One shipment is divided into smaller parcels. Different parcels can move through the delivery network efficiently and may even use different routes.

Common Student Mistakes

Mistake 1: Circuit switching sends packets through different routes.

Traditional circuit switching first establishes a dedicated route and communication follows that established circuit.

Mistake 2: Message switching divides every message into small packets.

Message switching treats the complete message as the store-and-forward unit.

Mistake 3: Packet switching always requires a connection setup.

Datagram packet switching does not require a virtual-circuit setup. Virtual-circuit packet switching does.

Mistake 4: Virtual circuit is exactly the same as circuit switching.

A virtual circuit establishes a logical packet path, but packets may still share physical links with other traffic.

Mistake 5: Packets always follow different paths.

Datagram packets may follow different paths, but virtual-circuit packets normally follow the established logical route.

Mistake 6: Packet switching has no delay.

Packets can experience processing, queueing, transmission and propagation delay.

Mistake 7: Small packets have no disadvantage.

Smaller packets increase the number of headers and therefore increase protocol overhead.

Mistake 8: Circuit switching always has the lowest total delay.

A circuit requires setup time. Whether it gives lower total delay depends on session length, data amount, path characteristics and network conditions.

Easy Memory Tricks

Circuit = Reserve First, Send Later
Message = Store Whole Message, Then Forward
Packet = Break Message, Share Network
Datagram = Every Packet Independent
Virtual Circuit = Logical Path First
Packetization = Large Data → Small Packets

Switching Techniques Quick Revision Notes

  • Switching helps data move through intermediate network nodes.
  • The three classic switching techniques are circuit, message and packet switching.
  • Circuit switching establishes a dedicated path before data transfer.
  • Circuit switching has setup, data-transfer and release phases.
  • Resources are reserved during a circuit-switched connection.
  • Traditional telephone systems are common circuit-switching examples.
  • Message switching does not reserve a dedicated path.
  • Message switching stores the complete message at each intermediate node.
  • Message switching therefore requires large storage buffers.
  • Packet switching divides data into packets.
  • Each packet contains control information plus payload.
  • Packet switching allows network links to be shared dynamically.
  • Datagram switching handles each packet independently.
  • Datagram packets may follow different paths.
  • Virtual circuit switching establishes a logical path first.
  • A virtual circuit is not the same as a dedicated physical circuit.
  • Packet pipelining improves transmission efficiency across multiple links.
  • Smaller packets reduce individual transmission time but increase header overhead.
  • Large packets have lower relative header overhead but occupy links for longer periods.
  • Message switching has higher store-and-forward delay for large messages.
  • Packet switching is well suited to bursty computer-data communication.
  • The Internet is fundamentally packet switched.
  • Queueing delay can occur when packet traffic exceeds immediate link capacity.
  • Switching and routing are related but different concepts.

Important Switching Techniques Exam Questions

Very Short Answer Questions

1. Define switching.
2. What is a switching node?
3. Name the three basic switching techniques.
4. Define circuit switching.
5. What is circuit establishment?
6. What is circuit release?
7. Define message switching.
8. What is store-and-forward?
9. Define packet switching.
10. What is packetization?
11. What is a packet header?
12. What is a datagram network?
13. What is a virtual circuit?
14. What is packet pipelining?
15. What is packet overhead?
16. Which switching technique reserves resources?
17. Which switching technique stores the complete message?
18. Which switching technique divides information into packets?

Short Answer Questions

19. Why is switching required in computer networks?
20. Explain the three phases of circuit switching.
21. Explain how circuit switching works.
22. Write advantages and disadvantages of circuit switching.
23. Explain resource reservation in circuit switching.
24. Explain message switching with an example.
25. Explain store-and-forward operation in message switching.
26. Write advantages and disadvantages of message switching.
27. Explain packet switching.
28. Explain packetization.
29. Write advantages and disadvantages of packet switching.
30. Explain datagram packet switching.
31. Explain virtual circuit packet switching.
32. Differentiate between datagram and virtual circuit switching.
33. Explain packet pipelining.
34. Explain the effect of packet size on network performance.
35. Differentiate between switching and routing.

Long Answer Questions

36. Explain circuit, message and packet switching with suitable diagrams.
37. Compare circuit switching, message switching and packet switching.
38. Explain circuit switching with phases, advantages, disadvantages and delay.
39. Explain message switching and its store-and-forward operation in detail.
40. Explain packet switching with packetization, forwarding and reassembly.
41. Explain datagram and virtual-circuit packet switching in detail.
42. Discuss packet header overhead and packet-size trade-offs.
43. Explain why packet switching is suitable for computer networks.
44. Explain congestion and queueing in packet-switched networks.
45. Compare connection-oriented and connectionless packet switching.

Numerical / Analytical Questions

46. A 15,000-bit message travels through four 1 Mbps links using message switching. Ignoring all other delays, calculate the total transmission time.
47. A 12,000-bit message is divided into three 4,000-bit packets and sent through three 1 Mbps links. Calculate the packet-switching transmission time using pipelining.
48. A circuit requires 20 ms setup time and then transmits a 20,000-bit message over a 2 Mbps circuit. Calculate the simplified total delay, ignoring propagation.
49. Explain why packet switching can transmit a large message faster than message switching across multiple equal links.
50. A network designer must support bursty web traffic from thousands of users. Which switching concept is appropriate and why?

Switching Techniques MCQs With Answers

1. Which switching technique establishes a dedicated path?

A. Message Switching
B. Circuit Switching
C. Datagram Switching
D. Broadcasting

Answer: B
2. Circuit switching begins with:

A. Packet loss
B. Circuit establishment
C. Message fragmentation
D. Queue deletion

Answer: B
3. Which switching technique stores the entire message?

A. Message Switching
B. Circuit Switching
C. Frequency Switching
D. Optical Switching Only

Answer: A
4. Message switching uses:

A. Store-and-forward
B. Dedicated circuit only
C. No storage
D. No addresses

Answer: A
5. Packet switching divides a message into:

A. Circuits
B. Packets
C. Frequencies only
D. Telephone lines

Answer: B
6. Which method is suitable for bursty computer traffic?

A. Packet Switching
B. Permanent Circuit Only
C. Message Switching Only
D. None

Answer: A
7. Which packet-switching method handles each packet independently?

A. Datagram
B. Circuit
C. TDM
D. Message

Answer: A
8. Which packet-switching method establishes a logical path first?

A. Datagram
B. Virtual Circuit
C. Broadcast
D. Bus

Answer: B
9. Packets in a datagram network:

A. Must always follow the same path
B. May follow different paths
C. Need a dedicated physical circuit
D. Have no destination information

Answer: B
10. A virtual circuit is:

A. Always a dedicated physical cable
B. A logical packet path
C. A hard disk partition
D. A wireless antenna

Answer: B
11. Which technique may waste capacity during silent periods?

A. Circuit Switching
B. Datagram Switching
C. Packet Switching only
D. Message Switching only

Answer: A
12. Which switching method requires the largest whole-message storage?

A. Message Switching
B. Circuit Switching
C. Datagram Routing
D. Physical Switching

Answer: A
13. Packet header is used for:

A. Control information
B. Monitor display
C. Keyboard input only
D. Power supply

Answer: A
14. Packet pipelining means:

A. Multiple links can work on different packets at the same time
B. Every packet waits for the whole message
C. A circuit is always reserved
D. Packets are never stored

Answer: A
15. Which network is the classic example of circuit switching?

A. Traditional Telephone Network
B. Modern Ethernet LAN only
C. Database
D. File System

Answer: A
16. Internet communication is mainly based on:

A. Packet Switching
B. Message Switching only
C. Dedicated telephone circuits only
D. No switching

Answer: A
17. Which technique normally does not require a packet-level setup?

A. Datagram Switching
B. Virtual Circuit
C. Circuit Switching
D. None

Answer: A
18. Which problem can occur in packet switching during heavy traffic?

A. Queueing delay
B. Infinite reserved capacity
C. Zero packet headers
D. No sharing

Answer: A
19. Smaller packets generally create:

A. More relative header overhead
B. No headers
C. Dedicated circuits
D. Infinite bandwidth

Answer: A
20. The complete-message unit is used in:

A. Message Switching
B. Packet Switching
C. Circuit Setup only
D. Frequency Division only

Answer: A

Frequently Asked Questions

What is switching in computer networks?

Switching is the process used to move data from a source to a destination through intermediate network nodes and communication links.

What are the three main switching techniques?

The three classic switching techniques are Circuit Switching, Message Switching and Packet Switching.

What is circuit switching?

Circuit switching establishes and reserves an end-to-end communication path before data transmission begins.

What is message switching?

Message switching stores the complete message at each intermediate node before forwarding it toward the destination.

What is packet switching?

Packet switching divides data into smaller packets that are forwarded through shared network links.

What is the difference between message switching and packet switching?

Message switching stores and forwards the entire message as one unit, while packet switching divides the message into smaller packets that can be forwarded separately.

What are the two types of packet switching?

The two major forms are datagram packet switching and virtual-circuit packet switching.

What is datagram switching?

Datagram switching treats each packet independently, so different packets may follow different routes through the network.

What is virtual circuit switching?

Virtual-circuit switching establishes a logical path before packet transfer, after which packets normally follow that logical path.

Why is packet switching used for the Internet?

Packet switching allows many users to share network links efficiently, handles bursty traffic well and supports large interconnected networks.

Which switching technique is best?

The appropriate technique depends on the communication requirements. Circuit switching provides reserved resources, message switching stores whole messages, while packet switching provides efficient link sharing for modern data networks.

Conclusion

Switching techniques explain how information travels through a network containing intermediate communication nodes.

In Circuit Switching, an end-to-end path is established before useful data transmission begins. Resources remain reserved until the communication ends.

In Message Switching, there is no dedicated circuit. Instead, the entire message is stored at every intermediate switching node and then forwarded to the next node.

In Packet Switching, the original data is divided into smaller packets. This makes it possible for multiple users to share the same network links efficiently and enables packet pipelining.

Packet switching has two important forms:

Datagram = packets are handled independently.
Virtual Circuit = a logical route is established first.

The easiest way to remember the complete chapter is:

Circuit = Reserve Path
Message = Store Whole Message
Packet = Divide and Share

Once switching becomes clear, concepts such as routing, congestion, TCP/IP and Internet communication become much easier to understand.

Next Chapter: Chapter 8 – ISDN in Computer Networks: Architecture, Channels, Services & Interfaces Explained

Post a Comment

0 Comments
* Please Don't Spam Here. All the Comments are Reviewed by Admin.
Join Telegram Exam updates and free resources