159.

334 Computer Networks

Introduction to 159.334 and OSI Model

Professor Richard Harris
School of Engineering and Advanced
Technology (SEAT)

Learning Objectives
159.334 Computer Networks

You will be able to:

Provide one definition of Switching and Computer Network

goals
Identify the major modes of data transport, namely; Circuit
Transport Mode, Packet Transport Mode and Message
Transport Mode
Describe the major characteristics of Circuit, Packet and
Message Switching
Describe the major network types namely; full mesh, partial
mesh, star and ring
Draw time sequence diagrams for the three classes of
switching services
Calculate an optimum packet size
Computer Networks - 1/2
1/2

References
159.334 Computer Networks

Forouzan, Data Communications and Networking, 4th

Edition
Tanenbaum, Computer Networks, 4th Edition
Cisco CCNA1 Module 10 - part 1
Stallings, William 2000 Data and Computer
Communications, Prentice Hall, Sixth Edition
Russell, Travis 1997 Telecommunications Protocols,
McGraw Hill

Computer Networks - 1/3

1/3

Paper Website
159.334 Computer Networks

http://www-ist.massey.ac.nz/159334

Computer Networks - 1/4

1/4

What are Switching Networks About?

159.334 Computer Networks

Switching Networks are about maximising connectivity

Minimising costs
Capital cost of Switching and Transmission equipment
Operational costs

Providing Quality of Service Flexibilities for todays

convergent services
In the past specific networks were designed and installed for specific
services. In todays fast changing service environment this approach is
too inflexible and costly.

Computer Networks - 1/5

1/5

The Switching Family

159.334 Computer Networks

Circuit
Transport
Mode
Plesiochronous
(Current PDH Systems)

Synchronous
SDH / SONET

Packet
Transport
Mode

Message
Transport Mode
Pony Express
Telegrams

X.25

Email

Frame Relay
Cell
Computer Networks - 1/6
1/6

The Switching Family

(Packet Switching Evolution)
159.334 Computer Networks

SNA
(IBMs System Network Architecture)
SDLC from SNA was refined
HDLC
X.25
ISDN LAPD

Fast Packet
Switching
Concept

DQDB (IEEE
802.6)

Frame Relay
X.25 adopted by
OSI as the first
link and Packet
Layer standard

SMDS
A leaner,
meaner LAPD

ATM

A MAN service
developed by
BellCore (based
on DQDB)
Computer Networks - 1/7
1/7

Revision of Network Structures

(A Fully Meshed Network)
159.334 Computer Networks

Class Exercise:
LE

LE

LE

LE

LE

Each node is connected

to all other nodes

How many new links are

required if we add a further
node to the fully meshed
network shown in the
diagram?
Develop a formula for the
number of links required when
there are n nodes.
What do you see as the
advantages and
disadvantages of a network
arranged in a fully meshed
fashion?
Computer Networks - 1/8
1/8

Revision of Network Structures

(A Star Network)
159.334 Computer Networks

Questions to consider:
LE

LE

LE

Switch

LE

LE

All nodes connect

to a central node

How many new links are

required if we add a further
node to the star network
shown in the previous
diagram?
Develop a formula for the
number of links required
when there are n nodes.
What do you see as the
advantages and
disadvantages of a network
arranged in a star fashion?
Computer Networks - 1/9
1/9

Revision of Network Structures

(A Ring Network SDH/SONET))
159.334 Computer Networks

E
E

Ring network

What do you see as the

advantages and disadvantages
of a network arranged in a ring
fashion?

Computer Networks - 1/10

1/10

Switching Types
159.334 Computer Networks

Circuit Switching (for Circuit Transfer Mode Systems)

A direct physical connection is made between the two
communicating parties. They have exclusive use of this
connection for the duration of the call.

Message Switching (for Message Transfer Mode

Systems)
A complete message is passed in a hop-a-long fashion
across a network. There is never a complete path between
the two communicating parties. The message is always in one
location in the network

Packet Switching (for Packet Transfer Mode Systems)

Similar to message switching except that the message is
broken up into smaller chunks (called packets). Parts of the
message may exist in many places in the network
Computer Networks - 1/11
1/11

Circuit Switching Illustrated

159.334 Computer Networks

B
Message
begins
here

D
C

Example:
Telephony

Characteristic
B
A

D
C

Call Setup
Phase

B
Message
Transfer
Phase

Call
Cleardown
Phase

D
C

A direct
physical
connection is
made
between the
two parties..
For the sole
use of those
parties

C
Computer Networks - 1/12
1/12

Circuit Switching Illustrated (Alternate

Routing in a Switching Hierarchy)
159.334 Computer Networks

Computer Networks - 1/13

1/13

Message Switching Illustrated

159.334 Computer Networks

B
Message
begins
here

Examples:

B
A

D
C

Telegrams
Pony express
Email
Voice Mail

Characteristic
Node by node
connections are
made to pass the
entire message
Generally no
identifiable direct
connection between
the sender and
receiver

Connection
to first
transit node
Connection
to second
transit node
Connection
to third
transit node

Computer Networks - 1/14

1/14

Packet Switching Illustrated - 1

159.334 Computer Networks

B
Message
begins
here

The message is broken up into smaller parts

(typically 1 to 1024 octets)..
There are 4 packets in this example

Example:
Public packet
switched
networks and
local area
networks...

Characteristic
1
2
3
4

Messages are
broken up
into small
parts which
are then sent
into the
network
Computer Networks - 1/15
1/15

Packet Switching Illustrated - 2

159.334 Computer Networks

Example:
B

Message
begins
here

Public packet
switched
networks and
local area
networks...

Characteristic
B
A

D
C

Messages are
broken up into
small parts which
are then sent into
the network
Message parts
may exist in
several places
Computer Networks - 1/16
1/16

Tutorial - Start
159.334 Computer Networks

Time Sequence Diagrams and

Optimal Packet Size

Computer Networks - 1/17

1/17

Message Sequence Diagram - 1

159.334 Computer Networks

We have considered three different switching modes in

previous lectures. Each mode can be used to handle different
communications scenarios.
Let us consider a general network with a source A, a
destination D and 2 intermediate nodes B and C. We wish to
illustrate the steps in transmitting a message from the source
to the destination and show the relative efficiencies of the
three techniques.
To do this, we shall employ a special type of diagram known
as the Message Sequence Diagram or Timing Diagram.
In this diagram, the nodes are shown from left to right in their
sequence and time increases down the page.
Computer Networks - 1/18
1/18

Message Sequence Diagram - 2

159.334 Computer Networks

Source

Destination

Communication Subnetwork
A

Messages

Time
Computer Networks - 1/19
1/19

Circuit Switching
159.334 Computer Networks

Connection delay

Propagation delay

Data transmission
time

Data

Time
Network delay for circuit switching

Start

Finish
Computer Networks - 1/20
1/20

Message Switching
B

159.334 Computer Networks

Time

Data transmission
time

Processing delay
Data
transmission
time

Processing delay
Data
transmission
time

Data

Header

Data

Header

Data

Network delay for message switching

Processing delay Header {

ComputerFinish
Networks - 1/21
1/21

Packet Switching
159.334 Computer Networks

Processing delay

Header

Packet transmission time

Header

Packet transmission time

Header

Packet transmission time

Processing delay

Processing delay

Network delay for packet switching

Time

Finish
Computer Networks - 1/22
1/22

Message Sequence Diagram - Summaries

159.334 Computer Networks

We shall now compare the performance of the three different

switching schemes by showing them on a set of message
sequence diagrams.
A

Circuit
Switching

Message
Switching

Packet
Switching
Computer Networks - 1/23
1/23

Discussion
159.334 Computer Networks

From the Message Sequence Diagrams, it is clear that

provided the message lengths are not too large,
packet switching is the preferred mode of
transmission in this case.
Note that the delay for message switching is
proportional to the product of the message length
and the number of hops; for packet switching it is
proportional to the product of the packet length and
the number of hops, plus a term which is proportional
to the message length.
The number of bits required to transmit the message
is minimised when we use circuit switching.
Computer Networks - 1/24
1/24

Optimal Packet Size? - An exercise

159.334 Computer Networks

Consider a message which is 30 octets in size. If

we break it up into smaller parts (packets) of 15,
10, 5, 3, 2 octets and assume that each requires a
header of length 3 octets.
What is the packet size which results in the
shortest transmission time from A to D (3 hops)?
Ignore node delays etc.

A-B-C-D
33 octets

Example: (Message switching case)

Length of packet = 3 + 30 = 33 octets

33 octets

Transmission A - B = 33 octets
Transmission B - C = 33 octets

33 octets

Transmission C - D = 33 octets
Total = 99 octets
Computer Networks - 1/25
1/25

Two examples.
159.334 Computer Networks

A-B-C-D
18 octets

A-B-C-D
13 octets
13 octets

18 octets

18 octets

You try some!

13 octets
13 octets
13 octets

18 octets
Two packets length = 15
Total = 4 x 18 = 72 octets

Three packets length = 10

Total = 5 x 13 = 65 octets
Computer Networks - 1/26
1/26

Optimal Packet Size Analysis

159.334 Computer Networks

120

Minimum value

100
80
60

Time
40

19

17

15

13

11

20

99
72
65
66
63
64
72
70
77
72
78
84
90
96
85

3
6
9
12
15
18
21
24
27
30
33
36
39
42
45

30
15
10
8
6
5
5
4
4
3
3
3
3
3
2

Time

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

Time for varying packet sizes

Message Length = 30 octets

Table of
Packets
Packet Size Headers
values:

Number of packets

Computer Networks - 1/27

1/27

Tutorial - End
159.334 Computer Networks

Time Sequence Diagrams and

Optimal Packet Size

Computer Networks - 1/28

1/28