SlideShare a Scribd company logo
1 of 47
8.1
Chapter 8
Switching
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
8.2
A switched network consists of a series of
interlinked nodes, called switches.
Switches are devices capable of creating temporary
connections between two or more devices linked to
the switch.
8.2
Switching
8.3
Figure 8.1 Switched network
8.4
Figure 8.2 Taxonomy of switched networks
8.5
8-1 CIRCUIT-SWITCHED NETWORKS8-1 CIRCUIT-SWITCHED NETWORKS
A circuit-switched network consists of a set of switchesA circuit-switched network consists of a set of switches
connected by physical links. A connection between twoconnected by physical links. A connection between two
stations is a dedicated path made of one or more links.stations is a dedicated path made of one or more links.
However, each connection uses only one dedicatedHowever, each connection uses only one dedicated
channel on each link. Each link is normally dividedchannel on each link. Each link is normally divided
into n channels by using FDM or TDM.into n channels by using FDM or TDM.
Three Phases
Efficiency
Delay
Circuit-Switched Technology in Telephone Networks
Topics discussed in this section:Topics discussed in this section:
8.6
A circuit-switched network is made of a
set of switches connected by physical
links, in which each link is
divided into n channels.
Note
8.7
Figure 8.3 A trivial circuit-switched network
8.8
In circuit switching, the resources need
to be reserved during the setup phase;
the resources remain dedicated for the
entire duration of data transfer until the
teardown phase.
Note
8.9
As a trivial example, let us use a circuit-switched network
to connect eight telephones in a small area.
Communication is through 4-kHz voice channels. We
assume that each link uses FDM to connect a maximum
of two voice channels. The bandwidth of each link is then
8 kHz. Figure 8.4 shows the situation. Telephone 1 is
connected to telephone 7; 2 to 5; 3 to 8; and 4 to 6. Of
course the situation may change when new connections
are made. The switch controls the connections.
Example 8.1
8.10
Figure 8.4 Circuit-switched network used in Example 8.1
8.11
As another example, consider a circuit-switched network
that connects computers in two remote offices of a private
company. The offices are connected using a T-1 line
leased from a communication service provider. There are
two 4 × 8 (4 inputs and 8 outputs) switches in this
network. For each switch, four output ports are folded
into the input ports to allow communication between
computers in the same office. Four other output ports
allow communication between the two offices. Figure 8.5
shows the situation.
Example 8.2
8.12
Figure 8.5 Circuit-switched network used in Example 8.2
8.13
Figure 8.6 Delay in a circuit-switched network
8.14
Switching at the physical layer in the
traditional telephone network uses
the circuit-switching approach.
Note
8.15
8-2 DATAGRAM NETWORKS8-2 DATAGRAM NETWORKS
In data communications, we need to send messagesIn data communications, we need to send messages
from one end system to another. If the message isfrom one end system to another. If the message is
going to pass through a packet-switched network, itgoing to pass through a packet-switched network, it
needs to be divided into packets of fixed or variableneeds to be divided into packets of fixed or variable
size. The size of the packet is determined by thesize. The size of the packet is determined by the
network and the governing protocol.network and the governing protocol.
Routing Table
Efficiency
Delay
Datagram Networks in the Internet
Topics discussed in this section:Topics discussed in this section:
8.16
In a packet-switched network, there
is no resource reservation;
resources are allocated on demand.
Note
8.17
Figure 8.7 A datagram network with four switches (routers)
8.18
Figure 8.8 Routing table in a datagram network
8.19
A switch in a datagram network uses a
routing table that is based on the
destination address.
Note
8.20
The destination address in the header of
a packet in a datagram network
remains the same during the entire
journey of the packet.
Note
8.21
Figure 8.9 Delay in a datagram network
8.22
Switching in the Internet is done by
using the datagram approach
to packet switching at
the network layer.
Note
8.23
8-3 VIRTUAL-CIRCUIT NETWORKS8-3 VIRTUAL-CIRCUIT NETWORKS
A virtual-circuit network is a cross between a circuit-A virtual-circuit network is a cross between a circuit-
switched network and a datagram network. It hasswitched network and a datagram network. It has
some characteristics of both.some characteristics of both.
Addressing
Three Phases
Efficiency
Delay
Circuit-Switched Technology in WANs
Topics discussed in this section:Topics discussed in this section:
8.24
Figure 8.10 Virtual-circuit network
8.25
Figure 8.11 Virtual-circuit identifier
8.26
Figure 8.12 Switch and tables in a virtual-circuit network
8.27
Figure 8.13 Source-to-destination data transfer in a virtual-circuit network
8.28
Figure 8.14 Setup request in a virtual-circuit network
8.29
Figure 8.15 Setup acknowledgment in a virtual-circuit network
8.30
In virtual-circuit switching, all packets
belonging to the same source and
destination travel the same path;
but the packets may arrive at the
destination with different delays
if resource allocation is on demand.
Note
8.31
Figure 8.16 Delay in a virtual-circuit network
8.32
Switching at the data link layer in a
switched WAN is normally
implemented by using
virtual-circuit techniques.
Note
8.33
8-4 STRUCTURE OF A SWITCH8-4 STRUCTURE OF A SWITCH
We use switches in circuit-switched and packet-We use switches in circuit-switched and packet-
switched networks. In this section, we discuss theswitched networks. In this section, we discuss the
structures of the switches used in each type ofstructures of the switches used in each type of
network.network.
Structure of Circuit Switches
Structure of Packet Switches
Topics discussed in this section:Topics discussed in this section:
8.34
Figure 8.17 Crossbar switch with three inputs and four outputs
8.35
Figure 8.18 Multistage switch
8.36
In a three-stage switch, the total
number of crosspoints is
2kN + k(N/n)2
which is much smaller than the number of
crosspoints in a single-stage switch (N2
).
Note
8.37
Design a three-stage, 200 × 200 switch (N = 200) with
k = 4 and n = 20.
Solution
In the first stage we have N/n or 10 crossbars, each of size
20 × 4. In the second stage, we have 4 crossbars, each of
size 10 × 10. In the third stage, we have 10 crossbars,
each of size 4 × 20. The total number of crosspoints is
2kN + k(N/n)2
, or 2000 crosspoints. This is 5 percent of
the number of crosspoints in a single-stage switch (200 ×
200 = 40,000).
Example 8.3
8.38
According to the Clos criterion:
n = (N/2)1/2
k > 2n – 1
Crosspoints ≥ 4N [(2N)1/2
– 1]
Note
8.39
Redesign the previous three-stage, 200 × 200 switch,
using the Clos criteria with a minimum number of
crosspoints.
Solution
We let n = (200/2)1/2
, or n = 10. We calculate k = 2n 1 =−
19. In the first stage, we have 200/10, or 20, crossbars,
each with 10 × 19 crosspoints. In the second stage, we
have 19 crossbars, each with 10 × 10 crosspoints. In the
third stage, we have 20 crossbars each with 19 × 10
crosspoints. The total number of crosspoints is 20(10 ×
19) + 19(10 × 10) + 20(19 ×10) = 9500.
Example 8.4
8.40
Figure 8.19 Time-slot interchange
8.41
Figure 8.20 Time-space-time switch
8.42
Figure 8.21 Packet switch components
8.43
Figure 8.22 Input port
8.44
Figure 8.23 Output port
8.45
Figure 8.24 A banyan switch
8.46
Figure 8.25 Examples of routing in a banyan switch
8.47
Figure 8.26 Batcher-banyan switch

More Related Content

What's hot

Introduction to Data-Link Layer
Introduction to Data-Link LayerIntroduction to Data-Link Layer
Introduction to Data-Link Layer
Abdullaziz Tagawy
 
Chapter 2 - Network Models
Chapter 2 - Network ModelsChapter 2 - Network Models
Chapter 2 - Network Models
Wayne Jones Jnr
 
Network Hardware And Software
Network Hardware And SoftwareNetwork Hardware And Software
Network Hardware And Software
Steven Cahill
 

What's hot (20)

Lan technologies
Lan technologiesLan technologies
Lan technologies
 
Tcp IP Model
Tcp IP ModelTcp IP Model
Tcp IP Model
 
QOS (Quality of Services) - Computer Networks
 QOS (Quality of Services) - Computer Networks QOS (Quality of Services) - Computer Networks
QOS (Quality of Services) - Computer Networks
 
Switching
Switching Switching
Switching
 
Introduction to Data-Link Layer
Introduction to Data-Link LayerIntroduction to Data-Link Layer
Introduction to Data-Link Layer
 
TCP/IP
TCP/IPTCP/IP
TCP/IP
 
Osi , tcp/ip protocol and Addressing
Osi , tcp/ip protocol and Addressing Osi , tcp/ip protocol and Addressing
Osi , tcp/ip protocol and Addressing
 
Quality of Service
Quality of ServiceQuality of Service
Quality of Service
 
Transport layer
Transport layer Transport layer
Transport layer
 
Tcp/ip model
Tcp/ip  modelTcp/ip  model
Tcp/ip model
 
IEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and ServicesIEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and Services
 
Routing algorithm
Routing algorithmRouting algorithm
Routing algorithm
 
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESS
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSComputer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESS
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESS
 
Chapter 2 - Network Models
Chapter 2 - Network ModelsChapter 2 - Network Models
Chapter 2 - Network Models
 
Quality of service
Quality of serviceQuality of service
Quality of service
 
Unit 1 introduction to computer networks
Unit 1  introduction to computer networksUnit 1  introduction to computer networks
Unit 1 introduction to computer networks
 
Switching Concepts presentation
Switching Concepts presentationSwitching Concepts presentation
Switching Concepts presentation
 
Network Hardware And Software
Network Hardware And SoftwareNetwork Hardware And Software
Network Hardware And Software
 
Multiplexing
MultiplexingMultiplexing
Multiplexing
 
IPv4 Addressing
 IPv4 Addressing   IPv4 Addressing
IPv4 Addressing
 

Viewers also liked (9)

Chapter 3: Data & Signals
Chapter 3: Data & SignalsChapter 3: Data & Signals
Chapter 3: Data & Signals
 
Chapter 1: Introduction to Operating System
Chapter 1: Introduction to Operating SystemChapter 1: Introduction to Operating System
Chapter 1: Introduction to Operating System
 
Chapter 20: Internet Protocol
Chapter 20: Internet ProtocolChapter 20: Internet Protocol
Chapter 20: Internet Protocol
 
Chapter 1: Overview of Network Security
Chapter 1: Overview of Network SecurityChapter 1: Overview of Network Security
Chapter 1: Overview of Network Security
 
Chapter 2: Network Models
Chapter 2: Network ModelsChapter 2: Network Models
Chapter 2: Network Models
 
Chapter 19: Logical Addressing
Chapter 19: Logical AddressingChapter 19: Logical Addressing
Chapter 19: Logical Addressing
 
Chapter 7: Transmission Media
Chapter 7: Transmission MediaChapter 7: Transmission Media
Chapter 7: Transmission Media
 
15 lecture - acl part1, introduction to access control list
15   lecture  - acl part1, introduction to access control list15   lecture  - acl part1, introduction to access control list
15 lecture - acl part1, introduction to access control list
 
13 lecture - introduction and configuration of eigrp
13   lecture  - introduction and configuration of eigrp13   lecture  - introduction and configuration of eigrp
13 lecture - introduction and configuration of eigrp
 

Similar to Chapter 8: Switching

heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxvheloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
JOHN35307
 
2b switching in networks
2b switching in networks2b switching in networks
2b switching in networks
kavish dani
 
lecture2829atmframerelay-180429142508 (1).pptx
lecture2829atmframerelay-180429142508 (1).pptxlecture2829atmframerelay-180429142508 (1).pptx
lecture2829atmframerelay-180429142508 (1).pptx
AMITKUMAR938671
 

Similar to Chapter 8: Switching (20)

Ch08
Ch08Ch08
Ch08
 
Ch08
Ch08Ch08
Ch08
 
Chapter 8 switching -computer_network
Chapter 8   switching -computer_networkChapter 8   switching -computer_network
Chapter 8 switching -computer_network
 
08 Switching
08 Switching08 Switching
08 Switching
 
Ppt 01 10
Ppt 01 10Ppt 01 10
Ppt 01 10
 
Lecture-8 Data Communication ~www.fida.com.bd
Lecture-8 Data Communication ~www.fida.com.bdLecture-8 Data Communication ~www.fida.com.bd
Lecture-8 Data Communication ~www.fida.com.bd
 
heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxvheloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
heloo mzdnvnjbszdjgfjkhadsgvbxczvznxbvmcxv
 
Ch08
Ch08Ch08
Ch08
 
Chapter 8
Chapter 8Chapter 8
Chapter 8
 
Ch08
Ch08Ch08
Ch08
 
Data Communication and Computer Networks
Data Communication and Computer NetworksData Communication and Computer Networks
Data Communication and Computer Networks
 
Network switching
Network switchingNetwork switching
Network switching
 
08-Switching.ppt
08-Switching.ppt08-Switching.ppt
08-Switching.ppt
 
Swiching
SwichingSwiching
Swiching
 
Ch08
Ch08Ch08
Ch08
 
Unit_I - 5
Unit_I - 5Unit_I - 5
Unit_I - 5
 
Ch08
Ch08Ch08
Ch08
 
2b switching in networks
2b switching in networks2b switching in networks
2b switching in networks
 
lecture2829atmframerelay-180429142508 (1).pptx
lecture2829atmframerelay-180429142508 (1).pptxlecture2829atmframerelay-180429142508 (1).pptx
lecture2829atmframerelay-180429142508 (1).pptx
 
Switching
SwitchingSwitching
Switching
 

More from Shafaan Khaliq Bhatti

10 lecture - ospf part1 , introduction to ospf , areas and abr
10   lecture  - ospf part1 , introduction to ospf , areas and abr10   lecture  - ospf part1 , introduction to ospf , areas and abr
10 lecture - ospf part1 , introduction to ospf , areas and abr
Shafaan Khaliq Bhatti
 

More from Shafaan Khaliq Bhatti (20)

1- Introduction to Red Hat
1- Introduction to Red Hat1- Introduction to Red Hat
1- Introduction to Red Hat
 
Linux Servers
Linux ServersLinux Servers
Linux Servers
 
5 - Networking in Red Hat
5 - Networking in Red Hat5 - Networking in Red Hat
5 - Networking in Red Hat
 
2- System Initialization in Red Hat
2- System Initialization in Red Hat2- System Initialization in Red Hat
2- System Initialization in Red Hat
 
3 - Disk Partitioning in Red Hat
3 - Disk Partitioning in Red Hat3 - Disk Partitioning in Red Hat
3 - Disk Partitioning in Red Hat
 
6 - Package Management in Red Hat
6 - Package Management in Red Hat6 - Package Management in Red Hat
6 - Package Management in Red Hat
 
11 - SELinux in Red Hat
11 - SELinux in Red Hat11 - SELinux in Red Hat
11 - SELinux in Red Hat
 
7 - User Administration in Red Hat
7 - User Administration in Red Hat7 - User Administration in Red Hat
7 - User Administration in Red Hat
 
12 - System Security in Red Hat
12 - System Security in Red Hat12 - System Security in Red Hat
12 - System Security in Red Hat
 
10 lecture - ospf part1 , introduction to ospf , areas and abr
10   lecture  - ospf part1 , introduction to ospf , areas and abr10   lecture  - ospf part1 , introduction to ospf , areas and abr
10 lecture - ospf part1 , introduction to ospf , areas and abr
 
Message Authentication: MAC, Hashes
Message Authentication: MAC, HashesMessage Authentication: MAC, Hashes
Message Authentication: MAC, Hashes
 
Protocols for Public Key Management
Protocols for Public Key ManagementProtocols for Public Key Management
Protocols for Public Key Management
 
Authentication: keys, MAC
Authentication: keys, MACAuthentication: keys, MAC
Authentication: keys, MAC
 
Public key cryptography and RSA
Public key cryptography and RSAPublic key cryptography and RSA
Public key cryptography and RSA
 
Block Ciphers Modes of Operation
Block Ciphers Modes of OperationBlock Ciphers Modes of Operation
Block Ciphers Modes of Operation
 
Chapter 3: Block Ciphers and the Data Encryption Standard
Chapter 3: Block Ciphers and the Data Encryption StandardChapter 3: Block Ciphers and the Data Encryption Standard
Chapter 3: Block Ciphers and the Data Encryption Standard
 
Chapter 3: Processes
Chapter 3: ProcessesChapter 3: Processes
Chapter 3: Processes
 
Chapter 2: Operating System Structures
Chapter 2: Operating System StructuresChapter 2: Operating System Structures
Chapter 2: Operating System Structures
 
Classical Encryption
Classical EncryptionClassical Encryption
Classical Encryption
 
Chapter 01 (Discovering Computers)
Chapter 01 (Discovering Computers)Chapter 01 (Discovering Computers)
Chapter 01 (Discovering Computers)
 

Recently uploaded

Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
negromaestrong
 
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
 

Recently uploaded (20)

Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.
 
Asian American Pacific Islander Month DDSD 2024.pptx
Asian American Pacific Islander Month DDSD 2024.pptxAsian American Pacific Islander Month DDSD 2024.pptx
Asian American Pacific Islander Month DDSD 2024.pptx
 
Introduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsIntroduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The Basics
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptxDyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
 
Unit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptxUnit-V; Pricing (Pharma Marketing Management).pptx
Unit-V; Pricing (Pharma Marketing Management).pptx
 
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingGrant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
 
Seal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptxSeal of Good Local Governance (SGLG) 2024Final.pptx
Seal of Good Local Governance (SGLG) 2024Final.pptx
 
General Principles of Intellectual Property: Concepts of Intellectual Proper...
General Principles of Intellectual Property: Concepts of Intellectual  Proper...General Principles of Intellectual Property: Concepts of Intellectual  Proper...
General Principles of Intellectual Property: Concepts of Intellectual Proper...
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Spatium Project Simulation student brief
Spatium Project Simulation student briefSpatium Project Simulation student brief
Spatium Project Simulation student brief
 
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
 
PROCESS RECORDING FORMAT.docx
PROCESS      RECORDING        FORMAT.docxPROCESS      RECORDING        FORMAT.docx
PROCESS RECORDING FORMAT.docx
 
On National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan FellowsOn National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan Fellows
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdfFood safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdf
 

Chapter 8: Switching

  • 1. 8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
  • 2. 8.2 A switched network consists of a series of interlinked nodes, called switches. Switches are devices capable of creating temporary connections between two or more devices linked to the switch. 8.2 Switching
  • 4. 8.4 Figure 8.2 Taxonomy of switched networks
  • 5. 8.5 8-1 CIRCUIT-SWITCHED NETWORKS8-1 CIRCUIT-SWITCHED NETWORKS A circuit-switched network consists of a set of switchesA circuit-switched network consists of a set of switches connected by physical links. A connection between twoconnected by physical links. A connection between two stations is a dedicated path made of one or more links.stations is a dedicated path made of one or more links. However, each connection uses only one dedicatedHowever, each connection uses only one dedicated channel on each link. Each link is normally dividedchannel on each link. Each link is normally divided into n channels by using FDM or TDM.into n channels by using FDM or TDM. Three Phases Efficiency Delay Circuit-Switched Technology in Telephone Networks Topics discussed in this section:Topics discussed in this section:
  • 6. 8.6 A circuit-switched network is made of a set of switches connected by physical links, in which each link is divided into n channels. Note
  • 7. 8.7 Figure 8.3 A trivial circuit-switched network
  • 8. 8.8 In circuit switching, the resources need to be reserved during the setup phase; the resources remain dedicated for the entire duration of data transfer until the teardown phase. Note
  • 9. 8.9 As a trivial example, let us use a circuit-switched network to connect eight telephones in a small area. Communication is through 4-kHz voice channels. We assume that each link uses FDM to connect a maximum of two voice channels. The bandwidth of each link is then 8 kHz. Figure 8.4 shows the situation. Telephone 1 is connected to telephone 7; 2 to 5; 3 to 8; and 4 to 6. Of course the situation may change when new connections are made. The switch controls the connections. Example 8.1
  • 10. 8.10 Figure 8.4 Circuit-switched network used in Example 8.1
  • 11. 8.11 As another example, consider a circuit-switched network that connects computers in two remote offices of a private company. The offices are connected using a T-1 line leased from a communication service provider. There are two 4 × 8 (4 inputs and 8 outputs) switches in this network. For each switch, four output ports are folded into the input ports to allow communication between computers in the same office. Four other output ports allow communication between the two offices. Figure 8.5 shows the situation. Example 8.2
  • 12. 8.12 Figure 8.5 Circuit-switched network used in Example 8.2
  • 13. 8.13 Figure 8.6 Delay in a circuit-switched network
  • 14. 8.14 Switching at the physical layer in the traditional telephone network uses the circuit-switching approach. Note
  • 15. 8.15 8-2 DATAGRAM NETWORKS8-2 DATAGRAM NETWORKS In data communications, we need to send messagesIn data communications, we need to send messages from one end system to another. If the message isfrom one end system to another. If the message is going to pass through a packet-switched network, itgoing to pass through a packet-switched network, it needs to be divided into packets of fixed or variableneeds to be divided into packets of fixed or variable size. The size of the packet is determined by thesize. The size of the packet is determined by the network and the governing protocol.network and the governing protocol. Routing Table Efficiency Delay Datagram Networks in the Internet Topics discussed in this section:Topics discussed in this section:
  • 16. 8.16 In a packet-switched network, there is no resource reservation; resources are allocated on demand. Note
  • 17. 8.17 Figure 8.7 A datagram network with four switches (routers)
  • 18. 8.18 Figure 8.8 Routing table in a datagram network
  • 19. 8.19 A switch in a datagram network uses a routing table that is based on the destination address. Note
  • 20. 8.20 The destination address in the header of a packet in a datagram network remains the same during the entire journey of the packet. Note
  • 21. 8.21 Figure 8.9 Delay in a datagram network
  • 22. 8.22 Switching in the Internet is done by using the datagram approach to packet switching at the network layer. Note
  • 23. 8.23 8-3 VIRTUAL-CIRCUIT NETWORKS8-3 VIRTUAL-CIRCUIT NETWORKS A virtual-circuit network is a cross between a circuit-A virtual-circuit network is a cross between a circuit- switched network and a datagram network. It hasswitched network and a datagram network. It has some characteristics of both.some characteristics of both. Addressing Three Phases Efficiency Delay Circuit-Switched Technology in WANs Topics discussed in this section:Topics discussed in this section:
  • 26. 8.26 Figure 8.12 Switch and tables in a virtual-circuit network
  • 27. 8.27 Figure 8.13 Source-to-destination data transfer in a virtual-circuit network
  • 28. 8.28 Figure 8.14 Setup request in a virtual-circuit network
  • 29. 8.29 Figure 8.15 Setup acknowledgment in a virtual-circuit network
  • 30. 8.30 In virtual-circuit switching, all packets belonging to the same source and destination travel the same path; but the packets may arrive at the destination with different delays if resource allocation is on demand. Note
  • 31. 8.31 Figure 8.16 Delay in a virtual-circuit network
  • 32. 8.32 Switching at the data link layer in a switched WAN is normally implemented by using virtual-circuit techniques. Note
  • 33. 8.33 8-4 STRUCTURE OF A SWITCH8-4 STRUCTURE OF A SWITCH We use switches in circuit-switched and packet-We use switches in circuit-switched and packet- switched networks. In this section, we discuss theswitched networks. In this section, we discuss the structures of the switches used in each type ofstructures of the switches used in each type of network.network. Structure of Circuit Switches Structure of Packet Switches Topics discussed in this section:Topics discussed in this section:
  • 34. 8.34 Figure 8.17 Crossbar switch with three inputs and four outputs
  • 36. 8.36 In a three-stage switch, the total number of crosspoints is 2kN + k(N/n)2 which is much smaller than the number of crosspoints in a single-stage switch (N2 ). Note
  • 37. 8.37 Design a three-stage, 200 × 200 switch (N = 200) with k = 4 and n = 20. Solution In the first stage we have N/n or 10 crossbars, each of size 20 × 4. In the second stage, we have 4 crossbars, each of size 10 × 10. In the third stage, we have 10 crossbars, each of size 4 × 20. The total number of crosspoints is 2kN + k(N/n)2 , or 2000 crosspoints. This is 5 percent of the number of crosspoints in a single-stage switch (200 × 200 = 40,000). Example 8.3
  • 38. 8.38 According to the Clos criterion: n = (N/2)1/2 k > 2n – 1 Crosspoints ≥ 4N [(2N)1/2 – 1] Note
  • 39. 8.39 Redesign the previous three-stage, 200 × 200 switch, using the Clos criteria with a minimum number of crosspoints. Solution We let n = (200/2)1/2 , or n = 10. We calculate k = 2n 1 =− 19. In the first stage, we have 200/10, or 20, crossbars, each with 10 × 19 crosspoints. In the second stage, we have 19 crossbars, each with 10 × 10 crosspoints. In the third stage, we have 20 crossbars each with 19 × 10 crosspoints. The total number of crosspoints is 20(10 × 19) + 19(10 × 10) + 20(19 ×10) = 9500. Example 8.4
  • 42. 8.42 Figure 8.21 Packet switch components
  • 45. 8.45 Figure 8.24 A banyan switch
  • 46. 8.46 Figure 8.25 Examples of routing in a banyan switch